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-165472282800844.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-d0m04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282800844
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.7K Jun 7 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Jun 7 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 7 17:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 6 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Jun 7 17:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Jun 7 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:31 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 57K 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-d0m04-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654944619730

Running Version 202205111006
[2022-06-11 10:50:20] [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 10:50:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 10:50:21] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2022-06-11 10:50:21] [INFO ] Transformed 262 places.
[2022-06-11 10:50:21] [INFO ] Transformed 73 transitions.
[2022-06-11 10:50:21] [INFO ] Parsed PT model containing 262 places and 73 transitions in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 69 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 69 transition count 72
Applied a total of 4 rules in 15 ms. Remains 69 /72 variables (removed 3) and now considering 72/73 (removed 1) transitions.
// Phase 1: matrix 72 rows 69 cols
[2022-06-11 10:50:21] [INFO ] Computed 5 place invariants in 12 ms
[2022-06-11 10:50:21] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 72 rows 69 cols
[2022-06-11 10:50:21] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-11 10:50:21] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-11 10:50:21] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 69 cols
[2022-06-11 10:50:21] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:50:21] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/72 places, 72/73 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/72 places, 72/73 transitions.
Support contains 32 out of 69 places after structural reductions.
[2022-06-11 10:50:21] [INFO ] Flatten gal took : 38 ms
[2022-06-11 10:50:21] [INFO ] Flatten gal took : 9 ms
[2022-06-11 10:50:21] [INFO ] Input system was already deterministic with 72 transitions.
Incomplete random walk after 10000 steps, including 2251 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 27) seen :6
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 125 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 109 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 155 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 109 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 72 rows 69 cols
[2022-06-11 10:50:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:50:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:50:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 10:50:22] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:17
[2022-06-11 10:50:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 10:50:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 10:50:23] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :11
[2022-06-11 10:50:23] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-11 10:50:23] [INFO ] After 97ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :7 sat :11
[2022-06-11 10:50:23] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :11
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-06-11 10:50:23] [INFO ] After 611ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :11
Fused 18 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 16 out of 69 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 66
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 66
Applied a total of 12 rules in 17 ms. Remains 63 /69 variables (removed 6) and now considering 66/72 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/69 places, 66/72 transitions.
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 452 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 1060 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 1048 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 501 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 1543 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 494 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 1084 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Probably explored full state space saw : 702 states, properties seen :8
Probabilistic random walk after 1686 steps, saw 702 distinct states, run finished after 27 ms. (steps per millisecond=62 ) properties seen :8
Explored full state space saw : 702 states, properties seen :0
Exhaustive walk after 1686 steps, saw 702 distinct states, run finished after 8 ms. (steps per millisecond=210 ) properties seen :0
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 9 stable transitions
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 65
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 60 transition count 62
Applied a total of 19 rules in 17 ms. Remains 60 /69 variables (removed 9) and now considering 62/72 (removed 10) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:25] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 10:50:25] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:25] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:50:25] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 10:50:25] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2022-06-11 10:50:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:25] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 10:50:25] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/69 places, 62/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/69 places, 62/72 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-03 finished in 413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(!p1)))'
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 65
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 60 transition count 62
Applied a total of 19 rules in 9 ms. Remains 60 /69 variables (removed 9) and now considering 62/72 (removed 10) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:50:25] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:50:25] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 10:50:25] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:50:25] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/69 places, 62/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/69 places, 62/72 transitions.
Stuttering acceptance computed with spot in 144 ms :[p1, true, p1, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s44 1)), p1:(OR (AND (GEQ s2 1) (GEQ s33 1)) (AND (GEQ s1 1) (GEQ s37 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 50000 reset in 289 ms.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 8 factoid took 157 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-08 finished in 1004 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0)) U (X(p1)||F(p2))))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 65
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 60 transition count 62
Applied a total of 19 rules in 12 ms. Remains 60 /69 variables (removed 9) and now considering 62/72 (removed 10) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:50:26] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:26] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 10:50:26] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 10:50:26] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:50:26] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/69 places, 62/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/69 places, 62/72 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s23 1)), p1:(AND (GEQ s1 1) (GEQ s30 1)), p0:(AND (GEQ s1 1) (GEQ s46 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-09 finished in 380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 59 transition count 61
Applied a total of 21 rules in 12 ms. Remains 59 /69 variables (removed 10) and now considering 61/72 (removed 11) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:50:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:50:26] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:50:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:50:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:50:26] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:50:26] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:50:27] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/69 places, 61/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/69 places, 61/72 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 658 steps with 154 reset in 5 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-10 finished in 305 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((true U false))))'
Support contains 0 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 59 transition count 61
Applied a total of 21 rules in 15 ms. Remains 59 /69 variables (removed 10) and now considering 61/72 (removed 11) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:50:27] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 10:50:27] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:50:27] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:50:27] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:50:27] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2022-06-11 10:50:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 10:50:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:50:27] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/69 places, 61/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/69 places, 61/72 transitions.
Stuttering acceptance computed with spot in 15 ms :[true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-12 finished in 230 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 65
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 60 transition count 62
Applied a total of 19 rules in 15 ms. Remains 60 /69 variables (removed 9) and now considering 62/72 (removed 10) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:50:27] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:50:27] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:50:27] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:27] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:50:27] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/69 places, 62/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/69 places, 62/72 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s9 1) (LT s19 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]]
Entered a terminal (fully accepting) state of product in 834 steps with 187 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-13 finished in 278 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G((G(p0)&&p1))||F(p2))))))'
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 65
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 60 transition count 62
Applied a total of 19 rules in 5 ms. Remains 60 /69 variables (removed 9) and now considering 62/72 (removed 10) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:50:27] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:50:27] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:50:27] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:50:27] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/69 places, 62/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/69 places, 62/72 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p2:(AND (GEQ s12 1) (GEQ s34 1)), p0:(OR (LT s1 1) (LT s45 1)), p1:(OR (LT s10 1) (LT s19 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 22226 reset in 167 ms.
Product exploration explored 100000 steps with 22425 reset in 131 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Finished Best-First random walk after 1178 steps, including 109 resets, run visited all 3 properties in 7 ms. (steps per millisecond=168 )
Knowledge obtained : [(AND (NOT p2) p0 p1), true]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) p0 p1))), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:29] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 10:50:29] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:29] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 10:50:29] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 10:50:29] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 10:50:29] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 5765 steps, including 1272 resets, run visited all 3 properties in 104 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND (NOT p2) p0 p1), true]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) p0 p1))), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 299 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 230 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 22329 reset in 129 ms.
Product exploration explored 100000 steps with 22363 reset in 142 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 200 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2022-06-11 10:50:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 10:50:31] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-11 10:50:31] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 62/62 transitions.
Product exploration explored 100000 steps with 22356 reset in 178 ms.
Product exploration explored 100000 steps with 22369 reset in 173 ms.
Built C files in :
/tmp/ltsmin4432475250244208457
[2022-06-11 10:50:32] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4432475250244208457
Running compilation step : cd /tmp/ltsmin4432475250244208457;'/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 243 ms.
Running link step : cd /tmp/ltsmin4432475250244208457;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4432475250244208457;'/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/stateBased14743558491376408851.hoa' '--buchi-type=spotba'
LTSmin run took 208 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-14 finished in 4900 ms.
All properties solved by simple procedures.
Total runtime 11633 ms.

BK_STOP 1654944632608

--------------------
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-d0m04"
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-d0m04, 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-165472282800844"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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