Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 26 15:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 15:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678238136846

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 01:15:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 01:15:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:15:38] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-08 01:15:38] [INFO ] Transformed 553 places.
[2023-03-08 01:15:38] [INFO ] Transformed 150 transitions.
[2023-03-08 01:15:38] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 29 place count 91 transition count 125
Iterating global reduction 1 with 11 rules applied. Total rules applied 40 place count 91 transition count 125
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 86 transition count 120
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 86 transition count 120
Applied a total of 50 rules in 20 ms. Remains 86 /109 variables (removed 23) and now considering 120/150 (removed 30) transitions.
// Phase 1: matrix 120 rows 86 cols
[2023-03-08 01:15:38] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-08 01:15:38] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-08 01:15:38] [INFO ] Invariant cache hit.
[2023-03-08 01:15:38] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-08 01:15:39] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2023-03-08 01:15:39] [INFO ] Invariant cache hit.
[2023-03-08 01:15:39] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/109 places, 120/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 474 ms. Remains : 86/109 places, 120/150 transitions.
Support contains 29 out of 86 places after structural reductions.
[2023-03-08 01:15:39] [INFO ] Flatten gal took : 28 ms
[2023-03-08 01:15:39] [INFO ] Flatten gal took : 11 ms
[2023-03-08 01:15:39] [INFO ] Input system was already deterministic with 120 transitions.
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 25) seen :10
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 116 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-08 01:15:40] [INFO ] Invariant cache hit.
[2023-03-08 01:15:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:15:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:15:40] [INFO ] After 323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-08 01:15:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:15:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:15:40] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-08 01:15:40] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-08 01:15:41] [INFO ] After 218ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-08 01:15:41] [INFO ] After 508ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 196 ms.
[2023-03-08 01:15:41] [INFO ] After 1115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 2 properties in 144 ms.
Support contains 17 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 82 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 82 transition count 112
Applied a total of 8 rules in 17 ms. Remains 82 /86 variables (removed 4) and now considering 112/120 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 82/86 places, 112/120 transitions.
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 1018 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 987 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 515 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 1017 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Finished probabilistic random walk after 3850 steps, run visited all 13 properties in 27 ms. (steps per millisecond=142 )
Probabilistic random walk after 3850 steps, saw 1806 distinct states, run finished after 27 ms. (steps per millisecond=142 ) properties seen :13
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 288 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((F(p1)&&F(p2)))&&p0))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 74 transition count 96
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 74 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 74 transition count 95
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 70 transition count 89
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 70 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 68 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 68 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 67 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 67 transition count 82
Applied a total of 42 rules in 11 ms. Remains 67 /86 variables (removed 19) and now considering 82/120 (removed 38) transitions.
// Phase 1: matrix 82 rows 67 cols
[2023-03-08 01:15:43] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:15:43] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 01:15:43] [INFO ] Invariant cache hit.
[2023-03-08 01:15:43] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-08 01:15:43] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-08 01:15:43] [INFO ] Invariant cache hit.
[2023-03-08 01:15:43] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/86 places, 82/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 67/86 places, 82/120 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s65 1)), p2:(AND (GEQ s1 1) (GEQ s59 1)), p0:(AND (GEQ s1 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-00 finished in 682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1)&&!(G((G(p1)||X(p2))) U (p0 U p3))))'
Support contains 7 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 91
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 73 transition count 90
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 67 transition count 82
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 67 transition count 80
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 64 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 63 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 63 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 72
Applied a total of 52 rules in 19 ms. Remains 63 /86 variables (removed 23) and now considering 72/120 (removed 48) transitions.
// Phase 1: matrix 72 rows 63 cols
[2023-03-08 01:15:43] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 01:15:43] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 01:15:43] [INFO ] Invariant cache hit.
[2023-03-08 01:15:43] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:15:43] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-08 01:15:43] [INFO ] Invariant cache hit.
[2023-03-08 01:15:43] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/86 places, 72/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 63/86 places, 72/120 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR p3 p1), true, p1, p3, (AND p2 p3), p2, (AND p1 p3), p1]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p3), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND p3 p2), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=4 dest: 6}, { cond=(AND p1 p3 p2), acceptance={} source=4 dest: 7}], [{ cond=p2, acceptance={0} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={0} source=5 dest: 7}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p1 p3), acceptance={} source=6 dest: 7}], [{ cond=p1, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s18 1) (GEQ s24 1)), p3:(AND (GEQ s14 1) (GEQ s41 1)), p0:(AND (GEQ s0 1) (GEQ s24 1)), p2:(AND (GEQ s1 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 204 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p3)), (X (NOT (AND p1 p3 p2))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p3 p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND p1 p2)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p3) p0 (NOT p2))
Knowledge based reduction with 22 factoid took 742 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-01 finished in 1779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(F(!(p0 U (p0 U p1)))&&X(p2))))'
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 72 transition count 92
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 72 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 72 transition count 91
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 67 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 65 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 64 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 64 transition count 75
Applied a total of 50 rules in 12 ms. Remains 64 /86 variables (removed 22) and now considering 75/120 (removed 45) transitions.
// Phase 1: matrix 75 rows 64 cols
[2023-03-08 01:15:45] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:15:45] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 01:15:45] [INFO ] Invariant cache hit.
[2023-03-08 01:15:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:15:45] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-08 01:15:45] [INFO ] Invariant cache hit.
[2023-03-08 01:15:45] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/86 places, 75/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 64/86 places, 75/120 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), true, p1]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s62 1)), p1:(AND (GEQ s7 1) (GEQ s45 1)), p2:(AND (GEQ s1 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-02 finished in 449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 71 transition count 89
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 71 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 71 transition count 88
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 66 transition count 83
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 64 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 63 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 62 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 61 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 61 transition count 71
Applied a total of 56 rules in 10 ms. Remains 61 /86 variables (removed 25) and now considering 71/120 (removed 49) transitions.
// Phase 1: matrix 71 rows 61 cols
[2023-03-08 01:15:45] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:15:45] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 01:15:45] [INFO ] Invariant cache hit.
[2023-03-08 01:15:45] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:15:46] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-08 01:15:46] [INFO ] Invariant cache hit.
[2023-03-08 01:15:46] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/86 places, 71/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 61/86 places, 71/120 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s59 1)), p0:(AND (GEQ s1 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 111 ms.
Product exploration explored 100000 steps with 33333 reset in 103 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-03 finished in 732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(G((F(p2)||p1))&&X(p3)))))))'
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 93
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 73 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 68 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 65 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 63 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 62 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 62 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 61 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 61 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 61 transition count 72
Applied a total of 55 rules in 7 ms. Remains 61 /86 variables (removed 25) and now considering 72/120 (removed 48) transitions.
// Phase 1: matrix 72 rows 61 cols
[2023-03-08 01:15:46] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:15:46] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:15:46] [INFO ] Invariant cache hit.
[2023-03-08 01:15:46] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:15:46] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-08 01:15:46] [INFO ] Invariant cache hit.
[2023-03-08 01:15:46] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/86 places, 72/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 61/86 places, 72/120 transitions.
Stuttering acceptance computed with spot in 509 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=1 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={1} source=5 dest: 4}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 0}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p1:(OR (LT s1 1) (LT s38 1)), p2:(OR (LT s1 1) (LT s55 1)), p0:(OR (LT s1 1) (LT s38 1)), p3:(OR (LT s17 1) (LT s23 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25451 reset in 133 ms.
Product exploration explored 100000 steps with 25446 reset in 134 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p2 p0 p3), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 8 states, 27 edges and 4 AP (stutter sensitive) to 8 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 516 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 514 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 526 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 533 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 466 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-08 01:15:48] [INFO ] Invariant cache hit.
[2023-03-08 01:15:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:15:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:15:49] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:4
[2023-03-08 01:15:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 01:15:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:15:49] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :3
[2023-03-08 01:15:49] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:15:49] [INFO ] After 25ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :8 sat :3
[2023-03-08 01:15:49] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 01:15:49] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :3
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 72/72 transitions.
Graph (complete) has 181 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 59 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 59 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 59 transition count 69
Applied a total of 5 rules in 16 ms. Remains 59 /61 variables (removed 2) and now considering 69/72 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 59/61 places, 69/72 transitions.
Incomplete random walk after 10000 steps, including 2329 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 521 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 524 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Finished probabilistic random walk after 4284 steps, run visited all 3 properties in 32 ms. (steps per millisecond=133 )
Probabilistic random walk after 4284 steps, saw 1941 distinct states, run finished after 32 ms. (steps per millisecond=133 ) properties seen :3
Found 8 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0 p3), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p3)))), (G (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p3))), (F (AND (NOT p1) (NOT p2))), (F (NOT p3)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 694 ms. Reduced automaton from 8 states, 26 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 01:15:50] [INFO ] Invariant cache hit.
[2023-03-08 01:15:50] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 01:15:50] [INFO ] Invariant cache hit.
[2023-03-08 01:15:50] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:15:50] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-08 01:15:50] [INFO ] Invariant cache hit.
[2023-03-08 01:15:50] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 61/61 places, 72/72 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p2 p3), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR (NOT p0) p2 p3)), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (NOT p0) p2 p3)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 345 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 3165542 steps, run timeout after 3001 ms. (steps per millisecond=1054 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 3165542 steps, saw 1215445 distinct states, run finished after 3003 ms. (steps per millisecond=1054 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-08 01:15:54] [INFO ] Invariant cache hit.
[2023-03-08 01:15:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 01:15:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:15:54] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p3), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR (NOT p0) p2 p3)), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (NOT p0) p2 p3))), (G (OR (NOT p0) p2 p3))]
False Knowledge obtained : [(F (AND p0 (NOT p2) p3)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 301 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 22911 reset in 74 ms.
Product exploration explored 100000 steps with 22822 reset in 117 ms.
Built C files in :
/tmp/ltsmin8748426749959645423
[2023-03-08 01:15:55] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2023-03-08 01:15:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:15:55] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2023-03-08 01:15:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:15:55] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2023-03-08 01:15:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:15:55] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8748426749959645423
Running compilation step : cd /tmp/ltsmin8748426749959645423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 267 ms.
Running link step : cd /tmp/ltsmin8748426749959645423;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8748426749959645423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15567659468903047658.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 72/72 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 60 transition count 70
Applied a total of 3 rules in 12 ms. Remains 60 /61 variables (removed 1) and now considering 70/72 (removed 2) transitions.
// Phase 1: matrix 70 rows 60 cols
[2023-03-08 01:16:10] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:16:10] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 01:16:10] [INFO ] Invariant cache hit.
[2023-03-08 01:16:10] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:16:10] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-08 01:16:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:16:10] [INFO ] Invariant cache hit.
[2023-03-08 01:16:10] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/61 places, 70/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 60/61 places, 70/72 transitions.
Built C files in :
/tmp/ltsmin11804404861435515759
[2023-03-08 01:16:10] [INFO ] Computing symmetric may disable matrix : 70 transitions.
[2023-03-08 01:16:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:16:10] [INFO ] Computing symmetric may enable matrix : 70 transitions.
[2023-03-08 01:16:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:16:10] [INFO ] Computing Do-Not-Accords matrix : 70 transitions.
[2023-03-08 01:16:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:16:10] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11804404861435515759
Running compilation step : cd /tmp/ltsmin11804404861435515759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 169 ms.
Running link step : cd /tmp/ltsmin11804404861435515759;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11804404861435515759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4952605762213630084.hoa' '--buchi-type=spotba'
LTSmin run took 14780 ms.
WARNING : LTS min runner thread failed on error :java.io.UncheckedIOException: java.nio.channels.ClosedByInterruptException
java.io.UncheckedIOException: java.nio.channels.ClosedByInterruptException
at java.base/java.nio.file.FileChannelLinesSpliterator.readLine(FileChannelLinesSpliterator.java:192)
at java.base/java.nio.file.FileChannelLinesSpliterator.tryAdvance(FileChannelLinesSpliterator.java:120)
at java.base/java.util.stream.ReferencePipeline.forEachWithCancel(ReferencePipeline.java:129)
at java.base/java.util.stream.AbstractPipeline.copyIntoWithCancel(AbstractPipeline.java:527)
at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:513)
at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499)
at java.base/java.util.stream.MatchOps$MatchOp.evaluateSequential(MatchOps.java:230)
at java.base/java.util.stream.MatchOps$MatchOp.evaluateSequential(MatchOps.java:196)
at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234)
at java.base/java.util.stream.ReferencePipeline.anyMatch(ReferencePipeline.java:632)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:248)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:833)
Caused by: java.nio.channels.ClosedByInterruptException
at java.base/java.nio.channels.spi.AbstractInterruptibleChannel.end(AbstractInterruptibleChannel.java:199)
at java.base/sun.nio.ch.FileChannelImpl.endBlocking(FileChannelImpl.java:171)
at java.base/sun.nio.ch.FileChannelImpl.readInternal(FileChannelImpl.java:844)
at java.base/sun.nio.ch.FileChannelImpl.read(FileChannelImpl.java:824)
at java.base/java.nio.file.FileChannelLinesSpliterator$1.read(FileChannelLinesSpliterator.java:156)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:261)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at java.base/java.nio.file.FileChannelLinesSpliterator.readLine(FileChannelLinesSpliterator.java:190)
... 12 more
[2023-03-08 01:16:25] [INFO ] Flatten gal took : 6 ms
[2023-03-08 01:16:25] [INFO ] Flatten gal took : 5 ms
[2023-03-08 01:16:25] [INFO ] Time to serialize gal into /tmp/LTL2658848522393864961.gal : 2 ms
[2023-03-08 01:16:25] [INFO ] Time to serialize properties into /tmp/LTL5589412524667641111.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2658848522393864961.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16096629470552975582.hoa' '-atoms' '/tmp/LTL5589412524667641111.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5589412524667641111.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16096629470552975582.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t29, t54, t55, t56, t68, t89, t91, t92, t93, t94, t95, t96, t97, t98, t9...316
Computing Next relation with stutter on 2.07745e+06 deadlock states
10 unique states visited
0 strongly connected components in search stack
17 transitions explored
9 items max in DFS search stack
486 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,4.88392,134984,1,0,179,498869,180,91,2194,566153,306
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-04 finished in 44539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 71 transition count 89
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 71 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 71 transition count 88
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 65 transition count 80
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 65 transition count 78
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 62 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 60 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 64 place count 58 transition count 64
Applied a total of 64 rules in 16 ms. Remains 58 /86 variables (removed 28) and now considering 64/120 (removed 56) transitions.
// Phase 1: matrix 64 rows 58 cols
[2023-03-08 01:16:31] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:16:31] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 01:16:31] [INFO ] Invariant cache hit.
[2023-03-08 01:16:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:16:31] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-08 01:16:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:16:31] [INFO ] Invariant cache hit.
[2023-03-08 01:16:31] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/86 places, 64/120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 58/86 places, 64/120 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22868 reset in 111 ms.
Product exploration explored 100000 steps with 22988 reset in 125 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 186 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 790 steps, including 190 resets, run visited all 1 properties in 7 ms. (steps per millisecond=112 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 58 /58 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-08 01:16:32] [INFO ] Invariant cache hit.
[2023-03-08 01:16:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 01:16:32] [INFO ] Invariant cache hit.
[2023-03-08 01:16:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:16:32] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-08 01:16:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:16:32] [INFO ] Invariant cache hit.
[2023-03-08 01:16:32] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 58/58 places, 64/64 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 186 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 222 steps, including 53 resets, run visited all 1 properties in 2 ms. (steps per millisecond=111 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23010 reset in 82 ms.
Product exploration explored 100000 steps with 22918 reset in 190 ms.
Built C files in :
/tmp/ltsmin5252567521676340977
[2023-03-08 01:16:32] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2023-03-08 01:16:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:16:32] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2023-03-08 01:16:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:16:32] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2023-03-08 01:16:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:16:32] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5252567521676340977
Running compilation step : cd /tmp/ltsmin5252567521676340977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 161 ms.
Running link step : cd /tmp/ltsmin5252567521676340977;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin5252567521676340977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15280115435766880886.hoa' '--buchi-type=spotba'
LTSmin run took 73 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-05 finished in 2015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 71 transition count 89
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 71 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 71 transition count 88
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 65 transition count 80
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 65 transition count 78
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 62 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 60 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 64 place count 58 transition count 64
Applied a total of 64 rules in 5 ms. Remains 58 /86 variables (removed 28) and now considering 64/120 (removed 56) transitions.
[2023-03-08 01:16:33] [INFO ] Invariant cache hit.
[2023-03-08 01:16:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 01:16:33] [INFO ] Invariant cache hit.
[2023-03-08 01:16:33] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:16:33] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-08 01:16:33] [INFO ] Invariant cache hit.
[2023-03-08 01:16:33] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/86 places, 64/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 58/86 places, 64/120 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 154 steps with 35 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-06 finished in 280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 72 transition count 90
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 72 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 72 transition count 89
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 66 transition count 81
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 66 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 66 transition count 80
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 63 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 63 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 61 transition count 72
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 56 place count 60 transition count 69
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 58 place count 59 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 59 place count 59 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 61 place count 59 transition count 66
Applied a total of 61 rules in 17 ms. Remains 59 /86 variables (removed 27) and now considering 66/120 (removed 54) transitions.
// Phase 1: matrix 66 rows 59 cols
[2023-03-08 01:16:33] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:16:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 01:16:33] [INFO ] Invariant cache hit.
[2023-03-08 01:16:33] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:16:33] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-08 01:16:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:16:33] [INFO ] Invariant cache hit.
[2023-03-08 01:16:33] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/86 places, 66/120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 59/86 places, 66/120 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s22 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 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-10 finished in 213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0) U p1))))'
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 97
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 73 transition count 96
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 68 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 65 transition count 83
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 65 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 65 transition count 82
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 63 transition count 79
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 62 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 55 place count 61 transition count 75
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 58 place count 61 transition count 73
Applied a total of 58 rules in 13 ms. Remains 61 /86 variables (removed 25) and now considering 73/120 (removed 47) transitions.
// Phase 1: matrix 73 rows 61 cols
[2023-03-08 01:16:33] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:16:33] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 01:16:33] [INFO ] Invariant cache hit.
[2023-03-08 01:16:33] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-08 01:16:33] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-08 01:16:33] [INFO ] Invariant cache hit.
[2023-03-08 01:16:33] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/86 places, 73/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 61/86 places, 73/120 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s58 1)), p0:(AND (GEQ s1 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-11 finished in 274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&X(!p0)&&G(p2))))'
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 94
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 73 transition count 92
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 69 transition count 86
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 69 transition count 86
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 67 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 65 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 65 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 65 transition count 79
Applied a total of 46 rules in 2 ms. Remains 65 /86 variables (removed 21) and now considering 79/120 (removed 41) transitions.
// Phase 1: matrix 79 rows 65 cols
[2023-03-08 01:16:33] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:16:33] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:16:34] [INFO ] Invariant cache hit.
[2023-03-08 01:16:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-08 01:16:34] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-08 01:16:34] [INFO ] Invariant cache hit.
[2023-03-08 01:16:34] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/86 places, 79/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 65/86 places, 79/120 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), p0, (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=0 dest: 2}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s24 1)), p0:(AND (GEQ s1 1) (GEQ s58 1)), p2:(AND (GEQ s1 1) (GEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-12 finished in 377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(((G(p2)&&p1) U G(p3)))))))'
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 94
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 94
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 68 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 65 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 62 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 61 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 61 transition count 71
Applied a total of 57 rules in 5 ms. Remains 61 /86 variables (removed 25) and now considering 71/120 (removed 49) transitions.
// Phase 1: matrix 71 rows 61 cols
[2023-03-08 01:16:34] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:16:34] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 01:16:34] [INFO ] Invariant cache hit.
[2023-03-08 01:16:34] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-08 01:16:34] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-08 01:16:34] [INFO ] Invariant cache hit.
[2023-03-08 01:16:34] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/86 places, 71/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 61/86 places, 71/120 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p3), (NOT p2), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))), acceptance={} source=4 dest: 3}, { cond=(AND p3 p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p1 p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=4 dest: 5}, { cond=(OR (AND p3 (NOT p1)) (AND p3 (NOT p2))), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 3}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s59 1)), p3:(AND (GEQ s1 1) (GEQ s58 1)), p1:(AND (GEQ s1 1) (GEQ s58 1)), p2:(AND (GEQ s1 1) (GEQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-13 finished in 436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X((p0||X(F(p1))))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 95
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 73 transition count 94
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 68 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 68 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 66 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 66 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 65 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 64 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 63 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 77
Applied a total of 52 rules in 6 ms. Remains 63 /86 variables (removed 23) and now considering 77/120 (removed 43) transitions.
// Phase 1: matrix 77 rows 63 cols
[2023-03-08 01:16:34] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:16:34] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 01:16:34] [INFO ] Invariant cache hit.
[2023-03-08 01:16:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-08 01:16:34] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-08 01:16:34] [INFO ] Invariant cache hit.
[2023-03-08 01:16:34] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/86 places, 77/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 63/86 places, 77/120 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), false, false, (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s44 1)), p1:(OR (LT s19 1) (LT s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 136 ms.
Product exploration explored 100000 steps with 33333 reset in 144 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 126 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-14 finished in 776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(!p1)))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 93
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 73 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 68 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 65 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 65 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 65 transition count 77
Applied a total of 47 rules in 8 ms. Remains 65 /86 variables (removed 21) and now considering 77/120 (removed 43) transitions.
// Phase 1: matrix 77 rows 65 cols
[2023-03-08 01:16:35] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:16:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:16:35] [INFO ] Invariant cache hit.
[2023-03-08 01:16:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:16:35] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-08 01:16:35] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:16:35] [INFO ] Invariant cache hit.
[2023-03-08 01:16:35] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/86 places, 77/120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 65/86 places, 77/120 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) p1), p1, p1, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s63 1)), p0:(OR (LT s18 1) (LT s24 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][true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-15 finished in 341 ms.
All properties solved by simple procedures.
Total runtime 57558 ms.

BK_STOP 1678238197078

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d0m08, 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 r101-tall-167814475100212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m08.tgz
mv DBSingleClientW-PT-d0m08 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 ;