Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472283101020.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Szymanski-PT-a10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472283101020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Jun 7 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 7 17:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 7 17:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Jun 7 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 101K Jun 6 12:11 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 Szymanski-PT-a10-LTLFireability-00
FORMULA_NAME Szymanski-PT-a10-LTLFireability-01
FORMULA_NAME Szymanski-PT-a10-LTLFireability-02
FORMULA_NAME Szymanski-PT-a10-LTLFireability-03
FORMULA_NAME Szymanski-PT-a10-LTLFireability-04
FORMULA_NAME Szymanski-PT-a10-LTLFireability-05
FORMULA_NAME Szymanski-PT-a10-LTLFireability-06
FORMULA_NAME Szymanski-PT-a10-LTLFireability-07
FORMULA_NAME Szymanski-PT-a10-LTLFireability-08
FORMULA_NAME Szymanski-PT-a10-LTLFireability-09
FORMULA_NAME Szymanski-PT-a10-LTLFireability-10
FORMULA_NAME Szymanski-PT-a10-LTLFireability-11
FORMULA_NAME Szymanski-PT-a10-LTLFireability-12
FORMULA_NAME Szymanski-PT-a10-LTLFireability-13
FORMULA_NAME Szymanski-PT-a10-LTLFireability-14
FORMULA_NAME Szymanski-PT-a10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654970600939

Running Version 202205111006
[2022-06-11 18:03:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 18:03:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 18:03:22] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2022-06-11 18:03:22] [INFO ] Transformed 61 places.
[2022-06-11 18:03:22] [INFO ] Transformed 224 transitions.
[2022-06-11 18:03:22] [INFO ] Parsed PT model containing 61 places and 224 transitions in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 46 transition count 212
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 46 transition count 212
Applied a total of 4 rules in 17 ms. Remains 46 /49 variables (removed 3) and now considering 212/216 (removed 4) transitions.
[2022-06-11 18:03:22] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
// Phase 1: matrix 78 rows 46 cols
[2022-06-11 18:03:22] [INFO ] Computed 1 place invariants in 8 ms
[2022-06-11 18:03:22] [INFO ] Implicit Places using invariants in 154 ms returned []
[2022-06-11 18:03:22] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
// Phase 1: matrix 78 rows 46 cols
[2022-06-11 18:03:22] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:22] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:03:22] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2022-06-11 18:03:22] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
// Phase 1: matrix 78 rows 46 cols
[2022-06-11 18:03:22] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-11 18:03:22] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/49 places, 212/216 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/49 places, 212/216 transitions.
Support contains 23 out of 46 places after structural reductions.
[2022-06-11 18:03:23] [INFO ] Flatten gal took : 41 ms
[2022-06-11 18:03:23] [INFO ] Flatten gal took : 27 ms
[2022-06-11 18:03:23] [INFO ] Input system was already deterministic with 212 transitions.
Incomplete random walk after 10009 steps, including 6 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 27) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2022-06-11 18:03:23] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
// Phase 1: matrix 78 rows 46 cols
[2022-06-11 18:03:23] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-11 18:03:23] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 18:03:23] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2022-06-11 18:03:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:03:23] [INFO ] After 9ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-11 18:03:23] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-11 18:03:23] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 18:03:24] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2022-06-11 18:03:24] [INFO ] After 32ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2022-06-11 18:03:24] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-06-11 18:03:24] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 8 out of 46 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 46/46 places, 212/212 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 211
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 44 transition count 203
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 44 transition count 203
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 21 place count 44 transition count 187
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 42 transition count 179
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 42 transition count 179
Applied a total of 25 rules in 28 ms. Remains 42 /46 variables (removed 4) and now considering 179/212 (removed 33) transitions.
Finished structural reductions, in 1 iterations. Remains : 42/46 places, 179/212 transitions.
Incomplete random walk after 10005 steps, including 4 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Finished probabilistic random walk after 126114 steps, run visited all 7 properties in 291 ms. (steps per millisecond=433 )
Probabilistic random walk after 126114 steps, saw 95379 distinct states, run finished after 291 ms. (steps per millisecond=433 ) properties seen :7
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 9 stabilizing places and 36 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((X(X(p0))&&G(p0))))&&F(!(p1 U X(p1)))))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 44 transition count 204
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 204
Applied a total of 4 rules in 3 ms. Remains 44 /46 variables (removed 2) and now considering 204/212 (removed 8) transitions.
[2022-06-11 18:03:25] [INFO ] Flow matrix only has 76 transitions (discarded 128 similar events)
// Phase 1: matrix 76 rows 44 cols
[2022-06-11 18:03:25] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-11 18:03:25] [INFO ] Implicit Places using invariants in 53 ms returned []
[2022-06-11 18:03:25] [INFO ] Flow matrix only has 76 transitions (discarded 128 similar events)
// Phase 1: matrix 76 rows 44 cols
[2022-06-11 18:03:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:25] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:03:25] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2022-06-11 18:03:25] [INFO ] Flow matrix only has 76 transitions (discarded 128 similar events)
// Phase 1: matrix 76 rows 44 cols
[2022-06-11 18:03:25] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-11 18:03:25] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/46 places, 204/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/46 places, 204/212 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (OR (NOT p0) p1), true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : Szymanski-PT-a10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s0 1) (GEQ s35 1)), p1:(AND (GEQ s0 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Szymanski-PT-a10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a10-LTLFireability-00 finished in 568 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||!((F(p1)&&F(p2)) U p0)))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Applied a total of 8 rules in 4 ms. Remains 42 /46 variables (removed 4) and now considering 196/212 (removed 16) transitions.
[2022-06-11 18:03:25] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:03:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:25] [INFO ] Implicit Places using invariants in 44 ms returned []
[2022-06-11 18:03:25] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:03:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:25] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:03:25] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-06-11 18:03:25] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:03:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:25] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 196/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/46 places, 196/212 transitions.
Stuttering acceptance computed with spot in 727 ms :[true, (NOT p0), p0, (AND p0 p2), (AND p0 p1 p2), (AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND p0 p1), (AND (NOT p0) p1), p1, p2, (AND p1 p2), false, false, false, false, false]
Running random walk in product with property : Szymanski-PT-a10-LTLFireability-01 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=p0, acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 10}], [{ cond=(AND p1 p2 p0), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 11}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND p2 p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 10}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 11}], [{ cond=(AND p1 p0), acceptance={} source=7 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 9}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 0}, { cond=(AND p1 p0), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 9}], [{ cond=p1, acceptance={} source=9 dest: 0}, { cond=(NOT p1), acceptance={} source=9 dest: 9}], [{ cond=p2, acceptance={} source=10 dest: 0}, { cond=(NOT p2), acceptance={} source=10 dest: 10}], [{ cond=(AND p1 p2), acceptance={} source=11 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=11 dest: 9}, { cond=(AND p1 (NOT p2)), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=11 dest: 11}], [{ cond=p0, acceptance={} source=12 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=12 dest: 13}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=12 dest: 14}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=12 dest: 15}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=12 dest: 16}], [{ cond=(AND p1 p2 p0), acceptance={} source=13 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=13 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=13 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=13 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=13 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=13 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=13 dest: 8}], [{ cond=(AND p1 p0), acceptance={} source=14 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=14 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=14 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=14 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=14 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=14 dest: 8}], [{ cond=(AND p2 p0), acceptance={} source=15 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=15 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=15 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=15 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=15 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=15 dest: 7}], [{ cond=p0, acceptance={} source=16 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=16 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=16 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=16 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=16 dest: 7}]], initial=12, aps=[p0:(AND (GEQ s2 1) (GEQ s39 1)), p1:(AND (GEQ s3 1) (GEQ s23 1)), p2:(AND (GEQ s6 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 550 reset in 458 ms.
Entered a terminal (fully accepting) state of product in 71513 steps with 384 reset in 211 ms.
FORMULA Szymanski-PT-a10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a10-LTLFireability-01 finished in 1633 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(X(!(F(!X(p0)) U p1)))))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 42 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 41 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 41 transition count 184
Applied a total of 18 rules in 27 ms. Remains 41 /46 variables (removed 5) and now considering 184/212 (removed 28) transitions.
[2022-06-11 18:03:27] [INFO ] Flow matrix only has 71 transitions (discarded 113 similar events)
// Phase 1: matrix 71 rows 41 cols
[2022-06-11 18:03:27] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:27] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-06-11 18:03:27] [INFO ] Flow matrix only has 71 transitions (discarded 113 similar events)
// Phase 1: matrix 71 rows 41 cols
[2022-06-11 18:03:27] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:03:27] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2022-06-11 18:03:27] [INFO ] Redundant transitions in 5 ms returned []
[2022-06-11 18:03:27] [INFO ] Flow matrix only has 71 transitions (discarded 113 similar events)
// Phase 1: matrix 71 rows 41 cols
[2022-06-11 18:03:27] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-11 18:03:27] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/46 places, 184/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/46 places, 184/212 transitions.
Stuttering acceptance computed with spot in 159 ms :[p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Szymanski-PT-a10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s16 1)), p0:(AND (GEQ s2 1) (GEQ s23 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 473 reset in 208 ms.
Stack based approach found an accepted trace after 3260 steps with 17 reset with depth 143 and stack size 139 in 8 ms.
FORMULA Szymanski-PT-a10-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-a10-LTLFireability-02 finished in 660 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(!p0 U G(X((G(!X(p0))&&(p1 U p2)))))))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 200
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 200
Applied a total of 6 rules in 2 ms. Remains 43 /46 variables (removed 3) and now considering 200/212 (removed 12) transitions.
[2022-06-11 18:03:28] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2022-06-11 18:03:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-11 18:03:28] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-06-11 18:03:28] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2022-06-11 18:03:28] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:03:28] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2022-06-11 18:03:28] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2022-06-11 18:03:28] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:28] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 200/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/46 places, 200/212 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : Szymanski-PT-a10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s23 1)), p1:(AND (GEQ s3 1) (GEQ s40 1)), p2:(AND (GEQ s1 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25046 reset in 174 ms.
Product exploration explored 100000 steps with 24971 reset in 168 ms.
Computed a total of 9 stabilizing places and 36 stable transitions
Computed a total of 9 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT (OR p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Incomplete random walk after 10008 steps, including 6 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-11 18:03:29] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2022-06-11 18:03:29] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-11 18:03:29] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 18:03:29] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-11 18:03:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:03:29] [INFO ] After 4ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 18:03:29] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 18:03:29] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 18:03:29] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 18:03:29] [INFO ] After 9ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 18:03:29] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-11 18:03:29] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 43/43 places, 200/200 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 199
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 17 place count 43 transition count 183
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 41 transition count 175
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 41 transition count 175
Applied a total of 21 rules in 11 ms. Remains 41 /43 variables (removed 2) and now considering 175/200 (removed 25) transitions.
Finished structural reductions, in 1 iterations. Remains : 41/43 places, 175/200 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1866 steps, run visited all 2 properties in 16 ms. (steps per millisecond=116 )
Probabilistic random walk after 1866 steps, saw 1372 distinct states, run finished after 16 ms. (steps per millisecond=116 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT (OR p1 p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (OR p1 p2))]
Knowledge based reduction with 5 factoid took 285 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 404 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2022-06-11 18:03:30] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2022-06-11 18:03:30] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:30] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-06-11 18:03:30] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2022-06-11 18:03:30] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:03:30] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2022-06-11 18:03:30] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2022-06-11 18:03:30] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-11 18:03:30] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/43 places, 200/200 transitions.
Computed a total of 9 stabilizing places and 36 stable transitions
Computed a total of 9 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT (OR p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-11 18:03:31] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2022-06-11 18:03:31] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:31] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 18:03:31] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-11 18:03:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:03:31] [INFO ] After 4ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 18:03:31] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 18:03:31] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 18:03:31] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 18:03:31] [INFO ] After 9ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 18:03:31] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-11 18:03:31] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 43/43 places, 200/200 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 199
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 17 place count 43 transition count 183
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 41 transition count 175
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 41 transition count 175
Applied a total of 21 rules in 11 ms. Remains 41 /43 variables (removed 2) and now considering 175/200 (removed 25) transitions.
Finished structural reductions, in 1 iterations. Remains : 41/43 places, 175/200 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1866 steps, run visited all 2 properties in 11 ms. (steps per millisecond=169 )
Probabilistic random walk after 1866 steps, saw 1372 distinct states, run finished after 11 ms. (steps per millisecond=169 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT (OR p1 p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (OR p1 p2))]
Knowledge based reduction with 5 factoid took 286 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 24976 reset in 130 ms.
Product exploration explored 100000 steps with 24921 reset in 133 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 200/200 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 43 transition count 188
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 41 transition count 180
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 41 transition count 180
Applied a total of 16 rules in 15 ms. Remains 41 /43 variables (removed 2) and now considering 180/200 (removed 20) transitions.
[2022-06-11 18:03:32] [INFO ] Redundant transitions in 6 ms returned []
[2022-06-11 18:03:32] [INFO ] Flow matrix only has 70 transitions (discarded 110 similar events)
// Phase 1: matrix 70 rows 41 cols
[2022-06-11 18:03:32] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:32] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/43 places, 180/200 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/43 places, 180/200 transitions.
Product exploration explored 100000 steps with 25015 reset in 155 ms.
Product exploration explored 100000 steps with 24998 reset in 169 ms.
Built C files in :
/tmp/ltsmin832285064239987575
[2022-06-11 18:03:33] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin832285064239987575
Running compilation step : cd /tmp/ltsmin832285064239987575;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 391 ms.
Running link step : cd /tmp/ltsmin832285064239987575;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin832285064239987575;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10208515892520493336.hoa' '--buchi-type=spotba'
LTSmin run took 99 ms.
FORMULA Szymanski-PT-a10-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Szymanski-PT-a10-LTLFireability-04 finished in 5614 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((!F(p1)||p2) U p2)))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 24 place count 42 transition count 180
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 41 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 41 transition count 176
Applied a total of 26 rules in 16 ms. Remains 41 /46 variables (removed 5) and now considering 176/212 (removed 36) transitions.
[2022-06-11 18:03:33] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
// Phase 1: matrix 69 rows 41 cols
[2022-06-11 18:03:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:33] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-06-11 18:03:33] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
// Phase 1: matrix 69 rows 41 cols
[2022-06-11 18:03:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:03:33] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2022-06-11 18:03:33] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-11 18:03:33] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
// Phase 1: matrix 69 rows 41 cols
[2022-06-11 18:03:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:33] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/46 places, 176/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/46 places, 176/212 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p2)), true, p1, (NOT p0), (NOT p2), (AND p1 (NOT p0))]
Running random walk in product with property : Szymanski-PT-a10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s21 1)), p2:(AND (GEQ s3 1) (GEQ s11 1)), p1:(AND (GEQ s2 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 85 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-a10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a10-LTLFireability-05 finished in 378 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(G(!(p0 U X(p1))))||F(p0)))||X(p2)))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Applied a total of 8 rules in 4 ms. Remains 42 /46 variables (removed 4) and now considering 196/212 (removed 16) transitions.
[2022-06-11 18:03:34] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:03:34] [INFO ] Computed 1 place invariants in 11 ms
[2022-06-11 18:03:34] [INFO ] Implicit Places using invariants in 83 ms returned []
[2022-06-11 18:03:34] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:03:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-11 18:03:34] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:03:34] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2022-06-11 18:03:34] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:03:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-11 18:03:34] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 196/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/46 places, 196/212 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Szymanski-PT-a10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s21 1)), p2:(AND (GEQ s3 1) (GEQ s8 1)), p1:(AND (GEQ s1 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1091 reset in 172 ms.
Product exploration explored 100000 steps with 1091 reset in 191 ms.
Computed a total of 8 stabilizing places and 32 stable transitions
Computed a total of 8 stabilizing places and 32 stable transitions
Detected a total of 8/42 stabilizing places and 32/196 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 311 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 1004 steps, including 2 resets, run visited all 2 properties in 3 ms. (steps per millisecond=334 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 229 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 42 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2022-06-11 18:03:35] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:03:35] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-11 18:03:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2022-06-11 18:03:35] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:03:35] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-11 18:03:35] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:03:35] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2022-06-11 18:03:35] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:03:35] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-11 18:03:35] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/42 places, 196/196 transitions.
Computed a total of 8 stabilizing places and 32 stable transitions
Computed a total of 8 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 980 steps, including 2 resets, run visited all 2 properties in 3 ms. (steps per millisecond=326 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 1088 reset in 185 ms.
Product exploration explored 100000 steps with 1090 reset in 194 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 196/196 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 42 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 40 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 40 transition count 176
Applied a total of 16 rules in 15 ms. Remains 40 /42 variables (removed 2) and now considering 176/196 (removed 20) transitions.
[2022-06-11 18:03:36] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-11 18:03:37] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
// Phase 1: matrix 69 rows 40 cols
[2022-06-11 18:03:37] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-11 18:03:37] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/42 places, 176/196 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/42 places, 176/196 transitions.
Product exploration explored 100000 steps with 925 reset in 225 ms.
Product exploration explored 100000 steps with 940 reset in 225 ms.
Built C files in :
/tmp/ltsmin18186209262441338166
[2022-06-11 18:03:37] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18186209262441338166
Running compilation step : cd /tmp/ltsmin18186209262441338166;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 283 ms.
Running link step : cd /tmp/ltsmin18186209262441338166;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18186209262441338166;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11965838359599320257.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2022-06-11 18:03:52] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:03:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:52] [INFO ] Implicit Places using invariants in 49 ms returned []
[2022-06-11 18:03:52] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:03:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:03:52] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-06-11 18:03:52] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:03:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:03:52] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/42 places, 196/196 transitions.
Built C files in :
/tmp/ltsmin9430555586204787915
[2022-06-11 18:03:52] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9430555586204787915
Running compilation step : cd /tmp/ltsmin9430555586204787915;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 285 ms.
Running link step : cd /tmp/ltsmin9430555586204787915;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9430555586204787915;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5735238739502544388.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 18:04:07] [INFO ] Flatten gal took : 12 ms
[2022-06-11 18:04:08] [INFO ] Flatten gal took : 11 ms
[2022-06-11 18:04:08] [INFO ] Time to serialize gal into /tmp/LTL12727261656002010985.gal : 3 ms
[2022-06-11 18:04:08] [INFO ] Time to serialize properties into /tmp/LTL709818642484560680.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12727261656002010985.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL709818642484560680.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1272726...266
Read 1 LTL properties
Checking formula 0 : !(((F((F(G(!(("((s2>=1)&&(l15>=1))")U(X("((s1>=1)&&(l17>=1))"))))))||(F("((s2>=1)&&(l15>=1))"))))||(X("((s3>=1)&&(l0>=1))"))))
Formula 0 simplified : !(F(FG!("((s2>=1)&&(l15>=1))" U X"((s1>=1)&&(l17>=1))") | F"((s2>=1)&&(l15>=1))") | X"((s3>=1)&&(l0>=1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t19, t20, t42, t43, t53, t54, t71, t102, t103, t145, t153, t154, t155, t156, t172, t1...283
Computing Next relation with stutter on 6.25578e+12 deadlock states
Detected timeout of ITS tools.
[2022-06-11 18:04:23] [INFO ] Flatten gal took : 10 ms
[2022-06-11 18:04:23] [INFO ] Applying decomposition
[2022-06-11 18:04:23] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10577284192741434135.txt' '-o' '/tmp/graph10577284192741434135.bin' '-w' '/tmp/graph10577284192741434135.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10577284192741434135.bin' '-l' '-1' '-v' '-w' '/tmp/graph10577284192741434135.weights' '-q' '0' '-e' '0.001'
[2022-06-11 18:04:23] [INFO ] Decomposing Gal with order
[2022-06-11 18:04:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 18:04:23] [INFO ] Removed a total of 326 redundant transitions.
[2022-06-11 18:04:23] [INFO ] Flatten gal took : 49 ms
[2022-06-11 18:04:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 7 ms.
[2022-06-11 18:04:23] [INFO ] Time to serialize gal into /tmp/LTL13625123267904574630.gal : 2 ms
[2022-06-11 18:04:23] [INFO ] Time to serialize properties into /tmp/LTL11603773698287174388.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13625123267904574630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11603773698287174388.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1362512...247
Read 1 LTL properties
Checking formula 0 : !(((F((F(G(!(("((u0.s2>=1)&&(i2.u4.l15>=1))")U(X("((i5.u9.s1>=1)&&(u5.l17>=1))"))))))||(F("((u0.s2>=1)&&(i2.u4.l15>=1))"))))||(X("((i2...183
Formula 0 simplified : !(F(FG!("((u0.s2>=1)&&(i2.u4.l15>=1))" U X"((i5.u9.s1>=1)&&(u5.l17>=1))") | F"((u0.s2>=1)&&(i2.u4.l15>=1))") | X"((i2.u4.s3>=1)&&(u0...165
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t19, t20, t42, t43, t53, t54, t71, t102, t145, t153, t154, t155, t156, t172, t195, t2...285
Computing Next relation with stutter on 6.25578e+12 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4603959926735010237
[2022-06-11 18:04:38] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4603959926735010237
Running compilation step : cd /tmp/ltsmin4603959926735010237;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 288 ms.
Running link step : cd /tmp/ltsmin4603959926735010237;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin4603959926735010237;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((<>([](!((LTLAPp0==true) U X((LTLAPp1==true)))))||<>((LTLAPp0==true))))||X((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Szymanski-PT-a10-LTLFireability-06 finished in 79316 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(F(G((F(p1) U X(!F(p1)))))))&&p0)))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Applied a total of 8 rules in 8 ms. Remains 42 /46 variables (removed 4) and now considering 196/212 (removed 16) transitions.
[2022-06-11 18:04:53] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:04:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:04:53] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-06-11 18:04:53] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:04:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:04:53] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:04:53] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2022-06-11 18:04:53] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:04:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:04:53] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 196/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/46 places, 196/212 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : Szymanski-PT-a10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s32 1)), p1:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-a10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a10-LTLFireability-07 finished in 373 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((false U p0)))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 200
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 200
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 22 place count 43 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 41 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 41 transition count 176
Applied a total of 26 rules in 13 ms. Remains 41 /46 variables (removed 5) and now considering 176/212 (removed 36) transitions.
[2022-06-11 18:04:53] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
// Phase 1: matrix 69 rows 41 cols
[2022-06-11 18:04:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-11 18:04:53] [INFO ] Implicit Places using invariants in 49 ms returned []
[2022-06-11 18:04:53] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
// Phase 1: matrix 69 rows 41 cols
[2022-06-11 18:04:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:04:53] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:04:53] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2022-06-11 18:04:53] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-11 18:04:53] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
// Phase 1: matrix 69 rows 41 cols
[2022-06-11 18:04:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-11 18:04:53] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/46 places, 176/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/46 places, 176/212 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-a10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s12 1)) (AND (GEQ s2 1) (GEQ s13 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 23574 steps with 1060 reset in 40 ms.
FORMULA Szymanski-PT-a10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a10-LTLFireability-08 finished in 311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(F(!p0))||F(p1))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Applied a total of 8 rules in 1 ms. Remains 42 /46 variables (removed 4) and now considering 196/212 (removed 16) transitions.
[2022-06-11 18:04:54] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:04:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:04:54] [INFO ] Implicit Places using invariants in 34 ms returned []
[2022-06-11 18:04:54] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:04:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:04:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:04:54] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2022-06-11 18:04:54] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:04:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:04:54] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 196/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/46 places, 196/212 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0), true]
Running random walk in product with property : Szymanski-PT-a10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s29 1)), p0:(OR (LT s0 1) (LT s9 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 2 reset in 1 ms.
FORMULA Szymanski-PT-a10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a10-LTLFireability-11 finished in 292 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 24 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 40 transition count 172
Applied a total of 28 rules in 13 ms. Remains 40 /46 variables (removed 6) and now considering 172/212 (removed 40) transitions.
[2022-06-11 18:04:54] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
// Phase 1: matrix 68 rows 40 cols
[2022-06-11 18:04:54] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-11 18:04:54] [INFO ] Implicit Places using invariants in 43 ms returned []
[2022-06-11 18:04:54] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
// Phase 1: matrix 68 rows 40 cols
[2022-06-11 18:04:54] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-11 18:04:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:04:54] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2022-06-11 18:04:54] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-11 18:04:54] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
// Phase 1: matrix 68 rows 40 cols
[2022-06-11 18:04:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:04:54] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/46 places, 172/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/46 places, 172/212 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-a10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1499 steps with 169 reset in 7 ms.
FORMULA Szymanski-PT-a10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a10-LTLFireability-13 finished in 276 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((!(X(p0) U F(p1))&&!(p1 U X(p2))))||X(!p0)))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 212/212 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 196
Applied a total of 8 rules in 3 ms. Remains 42 /46 variables (removed 4) and now considering 196/212 (removed 16) transitions.
[2022-06-11 18:04:54] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:04:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:04:54] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-06-11 18:04:54] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:04:54] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-11 18:04:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 18:04:54] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2022-06-11 18:04:54] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-06-11 18:04:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-11 18:04:54] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 196/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/46 places, 196/212 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p2) (AND p0 p1)), (OR (AND p0 p2) (AND p0 p1)), (OR p2 p1), p1, p2]
Running random walk in product with property : Szymanski-PT-a10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s32 1)), p0:(AND (GEQ s0 1) (GEQ s30 1)), p2:(AND (GEQ s0 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Computed a total of 8 stabilizing places and 32 stable transitions
Computed a total of 8 stabilizing places and 32 stable transitions
Detected a total of 8/42 stabilizing places and 32/196 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 7 factoid took 216 ms. Reduced automaton from 6 states, 16 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Szymanski-PT-a10-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-a10-LTLFireability-15 finished in 965 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(G(!(p0 U X(p1))))||F(p0)))||X(p2)))'
[2022-06-11 18:04:55] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12165300241403680478
[2022-06-11 18:04:55] [INFO ] Computing symmetric may disable matrix : 212 transitions.
[2022-06-11 18:04:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 18:04:55] [INFO ] Applying decomposition
[2022-06-11 18:04:55] [INFO ] Computing symmetric may enable matrix : 212 transitions.
[2022-06-11 18:04:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 18:04:55] [INFO ] Flatten gal took : 11 ms
[2022-06-11 18:04:55] [INFO ] Computing Do-Not-Accords matrix : 212 transitions.
[2022-06-11 18:04:55] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 18:04:55] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12165300241403680478
Running compilation step : cd /tmp/ltsmin12165300241403680478;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1964679351037565206.txt' '-o' '/tmp/graph1964679351037565206.bin' '-w' '/tmp/graph1964679351037565206.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1964679351037565206.bin' '-l' '-1' '-v' '-w' '/tmp/graph1964679351037565206.weights' '-q' '0' '-e' '0.001'
[2022-06-11 18:04:55] [INFO ] Decomposing Gal with order
[2022-06-11 18:04:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 18:04:55] [INFO ] Removed a total of 363 redundant transitions.
[2022-06-11 18:04:55] [INFO ] Flatten gal took : 20 ms
[2022-06-11 18:04:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 4 ms.
[2022-06-11 18:04:55] [INFO ] Time to serialize gal into /tmp/LTLFireability13198844071079750077.gal : 2 ms
[2022-06-11 18:04:55] [INFO ] Time to serialize properties into /tmp/LTLFireability7910207365786717839.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13198844071079750077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7910207365786717839.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((F((F(G(!(("((u4.s2>=1)&&(u4.l15>=1))")U(X("((i7.u10.s1>=1)&&(u5.l17>=1))"))))))||(F("((u4.s2>=1)&&(u4.l15>=1))"))))||(X("((u5.s3>=...175
Formula 0 simplified : !(F(FG!("((u4.s2>=1)&&(u4.l15>=1))" U X"((i7.u10.s1>=1)&&(u5.l17>=1))") | F"((u4.s2>=1)&&(u4.l15>=1))") | X"((u5.s3>=1)&&(u0.l0>=1))...157
Compilation finished in 408 ms.
Running link step : cd /tmp/ltsmin12165300241403680478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12165300241403680478;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((<>([](!((LTLAPp0==true) U X((LTLAPp1==true)))))||<>((LTLAPp0==true))))||X((LTLAPp2==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t19, t20, t42, t43, t53, t54, t70, t71, t80, t102, t103, t145, t153, t154, t155, t156...299
Computing Next relation with stutter on 3.81798e+13 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: LTL layer: formula: (<>((<>([](!((LTLAPp0==true) U X((LTLAPp1==true)))))||<>((LTLAPp0==true))))||X((LTLAPp2==true)))
pins2lts-mc-linux64( 1/ 8), 0.002: "(<>((<>([](!((LTLAPp0==true) U X((LTLAPp1==true)))))||<>((LTLAPp0==true))))||X((LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: There are 216 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.027: State length is 47, there are 218 groups
pins2lts-mc-linux64( 0/ 8), 0.027: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.027: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.027: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.027: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.057: [Blue] ~120 levels ~960 states ~3520 transitions
pins2lts-mc-linux64( 5/ 8), 0.076: [Blue] ~240 levels ~1920 states ~8032 transitions
pins2lts-mc-linux64( 5/ 8), 0.109: [Blue] ~471 levels ~3840 states ~17976 transitions
pins2lts-mc-linux64( 1/ 8), 0.236: [Blue] ~829 levels ~7680 states ~39464 transitions
pins2lts-mc-linux64( 1/ 8), 0.442: [Blue] ~1686 levels ~15360 states ~86008 transitions
pins2lts-mc-linux64( 0/ 8), 0.739: [Blue] ~3387 levels ~30720 states ~205504 transitions
pins2lts-mc-linux64( 6/ 8), 1.061: [Blue] ~6732 levels ~61440 states ~372960 transitions
pins2lts-mc-linux64( 6/ 8), 1.576: [Blue] ~13285 levels ~122880 states ~760864 transitions
pins2lts-mc-linux64( 6/ 8), 2.392: [Blue] ~26227 levels ~245760 states ~1577376 transitions
pins2lts-mc-linux64( 0/ 8), 4.206: [Blue] ~49425 levels ~491520 states ~3173976 transitions
pins2lts-mc-linux64( 0/ 8), 7.243: [Blue] ~97599 levels ~983040 states ~6575472 transitions
pins2lts-mc-linux64( 0/ 8), 11.333: [Blue] ~189482 levels ~1966080 states ~13437328 transitions
pins2lts-mc-linux64( 1/ 8), 19.695: [Blue] ~387184 levels ~3932160 states ~29178640 transitions
pins2lts-mc-linux64( 1/ 8), 37.522: [Blue] ~747743 levels ~7864320 states ~58864448 transitions
pins2lts-mc-linux64( 0/ 8), 78.921: [Blue] ~1256134 levels ~15728640 states ~102165456 transitions
pins2lts-mc-linux64( 0/ 8), 188.971: [Blue] ~2081471 levels ~31457280 states ~225557056 transitions
pins2lts-mc-linux64( 1/ 8), 336.635: [Blue] ~2075116 levels ~62914560 states ~417438160 transitions
pins2lts-mc-linux64( 2/ 8), 462.031: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 462.071:
pins2lts-mc-linux64( 0/ 8), 462.071: Explored 75176910 states 689068706 transitions, fanout: 9.166
pins2lts-mc-linux64( 0/ 8), 462.072: Total exploration time 462.030 sec (461.980 sec minimum, 462.004 sec on average)
pins2lts-mc-linux64( 0/ 8), 462.072: States per second: 162710, Transitions per second: 1491394
pins2lts-mc-linux64( 0/ 8), 462.072:
pins2lts-mc-linux64( 0/ 8), 462.072: State space has 32390469 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 462.072: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 462.072: blue states: 75176910 (232.10%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 462.072: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 462.072: all-red states: 12372622 (38.20%), bogus 10 (0.00%)
pins2lts-mc-linux64( 0/ 8), 462.072:
pins2lts-mc-linux64( 0/ 8), 462.072: Total memory used for local state coloring: 501.8MB
pins2lts-mc-linux64( 0/ 8), 462.072:
pins2lts-mc-linux64( 0/ 8), 462.072: Queue width: 8B, total height: 32884103, memory: 250.89MB
pins2lts-mc-linux64( 0/ 8), 462.072: Tree memory: 503.1MB, 16.3 B/state, compr.: 8.6%
pins2lts-mc-linux64( 0/ 8), 462.072: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 462.072: Stored 213 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 462.072: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 462.072: Est. total memory use: 754.0MB (~1274.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12165300241403680478;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((<>([](!((LTLAPp0==true) U X((LTLAPp1==true)))))||<>((LTLAPp0==true))))||X((LTLAPp2==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12165300241403680478;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((<>([](!((LTLAPp0==true) U X((LTLAPp1==true)))))||<>((LTLAPp0==true))))||X((LTLAPp2==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-11 18:25:26] [INFO ] Flatten gal took : 13 ms
[2022-06-11 18:25:26] [INFO ] Time to serialize gal into /tmp/LTLFireability7640880756599280949.gal : 7 ms
[2022-06-11 18:25:26] [INFO ] Time to serialize properties into /tmp/LTLFireability13996077507159696077.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7640880756599280949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13996077507159696077.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !(((F((F(G(!(("((s2>=1)&&(l15>=1))")U(X("((s1>=1)&&(l17>=1))"))))))||(F("((s2>=1)&&(l15>=1))"))))||(X("((s3>=1)&&(l0>=1))"))))
Formula 0 simplified : !(F(FG!("((s2>=1)&&(l15>=1))" U X"((s1>=1)&&(l17>=1))") | F"((s2>=1)&&(l15>=1))") | X"((s3>=1)&&(l0>=1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t19, t20, t42, t43, t53, t54, t70, t71, t79, t102, t103, t145, t153, t154, t155, t156...299
Computing Next relation with stutter on 3.81798e+13 deadlock states
102 unique states visited
0 strongly connected components in search stack
103 transitions explored
52 items max in DFS search stack
6759 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,67.62,1076872,1,0,1168,5.94763e+06,461,951,3234,6.72937e+06,1981
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Szymanski-PT-a10-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 1401960 ms.

BK_STOP 1654972004156

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="Szymanski-PT-a10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Szymanski-PT-a10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472283101020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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