Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 10:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K Mar 5 18:23 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-d0m64-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679313954444

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m64
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:05:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 12:05:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:05:56] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-20 12:05:56] [INFO ] Transformed 262 places.
[2023-03-20 12:05:56] [INFO ] Transformed 73 transitions.
[2023-03-20 12:05:56] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 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-d0m64-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-12 TRUE 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 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 66 transition count 69
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 66 transition count 69
Applied a total of 10 rules in 15 ms. Remains 66 /72 variables (removed 6) and now considering 69/73 (removed 4) transitions.
// Phase 1: matrix 69 rows 66 cols
[2023-03-20 12:05:56] [INFO ] Computed 5 place invariants in 10 ms
[2023-03-20 12:05:56] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-20 12:05:56] [INFO ] Invariant cache hit.
[2023-03-20 12:05:56] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-20 12:05:56] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-20 12:05:56] [INFO ] Invariant cache hit.
[2023-03-20 12:05:57] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/72 places, 69/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 66/72 places, 69/73 transitions.
Support contains 32 out of 66 places after structural reductions.
[2023-03-20 12:05:57] [INFO ] Flatten gal took : 21 ms
[2023-03-20 12:05:57] [INFO ] Flatten gal took : 9 ms
[2023-03-20 12:05:57] [INFO ] Input system was already deterministic with 69 transitions.
Support contains 31 out of 66 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2255 resets, run finished after 560 ms. (steps per millisecond=17 ) properties (out of 28) seen :6
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 111 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 109 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 115 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 103 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 111 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 106 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-20 12:05:58] [INFO ] Invariant cache hit.
[2023-03-20 12:05:58] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 12:05:58] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-20 12:05:58] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-20 12:05:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 28 ms returned sat
[2023-03-20 12:05:58] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:05:58] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-20 12:05:58] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-20 12:05:58] [INFO ] After 120ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-20 12:05:59] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 127 ms.
[2023-03-20 12:05:59] [INFO ] After 904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 4 properties in 225 ms.
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 63 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 61 transition count 63
Applied a total of 11 rules in 25 ms. Remains 61 /66 variables (removed 5) and now considering 63/69 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 61/66 places, 63/69 transitions.
Incomplete random walk after 10000 steps, including 2205 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 515 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1038 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 490 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1082 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1028 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 995 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 437 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1055 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :0
Finished probabilistic random walk after 1609 steps, run visited all 12 properties in 24 ms. (steps per millisecond=67 )
Probabilistic random walk after 1609 steps, saw 842 distinct states, run finished after 37 ms. (steps per millisecond=43 ) properties seen :12
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 204 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U (X((p1 U G(p2))) U p3)))'
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 59 transition count 61
Applied a total of 15 rules in 8 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:06:01] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:06:01] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-20 12:06:01] [INFO ] Invariant cache hit.
[2023-03-20 12:06:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:01] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-20 12:06:01] [INFO ] Invariant cache hit.
[2023-03-20 12:06:01] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 411 ms :[(NOT p3), (OR (NOT p3) (NOT p2)), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p2) p3)), true, (NOT p2), (NOT p2), p0, (AND p0 (NOT p2)), (AND (NOT p2) p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p3 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p3 p0 p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 3}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p0 p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND p0 p2), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s56 1)), p0:(AND (GEQ s1 1) (GEQ s47 1)), p2:(AND (GEQ s1 1) (GEQ s54 1)), p1:(AND (GEQ s1 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 3 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-01 finished in 750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&((G(p1) U p0)||G(p2)))))'
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 62 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 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 13 place count 60 transition count 62
Applied a total of 13 rules in 13 ms. Remains 60 /66 variables (removed 6) and now considering 62/69 (removed 7) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-20 12:06:01] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:06:01] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-20 12:06:01] [INFO ] Invariant cache hit.
[2023-03-20 12:06:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:01] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-20 12:06:01] [INFO ] Invariant cache hit.
[2023-03-20 12:06:01] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/66 places, 62/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 257 ms. Remains : 60/66 places, 62/69 transitions.
Stuttering acceptance computed with spot in 302 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 4}, { cond=(NOT p2), acceptance={0} source=1 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 5}, { cond=(NOT p1), acceptance={0} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 5}, { cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 7}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 7}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={} source=8 dest: 0}]], initial=8, aps=[p0:(AND (GEQ s1 1) (GEQ s21 1)), p1:(AND (GEQ s10 1) (GEQ s19 1)), p2:(AND (GEQ s1 1) (GEQ s57 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-02 finished in 581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 62 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 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 13 place count 60 transition count 62
Applied a total of 13 rules in 6 ms. Remains 60 /66 variables (removed 6) and now considering 62/69 (removed 7) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-20 12:06:02] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:06:02] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-20 12:06:02] [INFO ] Invariant cache hit.
[2023-03-20 12:06:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:02] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-20 12:06:02] [INFO ] Invariant cache hit.
[2023-03-20 12:06:02] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/66 places, 62/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 60/66 places, 62/69 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-03 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 s13 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]]
Product exploration explored 100000 steps with 22372 reset in 181 ms.
Product exploration explored 100000 steps with 22267 reset in 227 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2218 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 990 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1405 steps, run visited all 1 properties in 8 ms. (steps per millisecond=175 )
Probabilistic random walk after 1405 steps, saw 710 distinct states, run finished after 8 ms. (steps per millisecond=175 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 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 1 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-20 12:06:03] [INFO ] Invariant cache hit.
[2023-03-20 12:06:03] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-20 12:06:03] [INFO ] Invariant cache hit.
[2023-03-20 12:06:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:03] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-20 12:06:03] [INFO ] Invariant cache hit.
[2023-03-20 12:06:03] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2190 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1000 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1405 steps, run visited all 1 properties in 6 ms. (steps per millisecond=234 )
Probabilistic random walk after 1405 steps, saw 710 distinct states, run finished after 7 ms. (steps per millisecond=200 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22492 reset in 133 ms.
Product exploration explored 100000 steps with 22444 reset in 112 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 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.
[2023-03-20 12:06:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:06:05] [INFO ] Invariant cache hit.
[2023-03-20 12:06:05] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 60/60 places, 62/62 transitions.
Support contains 2 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.
[2023-03-20 12:06:05] [INFO ] Invariant cache hit.
[2023-03-20 12:06:05] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-20 12:06:05] [INFO ] Invariant cache hit.
[2023-03-20 12:06:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:05] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-20 12:06:05] [INFO ] Invariant cache hit.
[2023-03-20 12:06:05] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 60/60 places, 62/62 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-03 finished in 3152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p1))||p0))))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 59 transition count 61
Applied a total of 15 rules in 3 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:06:05] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:06:05] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-20 12:06:05] [INFO ] Invariant cache hit.
[2023-03-20 12:06:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:05] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-20 12:06:05] [INFO ] Invariant cache hit.
[2023-03-20 12:06:05] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s41 1)), p0:(OR (LT s1 1) (LT s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22315 reset in 194 ms.
Product exploration explored 100000 steps with 22400 reset in 121 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2208 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Finished Best-First random walk after 9525 steps, including 478 resets, run visited all 2 properties in 33 ms. (steps per millisecond=288 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 260 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:06:07] [INFO ] Invariant cache hit.
[2023-03-20 12:06:07] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-20 12:06:07] [INFO ] Invariant cache hit.
[2023-03-20 12:06:07] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:07] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-20 12:06:07] [INFO ] Invariant cache hit.
[2023-03-20 12:06:07] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2251 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Finished Best-First random walk after 948 steps, including 36 resets, run visited all 2 properties in 2 ms. (steps per millisecond=474 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22280 reset in 82 ms.
Product exploration explored 100000 steps with 22436 reset in 88 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:06:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:06:08] [INFO ] Invariant cache hit.
[2023-03-20 12:06:08] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 59/59 places, 61/61 transitions.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 0 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:06:08] [INFO ] Invariant cache hit.
[2023-03-20 12:06:08] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-20 12:06:08] [INFO ] Invariant cache hit.
[2023-03-20 12:06:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:08] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-20 12:06:08] [INFO ] Invariant cache hit.
[2023-03-20 12:06:08] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-04 finished in 3169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0) U p1))))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 59 transition count 61
Applied a total of 15 rules in 3 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
[2023-03-20 12:06:08] [INFO ] Invariant cache hit.
[2023-03-20 12:06:08] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-20 12:06:08] [INFO ] Invariant cache hit.
[2023-03-20 12:06:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:08] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-20 12:06:08] [INFO ] Invariant cache hit.
[2023-03-20 12:06:08] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s38 1)), p0:(OR (NOT (AND (GEQ s1 1) (GEQ s54 1))) (AND (GEQ s1 1) (GEQ s38 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 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-05 finished in 472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 59 transition count 61
Applied a total of 15 rules in 4 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
[2023-03-20 12:06:09] [INFO ] Invariant cache hit.
[2023-03-20 12:06:09] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-20 12:06:09] [INFO ] Invariant cache hit.
[2023-03-20 12:06:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:09] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-20 12:06:09] [INFO ] Invariant cache hit.
[2023-03-20 12:06:09] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s46 1)), p1:(AND (GEQ s1 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-06 finished in 250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(G(p1))||p0))&&F(p2)))'
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 63 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 66
Applied a total of 6 rules in 2 ms. Remains 63 /66 variables (removed 3) and now considering 66/69 (removed 3) transitions.
// Phase 1: matrix 66 rows 63 cols
[2023-03-20 12:06:09] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 12:06:09] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-20 12:06:09] [INFO ] Invariant cache hit.
[2023-03-20 12:06:09] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-20 12:06:09] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-20 12:06:09] [INFO ] Invariant cache hit.
[2023-03-20 12:06:09] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/66 places, 66/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 63/66 places, 66/69 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s17 1) (GEQ s20 1)), p0:(OR (LT s1 1) (LT s40 1)), p1:(OR (LT s4 1) (LT s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-07 finished in 302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0)) U (F(p1)&&G(p0)))||X(p1)))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 62 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 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 13 place count 60 transition count 62
Applied a total of 13 rules in 3 ms. Remains 60 /66 variables (removed 6) and now considering 62/69 (removed 7) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-20 12:06:09] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-20 12:06:09] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-20 12:06:09] [INFO ] Invariant cache hit.
[2023-03-20 12:06:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:09] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-20 12:06:09] [INFO ] Invariant cache hit.
[2023-03-20 12:06:09] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/66 places, 62/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 60/66 places, 62/69 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0), acceptance={0} source=5 dest: 0}, { cond=(NOT p0), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s35 1)), p1:(AND (GEQ s11 1) (GEQ 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-08 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 59 transition count 61
Applied a total of 15 rules in 7 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:06:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:06:10] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-20 12:06:10] [INFO ] Invariant cache hit.
[2023-03-20 12:06:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:10] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-20 12:06:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:06:10] [INFO ] Invariant cache hit.
[2023-03-20 12:06:10] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 174 ms. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-10 finished in 222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))||p0)))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 59 transition count 61
Applied a total of 15 rules in 2 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
[2023-03-20 12:06:10] [INFO ] Invariant cache hit.
[2023-03-20 12:06:10] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-20 12:06:10] [INFO ] Invariant cache hit.
[2023-03-20 12:06:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:10] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-20 12:06:10] [INFO ] Invariant cache hit.
[2023-03-20 12:06:10] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s48 1)), p1:(AND (GEQ s1 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-11 finished in 678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U X(p1)))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 59 transition count 61
Applied a total of 15 rules in 3 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
[2023-03-20 12:06:10] [INFO ] Invariant cache hit.
[2023-03-20 12:06:10] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-20 12:06:10] [INFO ] Invariant cache hit.
[2023-03-20 12:06:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:11] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-20 12:06:11] [INFO ] Invariant cache hit.
[2023-03-20 12:06:11] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 59/66 places, 61/69 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (GEQ s5 1) (GEQ s27 1)), p0:(AND (GEQ s1 1) (GEQ s51 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-14 finished in 345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 62 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 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 13 place count 60 transition count 62
Applied a total of 13 rules in 2 ms. Remains 60 /66 variables (removed 6) and now considering 62/69 (removed 7) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-20 12:06:11] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-20 12:06:11] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-20 12:06:11] [INFO ] Invariant cache hit.
[2023-03-20 12:06:11] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:06:11] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-20 12:06:11] [INFO ] Invariant cache hit.
[2023-03-20 12:06:11] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/66 places, 62/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 60/66 places, 62/69 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s4 1) (LT s18 1)) (OR (LT s1 1) (LT 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 45 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-15 finished in 554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-03
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 62 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 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 13 place count 60 transition count 62
Applied a total of 13 rules in 5 ms. Remains 60 /66 variables (removed 6) and now considering 62/69 (removed 7) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-20 12:06:11] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 12:06:11] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-20 12:06:11] [INFO ] Invariant cache hit.
[2023-03-20 12:06:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:12] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-20 12:06:12] [INFO ] Invariant cache hit.
[2023-03-20 12:06:12] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 60/66 places, 62/69 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 153 ms. Remains : 60/66 places, 62/69 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-03 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 s13 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22298 reset in 76 ms.
Product exploration explored 100000 steps with 22430 reset in 84 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2200 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1010 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1405 steps, run visited all 1 properties in 6 ms. (steps per millisecond=234 )
Probabilistic random walk after 1405 steps, saw 710 distinct states, run finished after 6 ms. (steps per millisecond=234 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 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 1 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-20 12:06:12] [INFO ] Invariant cache hit.
[2023-03-20 12:06:12] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-20 12:06:12] [INFO ] Invariant cache hit.
[2023-03-20 12:06:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:12] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-20 12:06:12] [INFO ] Invariant cache hit.
[2023-03-20 12:06:12] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2212 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 991 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1405 steps, run visited all 1 properties in 6 ms. (steps per millisecond=234 )
Probabilistic random walk after 1405 steps, saw 710 distinct states, run finished after 6 ms. (steps per millisecond=234 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22365 reset in 72 ms.
Product exploration explored 100000 steps with 22331 reset in 85 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 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 3 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-20 12:06:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:06:13] [INFO ] Invariant cache hit.
[2023-03-20 12:06:13] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42 ms. Remains : 60/60 places, 62/62 transitions.
Support contains 2 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 0 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-20 12:06:13] [INFO ] Invariant cache hit.
[2023-03-20 12:06:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-20 12:06:13] [INFO ] Invariant cache hit.
[2023-03-20 12:06:13] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:13] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-20 12:06:13] [INFO ] Invariant cache hit.
[2023-03-20 12:06:13] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 60/60 places, 62/62 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-03 finished in 1946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p1))||p0))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-04
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 66/66 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 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 15 place count 59 transition count 61
Applied a total of 15 rules in 7 ms. Remains 59 /66 variables (removed 7) and now considering 61/69 (removed 8) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:06:13] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 12:06:13] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 12:06:13] [INFO ] Invariant cache hit.
[2023-03-20 12:06:13] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:14] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-20 12:06:14] [INFO ] Invariant cache hit.
[2023-03-20 12:06:14] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 59/66 places, 61/69 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 149 ms. Remains : 59/66 places, 61/69 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s41 1)), p0:(OR (LT s1 1) (LT s41 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22267 reset in 74 ms.
Product exploration explored 100000 steps with 22379 reset in 80 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Finished Best-First random walk after 3853 steps, including 176 resets, run visited all 2 properties in 16 ms. (steps per millisecond=240 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 0 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 12:06:14] [INFO ] Invariant cache hit.
[2023-03-20 12:06:14] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-20 12:06:14] [INFO ] Invariant cache hit.
[2023-03-20 12:06:14] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:06:14] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-20 12:06:14] [INFO ] Invariant cache hit.
[2023-03-20 12:06:14] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Finished Best-First random walk after 1944 steps, including 93 resets, run visited all 2 properties in 8 ms. (steps per millisecond=243 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Entered a terminal (fully accepting) state of product in 65061 steps with 14522 reset in 63 ms.
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLFireability-04 finished in 2178 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLFireability-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-20 12:06:15] [INFO ] Flatten gal took : 6 ms
[2023-03-20 12:06:15] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 12:06:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 66 places, 69 transitions and 273 arcs took 1 ms.
Total runtime 19635 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1618/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1618/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m64-LTLFireability-03
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m64-LTLFireability-04

BK_STOP 1679313976574

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name SieveSingleMsgMbox-PT-d0m64-LTLFireability-03
ltl formula formula --ltl=/tmp/1618/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 66 places, 69 transitions and 273 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1618/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1618/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1618/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1618/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name SieveSingleMsgMbox-PT-d0m64-LTLFireability-04
ltl formula formula --ltl=/tmp/1618/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 66 places, 69 transitions and 273 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1618/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1618/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1618/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1618/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d0m64, 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 r425-tajo-167905978100388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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