Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.0K Jun 7 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 7 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 7 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 7 17:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jun 7 17:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Jun 7 17:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.1M Jun 6 12:11 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654958984608

Running Version 202205111006
[2022-06-11 14:49:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 14:49:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 14:49:46] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2022-06-11 14:49:46] [INFO ] Transformed 2398 places.
[2022-06-11 14:49:46] [INFO ] Transformed 1954 transitions.
[2022-06-11 14:49:46] [INFO ] Parsed PT model containing 2398 places and 1954 transitions in 305 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 1984 places in 17 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 954 place count 288 transition count 632
Iterating global reduction 1 with 101 rules applied. Total rules applied 1055 place count 288 transition count 632
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1066 place count 288 transition count 621
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 1136 place count 218 transition count 551
Iterating global reduction 2 with 70 rules applied. Total rules applied 1206 place count 218 transition count 551
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1236 place count 218 transition count 521
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1267 place count 187 transition count 484
Iterating global reduction 3 with 31 rules applied. Total rules applied 1298 place count 187 transition count 484
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 3 with 70 rules applied. Total rules applied 1368 place count 187 transition count 414
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1373 place count 182 transition count 401
Iterating global reduction 4 with 5 rules applied. Total rules applied 1378 place count 182 transition count 401
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1383 place count 177 transition count 396
Iterating global reduction 4 with 5 rules applied. Total rules applied 1388 place count 177 transition count 396
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1390 place count 175 transition count 394
Iterating global reduction 4 with 2 rules applied. Total rules applied 1392 place count 175 transition count 394
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1393 place count 174 transition count 393
Iterating global reduction 4 with 1 rules applied. Total rules applied 1394 place count 174 transition count 393
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1395 place count 173 transition count 392
Iterating global reduction 4 with 1 rules applied. Total rules applied 1396 place count 173 transition count 392
Applied a total of 1396 rules in 135 ms. Remains 173 /414 variables (removed 241) and now considering 392/1954 (removed 1562) transitions.
// Phase 1: matrix 392 rows 173 cols
[2022-06-11 14:49:46] [INFO ] Computed 5 place invariants in 21 ms
[2022-06-11 14:49:46] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 392 rows 173 cols
[2022-06-11 14:49:46] [INFO ] Computed 5 place invariants in 11 ms
[2022-06-11 14:49:46] [INFO ] State equation strengthened by 260 read => feed constraints.
[2022-06-11 14:49:47] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
// Phase 1: matrix 392 rows 173 cols
[2022-06-11 14:49:47] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-11 14:49:47] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 173/414 places, 392/1954 transitions.
Finished structural reductions, in 1 iterations. Remains : 173/414 places, 392/1954 transitions.
Support contains 24 out of 173 places after structural reductions.
[2022-06-11 14:49:47] [INFO ] Flatten gal took : 57 ms
[2022-06-11 14:49:47] [INFO ] Flatten gal took : 26 ms
[2022-06-11 14:49:47] [INFO ] Input system was already deterministic with 392 transitions.
Incomplete random walk after 10000 steps, including 2257 resets, run finished after 769 ms. (steps per millisecond=13 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 108 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 308110 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{0=1, 1=1, 2=1, 4=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 15=1, 16=1, 17=1, 18=1}
Probabilistic random walk after 308110 steps, saw 124366 distinct states, run finished after 3003 ms. (steps per millisecond=102 ) properties seen :16
Running SMT prover for 5 properties.
// Phase 1: matrix 392 rows 173 cols
[2022-06-11 14:49:51] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 14:49:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 14:49:51] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 14:49:52] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-11 14:49:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 14:49:52] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2022-06-11 14:49:52] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-11 14:49:52] [INFO ] State equation strengthened by 260 read => feed constraints.
[2022-06-11 14:49:52] [INFO ] After 300ms SMT Verify possible using 260 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-11 14:49:53] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 4 ms to minimize.
[2022-06-11 14:49:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-06-11 14:49:53] [INFO ] After 970ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 580 ms.
[2022-06-11 14:49:54] [INFO ] After 1948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 69 ms.
Support contains 7 out of 173 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 173/173 places, 392/392 transitions.
Graph (complete) has 665 edges and 173 vertex of which 172 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 172 transition count 390
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 17 place count 158 transition count 220
Iterating global reduction 1 with 14 rules applied. Total rules applied 31 place count 158 transition count 220
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 144 transition count 206
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 144 transition count 206
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 67 place count 144 transition count 198
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 135 transition count 181
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 135 transition count 181
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 91 place count 135 transition count 175
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 132 transition count 171
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 132 transition count 171
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 129 transition count 168
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 129 transition count 168
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 127 transition count 166
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 127 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 127 transition count 164
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 111 place count 125 transition count 162
Iterating global reduction 4 with 2 rules applied. Total rules applied 113 place count 125 transition count 162
Applied a total of 113 rules in 49 ms. Remains 125 /173 variables (removed 48) and now considering 162/392 (removed 230) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/173 places, 162/392 transitions.
Incomplete random walk after 10000 steps, including 2218 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 510 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 504 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 463 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Probably explored full state space saw : 119383 states, properties seen :1
Probabilistic random walk after 300786 steps, saw 119383 distinct states, run finished after 2129 ms. (steps per millisecond=141 ) properties seen :1
Explored full state space saw : 119383 states, properties seen :0
Exhaustive walk after 300786 steps, saw 119383 distinct states, run finished after 2129 ms. (steps per millisecond=141 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 48 stabilizing places and 64 stable transitions
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(p2)&&p1)||p0))))'
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 392/392 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 157 transition count 236
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 157 transition count 236
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 141 transition count 220
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 141 transition count 220
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 71 place count 141 transition count 213
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 81 place count 131 transition count 197
Iterating global reduction 1 with 10 rules applied. Total rules applied 91 place count 131 transition count 197
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 98 place count 131 transition count 190
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 101 place count 128 transition count 187
Iterating global reduction 2 with 3 rules applied. Total rules applied 104 place count 128 transition count 187
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 125 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 125 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 124 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 124 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 123 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 123 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 122 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 122 transition count 179
Applied a total of 116 rules in 43 ms. Remains 122 /173 variables (removed 51) and now considering 179/392 (removed 213) transitions.
// Phase 1: matrix 179 rows 122 cols
[2022-06-11 14:49:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:49:59] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 179 rows 122 cols
[2022-06-11 14:49:59] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 14:49:59] [INFO ] State equation strengthened by 92 read => feed constraints.
[2022-06-11 14:49:59] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2022-06-11 14:49:59] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 179 rows 122 cols
[2022-06-11 14:49:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:49:59] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/173 places, 179/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/173 places, 179/392 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s115 1)), p2:(OR (LT s1 1) (LT s116 1)), p1:(AND (OR (LT s1 1) (LT s70 1)) (OR (LT s1 1) (LT s117 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22396 reset in 335 ms.
Product exploration explored 100000 steps with 22473 reset in 234 ms.
Computed a total of 29 stabilizing places and 32 stable transitions
Computed a total of 29 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (NOT (AND p2 p1 (NOT p0)))), (X (OR (AND p2 p1) (AND p2 p0))), (X (NOT (OR (NOT p2) (AND (NOT p1) (NOT p0))))), (X p0), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (OR (AND p2 p1) (AND p2 p0)))), (X (X (NOT (OR (NOT p2) (AND (NOT p1) (NOT p0)))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 343 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2281 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 452 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Probably explored full state space saw : 132867 states, properties seen :4
Probabilistic random walk after 342657 steps, saw 132867 distinct states, run finished after 1080 ms. (steps per millisecond=317 ) properties seen :4
Explored full state space saw : 132867 states, properties seen :0
Exhaustive walk after 342657 steps, saw 132867 distinct states, run finished after 469 ms. (steps per millisecond=730 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (NOT (AND p2 p1 (NOT p0)))), (X (OR (AND p2 p1) (AND p2 p0))), (X (NOT (OR (NOT p2) (AND (NOT p1) (NOT p0))))), (X p0), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (OR (AND p2 p1) (AND p2 p0)))), (X (X (NOT (OR (NOT p2) (AND (NOT p1) (NOT p0)))))), (X (X p0)), (G (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR (AND p1 p2) (AND p2 p0)))), (F (OR (AND (NOT p1) (NOT p0)) (NOT p2))), (F (NOT p0)), (F (AND p1 p2 (NOT p0)))]
Knowledge based reduction with 12 factoid took 794 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 122 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 179/179 transitions.
Applied a total of 0 rules in 21 ms. Remains 122 /122 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 122 cols
[2022-06-11 14:50:04] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-11 14:50:04] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 179 rows 122 cols
[2022-06-11 14:50:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:50:04] [INFO ] State equation strengthened by 92 read => feed constraints.
[2022-06-11 14:50:04] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2022-06-11 14:50:04] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 179 rows 122 cols
[2022-06-11 14:50:04] [INFO ] Computed 5 place invariants in 16 ms
[2022-06-11 14:50:04] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 179/179 transitions.
Computed a total of 29 stabilizing places and 32 stable transitions
Computed a total of 29 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p0 p2), (X p2), (X p0), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2211 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Finished probabilistic random walk after 81119 steps, run visited all 2 properties in 292 ms. (steps per millisecond=277 )
Probabilistic random walk after 81119 steps, saw 34405 distinct states, run finished after 292 ms. (steps per millisecond=277 ) properties seen :2
Knowledge obtained : [(AND p0 p2), (X p2), (X p0), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 22509 reset in 150 ms.
Product exploration explored 100000 steps with 22481 reset in 189 ms.
Built C files in :
/tmp/ltsmin11114185550868375717
[2022-06-11 14:50:06] [INFO ] Computing symmetric may disable matrix : 179 transitions.
[2022-06-11 14:50:06] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 14:50:06] [INFO ] Computing symmetric may enable matrix : 179 transitions.
[2022-06-11 14:50:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 14:50:06] [INFO ] Computing Do-Not-Accords matrix : 179 transitions.
[2022-06-11 14:50:06] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 14:50:06] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11114185550868375717
Running compilation step : cd /tmp/ltsmin11114185550868375717;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 453 ms.
Running link step : cd /tmp/ltsmin11114185550868375717;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11114185550868375717;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2437922266632033569.hoa' '--buchi-type=spotba'
LTSmin run took 1076 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-00 finished in 8646 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)&&F(X(p1))&&p1))))'
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 392/392 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 155 transition count 222
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 155 transition count 222
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 137 transition count 204
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 137 transition count 204
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 81 place count 137 transition count 195
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 94 place count 124 transition count 174
Iterating global reduction 1 with 13 rules applied. Total rules applied 107 place count 124 transition count 174
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 116 place count 124 transition count 165
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 121 place count 119 transition count 159
Iterating global reduction 2 with 5 rules applied. Total rules applied 126 place count 119 transition count 159
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 131 place count 114 transition count 154
Iterating global reduction 2 with 5 rules applied. Total rules applied 136 place count 114 transition count 154
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 139 place count 111 transition count 149
Iterating global reduction 2 with 3 rules applied. Total rules applied 142 place count 111 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 145 place count 111 transition count 146
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 108 transition count 143
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 108 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 152 place count 107 transition count 142
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 107 transition count 142
Applied a total of 153 rules in 18 ms. Remains 107 /173 variables (removed 66) and now considering 142/392 (removed 250) transitions.
// Phase 1: matrix 142 rows 107 cols
[2022-06-11 14:50:08] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 14:50:08] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 142 rows 107 cols
[2022-06-11 14:50:08] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:50:08] [INFO ] State equation strengthened by 69 read => feed constraints.
[2022-06-11 14:50:08] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
// Phase 1: matrix 142 rows 107 cols
[2022-06-11 14:50:08] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-11 14:50:08] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/173 places, 142/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/173 places, 142/392 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s102 1)), p1:(OR (LT s1 1) (LT s101 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][false, false, false]]
Product exploration explored 100000 steps with 22458 reset in 140 ms.
Product exploration explored 100000 steps with 22481 reset in 141 ms.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 281 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Finished probabilistic random walk after 14383 steps, run visited all 2 properties in 86 ms. (steps per millisecond=167 )
Probabilistic random walk after 14383 steps, saw 7120 distinct states, run finished after 87 ms. (steps per millisecond=165 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 230 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 142/142 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 107 cols
[2022-06-11 14:50:09] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 14:50:09] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 142 rows 107 cols
[2022-06-11 14:50:09] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-11 14:50:09] [INFO ] State equation strengthened by 69 read => feed constraints.
[2022-06-11 14:50:10] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
// Phase 1: matrix 142 rows 107 cols
[2022-06-11 14:50:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:50:10] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 142/142 transitions.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 249 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2225 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Finished probabilistic random walk after 14383 steps, run visited all 2 properties in 65 ms. (steps per millisecond=221 )
Probabilistic random walk after 14383 steps, saw 7120 distinct states, run finished after 65 ms. (steps per millisecond=221 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 278 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 89 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 83 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 22369 reset in 132 ms.
Product exploration explored 100000 steps with 22394 reset in 139 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 83 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 142/142 transitions.
Applied a total of 0 rules in 10 ms. Remains 107 /107 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2022-06-11 14:50:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 142 rows 107 cols
[2022-06-11 14:50:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:50:11] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 142/142 transitions.
Product exploration explored 100000 steps with 22401 reset in 275 ms.
Product exploration explored 100000 steps with 22372 reset in 260 ms.
Built C files in :
/tmp/ltsmin7528304636611203889
[2022-06-11 14:50:12] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7528304636611203889
Running compilation step : cd /tmp/ltsmin7528304636611203889;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 249 ms.
Running link step : cd /tmp/ltsmin7528304636611203889;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7528304636611203889;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9054843067185496438.hoa' '--buchi-type=spotba'
LTSmin run took 498 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-04 finished in 5165 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U (F(p1)||p0)))))'
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 392/392 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 155 transition count 222
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 155 transition count 222
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 137 transition count 204
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 137 transition count 204
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 80 place count 137 transition count 196
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 92 place count 125 transition count 177
Iterating global reduction 1 with 12 rules applied. Total rules applied 104 place count 125 transition count 177
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 112 place count 125 transition count 169
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 116 place count 121 transition count 164
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 121 transition count 164
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 124 place count 117 transition count 160
Iterating global reduction 2 with 4 rules applied. Total rules applied 128 place count 117 transition count 160
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 131 place count 114 transition count 155
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 114 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 137 place count 114 transition count 152
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 140 place count 111 transition count 149
Iterating global reduction 3 with 3 rules applied. Total rules applied 143 place count 111 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 144 place count 110 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 110 transition count 148
Applied a total of 145 rules in 25 ms. Remains 110 /173 variables (removed 63) and now considering 148/392 (removed 244) transitions.
// Phase 1: matrix 148 rows 110 cols
[2022-06-11 14:50:13] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 14:50:13] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 148 rows 110 cols
[2022-06-11 14:50:13] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 14:50:13] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-11 14:50:13] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 110 cols
[2022-06-11 14:50:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:50:13] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/173 places, 148/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/173 places, 148/392 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s105 1)), p1:(AND (GEQ s1 1) (GEQ s104 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-05 finished in 601 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(X(G(p0)))))))'
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 392/392 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 154 transition count 209
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 154 transition count 209
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 135 transition count 190
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 135 transition count 190
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 85 place count 135 transition count 181
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 98 place count 122 transition count 160
Iterating global reduction 1 with 13 rules applied. Total rules applied 111 place count 122 transition count 160
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 120 place count 122 transition count 151
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 125 place count 117 transition count 145
Iterating global reduction 2 with 5 rules applied. Total rules applied 130 place count 117 transition count 145
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 135 place count 112 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 140 place count 112 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 143 place count 109 transition count 135
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 109 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 148 place count 109 transition count 133
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 151 place count 106 transition count 130
Iterating global reduction 3 with 3 rules applied. Total rules applied 154 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 105 transition count 129
Applied a total of 156 rules in 13 ms. Remains 105 /173 variables (removed 68) and now considering 129/392 (removed 263) transitions.
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 14:50:13] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 14:50:13] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 14:50:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:50:13] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 14:50:14] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 14:50:14] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 14:50:14] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/173 places, 129/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/173 places, 129/392 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-08 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}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (GEQ s1 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-08 finished in 506 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 392/392 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 196
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 196
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 133 transition count 176
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 133 transition count 176
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 90 place count 133 transition count 166
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 104 place count 119 transition count 143
Iterating global reduction 1 with 14 rules applied. Total rules applied 118 place count 119 transition count 143
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 128 place count 119 transition count 133
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 134 place count 113 transition count 126
Iterating global reduction 2 with 6 rules applied. Total rules applied 140 place count 113 transition count 126
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 146 place count 107 transition count 120
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 107 transition count 120
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 156 place count 103 transition count 114
Iterating global reduction 2 with 4 rules applied. Total rules applied 160 place count 103 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 103 transition count 112
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 166 place count 99 transition count 108
Iterating global reduction 3 with 4 rules applied. Total rules applied 170 place count 99 transition count 108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 98 transition count 107
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 98 transition count 107
Applied a total of 172 rules in 20 ms. Remains 98 /173 variables (removed 75) and now considering 107/392 (removed 285) transitions.
// Phase 1: matrix 107 rows 98 cols
[2022-06-11 14:50:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:50:14] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 107 rows 98 cols
[2022-06-11 14:50:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:50:14] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-11 14:50:14] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 98 cols
[2022-06-11 14:50:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:50:14] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/173 places, 107/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/173 places, 107/392 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s49 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][false, false, false, false]]
Product exploration explored 100000 steps with 28561 reset in 128 ms.
Product exploration explored 100000 steps with 28606 reset in 145 ms.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 180 steps, run visited all 1 properties in 4 ms. (steps per millisecond=45 )
Probabilistic random walk after 180 steps, saw 119 distinct states, run finished after 4 ms. (steps per millisecond=45 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 107/107 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 98 cols
[2022-06-11 14:50:15] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 14:50:15] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 107 rows 98 cols
[2022-06-11 14:50:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:50:15] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-11 14:50:15] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 98 cols
[2022-06-11 14:50:15] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 14:50:15] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 107/107 transitions.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 180 steps, run visited all 1 properties in 5 ms. (steps per millisecond=36 )
Probabilistic random walk after 180 steps, saw 119 distinct states, run finished after 5 ms. (steps per millisecond=36 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 28578 reset in 109 ms.
Product exploration explored 100000 steps with 28599 reset in 107 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 107/107 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2022-06-11 14:50:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 107 rows 98 cols
[2022-06-11 14:50:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 14:50:17] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 107/107 transitions.
Product exploration explored 100000 steps with 28569 reset in 168 ms.
Product exploration explored 100000 steps with 28598 reset in 211 ms.
Built C files in :
/tmp/ltsmin11140529220962220201
[2022-06-11 14:50:17] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11140529220962220201
Running compilation step : cd /tmp/ltsmin11140529220962220201;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 194 ms.
Running link step : cd /tmp/ltsmin11140529220962220201;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11140529220962220201;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17635039041733277985.hoa' '--buchi-type=spotba'
LTSmin run took 153 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-09 finished in 3688 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||F((G(X(X(p1)))&&p2))))'
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 392/392 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 156 transition count 223
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 156 transition count 223
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 139 transition count 206
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 139 transition count 206
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 75 place count 139 transition count 199
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 87 place count 127 transition count 180
Iterating global reduction 1 with 12 rules applied. Total rules applied 99 place count 127 transition count 180
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 107 place count 127 transition count 172
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 123 transition count 167
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 123 transition count 167
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 119 place count 119 transition count 163
Iterating global reduction 2 with 4 rules applied. Total rules applied 123 place count 119 transition count 163
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 117 transition count 159
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 115 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 114 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 114 transition count 156
Applied a total of 133 rules in 11 ms. Remains 114 /173 variables (removed 59) and now considering 156/392 (removed 236) transitions.
// Phase 1: matrix 156 rows 114 cols
[2022-06-11 14:50:18] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 14:50:18] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 156 rows 114 cols
[2022-06-11 14:50:18] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 14:50:18] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-06-11 14:50:18] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 114 cols
[2022-06-11 14:50:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:50:18] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/173 places, 156/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/173 places, 156/392 transitions.
Stuttering acceptance computed with spot in 902 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p2 p0), acceptance={} source=2 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 5}, { cond=p2, acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=6 dest: 6}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 7}, { cond=(AND p2 p0 p1), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND p2 p1), acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND p2 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(OR (LT s1 1) (LT s59 1) (LT s1 1) (LT s108 1)), p0:(AND (GEQ s1 1) (GEQ s109 1)), p1:(OR (LT s1 1) (LT s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22439 reset in 149 ms.
Product exploration explored 100000 steps with 22442 reset in 150 ms.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 787 ms. Reduced automaton from 9 states, 34 edges and 3 AP to 6 states, 14 edges and 2 AP.
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2186 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 444 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Probably explored full state space saw : 144523 states, properties seen :4
Probabilistic random walk after 370666 steps, saw 144523 distinct states, run finished after 1430 ms. (steps per millisecond=259 ) properties seen :4
Explored full state space saw : 144523 states, properties seen :0
Exhaustive walk after 370666 steps, saw 144523 distinct states, run finished after 430 ms. (steps per millisecond=862 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (NOT p2)), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 924 ms. Reduced automaton from 6 states, 14 edges and 2 AP to 6 states, 14 edges and 2 AP.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p2) p1)]
Support contains 3 out of 114 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 156/156 transitions.
Applied a total of 0 rules in 12 ms. Remains 114 /114 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 114 cols
[2022-06-11 14:50:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:50:24] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 156 rows 114 cols
[2022-06-11 14:50:24] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:50:24] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-06-11 14:50:24] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2022-06-11 14:50:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 156 rows 114 cols
[2022-06-11 14:50:24] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:50:24] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 156/156 transitions.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p2 p1), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X p2), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 242 ms. Reduced automaton from 6 states, 14 edges and 2 AP to 6 states, 14 edges and 2 AP.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 467 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Finished probabilistic random walk after 300538 steps, run visited all 4 properties in 488 ms. (steps per millisecond=615 )
Probabilistic random walk after 300538 steps, saw 117927 distinct states, run finished after 488 ms. (steps per millisecond=615 ) properties seen :4
Knowledge obtained : [(AND p2 p1), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X p2), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (AND p1 p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 7 factoid took 409 ms. Reduced automaton from 6 states, 14 edges and 2 AP to 6 states, 14 edges and 2 AP.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 22499 reset in 159 ms.
Product exploration explored 100000 steps with 22525 reset in 136 ms.
Built C files in :
/tmp/ltsmin10462341657011457391
[2022-06-11 14:50:27] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2022-06-11 14:50:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 14:50:27] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2022-06-11 14:50:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 14:50:27] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2022-06-11 14:50:27] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 14:50:27] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10462341657011457391
Running compilation step : cd /tmp/ltsmin10462341657011457391;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 311 ms.
Running link step : cd /tmp/ltsmin10462341657011457391;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10462341657011457391;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15299973170393748919.hoa' '--buchi-type=spotba'
LTSmin run took 376 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-13 finished in 10273 ms.
All properties solved by simple procedures.
Total runtime 42526 ms.

BK_STOP 1654959028427

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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