fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r041-tajo-167813694400259
Last Updated
May 14, 2023

About the Execution of LTSMin+red for BridgeAndVehicles-PT-V50P50N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
575.747 84128.00 117017.00 98.00 ?FF?FTFTF?FFFFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694400259.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BridgeAndVehicles-PT-V50P50N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694400259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 18K Feb 25 12:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 12:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 343K Feb 25 12:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 12:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 579K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 398K Feb 25 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 25 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.0M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678618817827

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 11:00:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 11:00:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 11:00:19] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2023-03-12 11:00:19] [INFO ] Transformed 138 places.
[2023-03-12 11:00:19] [INFO ] Transformed 2348 transitions.
[2023-03-12 11:00:19] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 63 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 11:00:19] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2023-03-12 11:00:19] [INFO ] Computed 7 place invariants in 25 ms
[2023-03-12 11:00:20] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
[2023-03-12 11:00:20] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:00:20] [INFO ] Invariant cache hit.
[2023-03-12 11:00:21] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-12 11:00:21] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:00:21] [INFO ] Invariant cache hit.
[2023-03-12 11:00:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:00:21] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2023-03-12 11:00:21] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:00:21] [INFO ] Invariant cache hit.
[2023-03-12 11:00:22] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2857 ms. Remains : 138/138 places, 2348/2348 transitions.
Support contains 15 out of 138 places after structural reductions.
[2023-03-12 11:00:23] [INFO ] Flatten gal took : 340 ms
[2023-03-12 11:00:23] [INFO ] Flatten gal took : 126 ms
[2023-03-12 11:00:23] [INFO ] Input system was already deterministic with 2348 transitions.
Support contains 14 out of 138 places (down from 15) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 11:00:24] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:00:24] [INFO ] Invariant cache hit.
[2023-03-12 11:00:24] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 11:00:24] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 11:00:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2023-03-12 11:00:24] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 11:00:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:00:24] [INFO ] After 70ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 11:00:24] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-12 11:00:24] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 349 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 11:00:25] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 11:00:25] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 11:00:25] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1102 ms. Remains : 135/138 places, 2347/2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 273416 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 273416 steps, saw 73146 distinct states, run finished after 3002 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 11:00:29] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:00:29] [INFO ] Invariant cache hit.
[2023-03-12 11:00:29] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-12 11:00:29] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 11:00:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 11:00:29] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:00:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:00:29] [INFO ] After 56ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 11:00:29] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-12 11:00:29] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 219 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 135/135 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 405 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 11:00:30] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:00:30] [INFO ] Invariant cache hit.
[2023-03-12 11:00:30] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-12 11:00:30] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:00:30] [INFO ] Invariant cache hit.
[2023-03-12 11:00:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:00:31] [INFO ] Implicit Places using invariants and state equation in 855 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1270 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 133/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 211 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1888 ms. Remains : 133/135 places, 2347/2347 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 288702 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 288702 steps, saw 77222 distinct states, run finished after 3003 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 11:00:34] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 11:00:34] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 11:00:34] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 11:00:34] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 11:00:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 11:00:34] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:00:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:00:35] [INFO ] After 62ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 11:00:35] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-12 11:00:35] [INFO ] After 314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 229 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 198 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 11:00:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:00:35] [INFO ] Invariant cache hit.
[2023-03-12 11:00:35] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-12 11:00:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:00:35] [INFO ] Invariant cache hit.
[2023-03-12 11:00:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:00:36] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1261 ms to find 0 implicit places.
[2023-03-12 11:00:36] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-12 11:00:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:00:36] [INFO ] Invariant cache hit.
[2023-03-12 11:00:37] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2186 ms. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
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 1 with 4 rules applied. Total rules applied 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 20 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 129 cols
[2023-03-12 11:00:37] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 11:00:37] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 11:00:37] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 11:00:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 11:00:37] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:00:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 11:00:37] [INFO ] After 24ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 11:00:37] [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 27 ms.
[2023-03-12 11:00:37] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 136 transition count 2347
Applied a total of 3 rules in 357 ms. Remains 136 /138 variables (removed 2) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 11:00:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 136 cols
[2023-03-12 11:00:38] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 11:00:39] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
[2023-03-12 11:00:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:00:39] [INFO ] Invariant cache hit.
[2023-03-12 11:00:39] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-12 11:00:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:00:39] [INFO ] Invariant cache hit.
[2023-03-12 11:00:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:00:40] [INFO ] Implicit Places using invariants and state equation in 767 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1062 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 188 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2268 ms. Remains : 134/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 274 reset in 747 ms.
Product exploration explored 100000 steps with 274 reset in 633 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Graph (complete) has 3639 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 ms
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/134 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 137 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=68 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
[2023-03-12 11:00:42] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2023-03-12 11:00:42] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 11:00:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 11:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:00:42] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2023-03-12 11:00:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:00:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 11:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:00:43] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-12 11:00:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:00:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 11:00:48] [INFO ] [Nat]Added 42 Read/Feed constraints in 4532 ms returned sat
[2023-03-12 11:00:48] [INFO ] Deduced a trap composed of 5 places in 314 ms of which 1 ms to minimize.
[2023-03-12 11:00:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1124 ms
[2023-03-12 11:00:49] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 115 ms.
[2023-03-12 11:00:51] [INFO ] Added : 49 causal constraints over 10 iterations in 2472 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 304 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 11:00:52] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:00:52] [INFO ] Invariant cache hit.
[2023-03-12 11:00:52] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
[2023-03-12 11:00:52] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:00:52] [INFO ] Invariant cache hit.
[2023-03-12 11:00:53] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-12 11:00:53] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:00:53] [INFO ] Invariant cache hit.
[2023-03-12 11:00:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:00:53] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2023-03-12 11:00:53] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-12 11:00:53] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:00:53] [INFO ] Invariant cache hit.
[2023-03-12 11:00:54] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2705 ms. Remains : 134/134 places, 2347/2347 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Graph (complete) has 3639 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/134 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=31 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-12 11:00:54] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:00:54] [INFO ] Invariant cache hit.
[2023-03-12 11:00:55] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 11:00:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:00:55] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2023-03-12 11:00:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:00:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 11:00:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:00:56] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-12 11:00:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:00:57] [INFO ] [Nat]Added 42 Read/Feed constraints in 756 ms returned sat
[2023-03-12 11:00:57] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 1 ms to minimize.
[2023-03-12 11:00:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 849 ms
[2023-03-12 11:00:58] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 70 ms.
[2023-03-12 11:00:58] [INFO ] Added : 19 causal constraints over 5 iterations in 465 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 274 reset in 765 ms.
Product exploration explored 100000 steps with 274 reset in 695 ms.
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 182 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 11:01:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:01:00] [INFO ] Invariant cache hit.
[2023-03-12 11:01:00] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
[2023-03-12 11:01:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:01:00] [INFO ] Invariant cache hit.
[2023-03-12 11:01:01] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-12 11:01:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:01:01] [INFO ] Invariant cache hit.
[2023-03-12 11:01:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:01:01] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
[2023-03-12 11:01:01] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-12 11:01:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:01:01] [INFO ] Invariant cache hit.
[2023-03-12 11:01:02] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2417 ms. Remains : 134/134 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-00 finished in 24640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 13 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 11:01:02] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2023-03-12 11:01:02] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 11:01:03] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
[2023-03-12 11:01:03] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:03] [INFO ] Invariant cache hit.
[2023-03-12 11:01:03] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-12 11:01:03] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:03] [INFO ] Invariant cache hit.
[2023-03-12 11:01:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:01:04] [INFO ] Implicit Places using invariants and state equation in 783 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1062 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 11 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1725 ms. Remains : 135/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02 finished in 1831 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||G(p1)))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 185 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 11:01:04] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2023-03-12 11:01:04] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-12 11:01:05] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
[2023-03-12 11:01:05] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:05] [INFO ] Invariant cache hit.
[2023-03-12 11:01:05] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-12 11:01:05] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:05] [INFO ] Invariant cache hit.
[2023-03-12 11:01:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:01:06] [INFO ] Implicit Places using invariants and state equation in 1143 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1416 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 195 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2430 ms. Remains : 136/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s113 s53), p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 241 reset in 596 ms.
Product exploration explored 100000 steps with 241 reset in 588 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3642 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 229 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 261 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 183 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 11:01:09] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 11:01:09] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 11:01:09] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
[2023-03-12 11:01:09] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:09] [INFO ] Invariant cache hit.
[2023-03-12 11:01:09] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-12 11:01:09] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:09] [INFO ] Invariant cache hit.
[2023-03-12 11:01:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:01:10] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
[2023-03-12 11:01:10] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-12 11:01:10] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:10] [INFO ] Invariant cache hit.
[2023-03-12 11:01:11] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2431 ms. Remains : 136/136 places, 2348/2348 transitions.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3642 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 192 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1468 steps, including 3 resets, run visited all 2 properties in 18 ms. (steps per millisecond=81 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 254 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 241 reset in 561 ms.
Product exploration explored 100000 steps with 241 reset in 587 ms.
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 212 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 11:01:13] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:13] [INFO ] Invariant cache hit.
[2023-03-12 11:01:14] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
[2023-03-12 11:01:14] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:14] [INFO ] Invariant cache hit.
[2023-03-12 11:01:14] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-12 11:01:14] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:14] [INFO ] Invariant cache hit.
[2023-03-12 11:01:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:01:14] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 971 ms to find 0 implicit places.
[2023-03-12 11:01:15] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-12 11:01:15] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:15] [INFO ] Invariant cache hit.
[2023-03-12 11:01:15] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2579 ms. Remains : 136/136 places, 2348/2348 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03 finished in 11357 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 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 177 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 11:01:16] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 11:01:16] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 11:01:16] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
[2023-03-12 11:01:16] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:16] [INFO ] Invariant cache hit.
[2023-03-12 11:01:16] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-12 11:01:16] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:16] [INFO ] Invariant cache hit.
[2023-03-12 11:01:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:01:17] [INFO ] Implicit Places using invariants and state equation in 935 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1234 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 180 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2265 ms. Remains : 134/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s109 s52)], 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 412 steps with 0 reset in 4 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04 finished in 2320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(!p0))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 13 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 11:01:18] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2023-03-12 11:01:18] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 11:01:18] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
[2023-03-12 11:01:18] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:18] [INFO ] Invariant cache hit.
[2023-03-12 11:01:19] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-12 11:01:19] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:19] [INFO ] Invariant cache hit.
[2023-03-12 11:01:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:01:19] [INFO ] Implicit Places using invariants and state equation in 727 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1007 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 11 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1701 ms. Remains : 135/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, true, p0, (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s53 s54)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-08 finished in 1834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(p0) U p1)&&G(F(p2))))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 22 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 11:01:19] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 11:01:20] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 11:01:20] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
[2023-03-12 11:01:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:01:20] [INFO ] Invariant cache hit.
[2023-03-12 11:01:20] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-12 11:01:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:01:20] [INFO ] Invariant cache hit.
[2023-03-12 11:01:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:01:21] [INFO ] Implicit Places using invariants and state equation in 831 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1096 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 10 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1772 ms. Remains : 134/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}, { cond=true, acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 3 s112), p0:(LEQ 2 s107), p2:(OR (LEQ 2 s107) (LEQ s20 s109))], 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 241 reset in 591 ms.
Product exploration explored 100000 steps with 241 reset in 768 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/134 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), true, (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 347 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Finished Best-First random walk after 452 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=226 )
Knowledge obtained : [(AND p1 (NOT p0) p2), true, (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 7 factoid took 230 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 57 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p2), (NOT p2)]
Support contains 3 out of 134 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 2346
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 131 transition count 2345
Applied a total of 5 rules in 222 ms. Remains 131 /134 variables (removed 3) and now considering 2345/2347 (removed 2) transitions.
[2023-03-12 11:01:24] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
// Phase 1: matrix 287 rows 131 cols
[2023-03-12 11:01:24] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 11:01:24] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-12 11:01:24] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
[2023-03-12 11:01:24] [INFO ] Invariant cache hit.
[2023-03-12 11:01:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:01:26] [INFO ] Implicit Places using invariants and state equation in 1616 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
[2023-03-12 11:01:26] [INFO ] Redundant transitions in 94 ms returned []
[2023-03-12 11:01:26] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
[2023-03-12 11:01:26] [INFO ] Invariant cache hit.
[2023-03-12 11:01:27] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/134 places, 2345/2347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2984 ms. Remains : 131/134 places, 2345/2347 transitions.
Computed a total of 105 stabilizing places and 202 stable transitions
Computed a total of 105 stabilizing places and 202 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 50 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Finished Best-First random walk after 180 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=90 )
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 96 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 73 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 320 reset in 642 ms.
Product exploration explored 100000 steps with 320 reset in 654 ms.
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 2345/2345 transitions.
Applied a total of 0 rules in 213 ms. Remains 131 /131 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
[2023-03-12 11:01:29] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
[2023-03-12 11:01:29] [INFO ] Invariant cache hit.
[2023-03-12 11:01:29] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-12 11:01:29] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
[2023-03-12 11:01:29] [INFO ] Invariant cache hit.
[2023-03-12 11:01:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:01:30] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
[2023-03-12 11:01:30] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-12 11:01:30] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
[2023-03-12 11:01:30] [INFO ] Invariant cache hit.
[2023-03-12 11:01:31] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2388 ms. Remains : 131/131 places, 2345/2345 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09 finished in 11587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 19 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 11:01:31] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 11:01:31] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 11:01:32] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
[2023-03-12 11:01:32] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:01:32] [INFO ] Invariant cache hit.
[2023-03-12 11:01:32] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-12 11:01:32] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:01:32] [INFO ] Invariant cache hit.
[2023-03-12 11:01:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:01:33] [INFO ] Implicit Places using invariants and state equation in 781 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1077 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 10 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1721 ms. Remains : 134/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10 finished in 1798 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&&G(F(p1))))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 13 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 11:01:33] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2023-03-12 11:01:33] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 11:01:33] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
[2023-03-12 11:01:33] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:34] [INFO ] Invariant cache hit.
[2023-03-12 11:01:34] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-12 11:01:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 11:01:34] [INFO ] Invariant cache hit.
[2023-03-12 11:01:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:01:35] [INFO ] Implicit Places using invariants and state equation in 925 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1190 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 10 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1840 ms. Remains : 135/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT 1 s53), p1:(LEQ s52 s112)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13 finished in 1998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 21 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 11:01:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 11:01:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 11:01:35] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
[2023-03-12 11:01:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:01:35] [INFO ] Invariant cache hit.
[2023-03-12 11:01:36] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-12 11:01:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 11:01:36] [INFO ] Invariant cache hit.
[2023-03-12 11:01:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 11:01:37] [INFO ] Implicit Places using invariants and state equation in 986 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1260 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 11 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1881 ms. Remains : 133/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s121 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 923 ms.
Product exploration explored 100000 steps with 50000 reset in 1003 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-15 finished in 3946 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)))'
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||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(p0) U p1)&&G(F(p2))))))'
[2023-03-12 11:01:39] [INFO ] Flatten gal took : 95 ms
[2023-03-12 11:01:39] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 11:01:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 2348 transitions and 18090 arcs took 20 ms.
Total runtime 80435 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1282/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1282/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1282/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-00
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09

BK_STOP 1678618901955

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-PT-V50P50N20-LTLCardinality-00
ltl formula formula --ltl=/tmp/1282/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 138 places, 2348 transitions and 18090 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1282/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1282/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1282/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.460 real 0.090 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1282/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03
ltl formula formula --ltl=/tmp/1282/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 138 places, 2348 transitions and 18090 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.610 real 0.080 user 0.130 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1282/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1282/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1282/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1282/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55f4eafd83f4]
1: pnml2lts-mc(+0xa2496) [0x55f4eafd8496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f95f94d4140]
3: pnml2lts-mc(+0x405be5) [0x55f4eb33bbe5]
4: pnml2lts-mc(+0x16b3f9) [0x55f4eb0a13f9]
5: pnml2lts-mc(+0x164ac4) [0x55f4eb09aac4]
6: pnml2lts-mc(+0x272e0a) [0x55f4eb1a8e0a]
7: pnml2lts-mc(+0xb61f0) [0x55f4eafec1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f95f93274d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f95f932767a]
10: pnml2lts-mc(+0xa1581) [0x55f4eafd7581]
11: pnml2lts-mc(+0xa1910) [0x55f4eafd7910]
12: pnml2lts-mc(+0xa32a2) [0x55f4eafd92a2]
13: pnml2lts-mc(+0xa50f4) [0x55f4eafdb0f4]
14: pnml2lts-mc(+0x3f34b3) [0x55f4eb3294b3]
15: pnml2lts-mc(+0x7c63d) [0x55f4eafb263d]
16: pnml2lts-mc(+0x67d86) [0x55f4eaf9dd86]
17: pnml2lts-mc(+0x60a8a) [0x55f4eaf96a8a]
18: pnml2lts-mc(+0x5eb15) [0x55f4eaf94b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f95f930fd0a]
20: pnml2lts-mc(+0x6075e) [0x55f4eaf9675e]
ltl formula name BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09
ltl formula formula --ltl=/tmp/1282/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 138 places, 2348 transitions and 18090 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.410 real 0.100 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1282/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1282/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1282/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1282/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V50P50N20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-PT-V50P50N20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694400259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P50N20.tgz
mv BridgeAndVehicles-PT-V50P50N20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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