Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 7 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 13K Jun 7 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Jun 7 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 7 17:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 57K Jun 6 12:11 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654949503714

Running Version 202205111006
[2022-06-11 12:11:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 12:11:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 12:11:45] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2022-06-11 12:11:45] [INFO ] Transformed 262 places.
[2022-06-11 12:11:45] [INFO ] Transformed 73 transitions.
[2022-06-11 12:11:45] [INFO ] Parsed PT model containing 262 places and 73 transitions in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 69 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 69 transition count 72
Applied a total of 4 rules in 15 ms. Remains 69 /72 variables (removed 3) and now considering 72/73 (removed 1) transitions.
// Phase 1: matrix 72 rows 69 cols
[2022-06-11 12:11:45] [INFO ] Computed 5 place invariants in 15 ms
[2022-06-11 12:11:45] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 72 rows 69 cols
[2022-06-11 12:11:45] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:11:45] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-11 12:11:45] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 69 cols
[2022-06-11 12:11:45] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:11:45] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/72 places, 72/73 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/72 places, 72/73 transitions.
Support contains 28 out of 69 places after structural reductions.
[2022-06-11 12:11:45] [INFO ] Flatten gal took : 27 ms
[2022-06-11 12:11:45] [INFO ] Flatten gal took : 10 ms
[2022-06-11 12:11:45] [INFO ] Input system was already deterministic with 72 transitions.
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 28) seen :5
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 114 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 112 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 150 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 108 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) 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 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 72 rows 69 cols
[2022-06-11 12:11:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:11:46] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 12:11:46] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:19
[2022-06-11 12:11:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:11:46] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:11:47] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :19
[2022-06-11 12:11:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-11 12:11:47] [INFO ] After 137ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :3 sat :19
[2022-06-11 12:11:47] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :19
Attempting to minimize the solution found.
Minimization took 151 ms.
[2022-06-11 12:11:47] [INFO ] After 766ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :19
Fused 22 Parikh solutions to 19 different solutions.
Parikh walk visited 2 properties in 545 ms.
Support contains 18 out of 69 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 68
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 68
Applied a total of 8 rules in 17 ms. Remains 65 /69 variables (removed 4) and now considering 68/72 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/69 places, 68/72 transitions.
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 117 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 63 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Finished probabilistic random walk after 1406 steps, run visited all 17 properties in 50 ms. (steps per millisecond=28 )
Probabilistic random walk after 1406 steps, saw 711 distinct states, run finished after 51 ms. (steps per millisecond=27 ) properties seen :17
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 10 stabilizing places and 10 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X((G(X(G(p2)))||F(p3)))&&p1)||p0)))'
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Applied a total of 16 rules in 4 ms. Remains 61 /69 variables (removed 8) and now considering 64/72 (removed 8) transitions.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 12:11:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:49] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 12:11:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:49] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 12:11:49] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 12:11:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:49] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/69 places, 64/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/69 places, 64/72 transitions.
Stuttering acceptance computed with spot in 313 ms :[true, (NOT p3), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(OR (LT s11 1) (LT s19 1)), p0:(OR (LT s11 1) (LT s19 1)), p1:(AND (GEQ s1 1) (GEQ s30 1)), p2:(AND (GEQ s1 1) (GEQ s34 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]]
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p3 p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p3))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 6 states, 8 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-00 finished in 1123 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||F(p1))))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 60 transition count 62
Applied a total of 19 rules in 14 ms. Remains 60 /69 variables (removed 9) and now considering 62/72 (removed 10) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:11:50] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:50] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:11:50] [INFO ] Computed 5 place invariants in 9 ms
[2022-06-11 12:11:50] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 12:11:50] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2022-06-11 12:11:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:11:50] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:50] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/69 places, 62/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/69 places, 62/72 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s23 1)), p1:(AND (GEQ s1 1) (GEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22454 reset in 240 ms.
Product exploration explored 100000 steps with 22241 reset in 184 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 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 11 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:11:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:51] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:11:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:51] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 12:11:51] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2022-06-11 12:11:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:11:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:11:51] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 62/62 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 10 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22304 reset in 126 ms.
Product exploration explored 100000 steps with 22404 reset in 102 ms.
Built C files in :
/tmp/ltsmin8509886925342466651
[2022-06-11 12:11:52] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2022-06-11 12:11:52] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:11:52] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2022-06-11 12:11:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:11:52] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2022-06-11 12:11:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:11:52] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8509886925342466651
Running compilation step : cd /tmp/ltsmin8509886925342466651;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 237 ms.
Running link step : cd /tmp/ltsmin8509886925342466651;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8509886925342466651;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9692042323909421624.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 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.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:12:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:12:07] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:12:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:12:07] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 12:12:07] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2022-06-11 12:12:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:12:07] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 12:12:07] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 62/62 transitions.
Built C files in :
/tmp/ltsmin7695415084392996638
[2022-06-11 12:12:07] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2022-06-11 12:12:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:12:07] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2022-06-11 12:12:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:12:07] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2022-06-11 12:12:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:12:07] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7695415084392996638
Running compilation step : cd /tmp/ltsmin7695415084392996638;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 141 ms.
Running link step : cd /tmp/ltsmin7695415084392996638;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7695415084392996638;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3829064708839635722.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 12:12:22] [INFO ] Flatten gal took : 5 ms
[2022-06-11 12:12:22] [INFO ] Flatten gal took : 5 ms
[2022-06-11 12:12:22] [INFO ] Time to serialize gal into /tmp/LTL9947127598687842834.gal : 2 ms
[2022-06-11 12:12:22] [INFO ] Time to serialize properties into /tmp/LTL12200092788658828158.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9947127598687842834.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12200092788658828158.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9947127...267
Read 1 LTL properties
Checking formula 0 : !((F((G("((s1<1)||(l21<1))"))||(F("((s1>=1)&&(l202>=1))")))))
Formula 0 simplified : !F(G"((s1<1)||(l21<1))" | F"((s1>=1)&&(l202>=1))")
Detected timeout of ITS tools.
[2022-06-11 12:12:37] [INFO ] Flatten gal took : 5 ms
[2022-06-11 12:12:37] [INFO ] Applying decomposition
[2022-06-11 12:12:37] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17316438165589811456.txt' '-o' '/tmp/graph17316438165589811456.bin' '-w' '/tmp/graph17316438165589811456.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17316438165589811456.bin' '-l' '-1' '-v' '-w' '/tmp/graph17316438165589811456.weights' '-q' '0' '-e' '0.001'
[2022-06-11 12:12:37] [INFO ] Decomposing Gal with order
[2022-06-11 12:12:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 12:12:38] [INFO ] Removed a total of 54 redundant transitions.
[2022-06-11 12:12:38] [INFO ] Flatten gal took : 43 ms
[2022-06-11 12:12:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 5 ms.
[2022-06-11 12:12:38] [INFO ] Time to serialize gal into /tmp/LTL15126463496442947854.gal : 14 ms
[2022-06-11 12:12:38] [INFO ] Time to serialize properties into /tmp/LTL10039598414821811852.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15126463496442947854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10039598414821811852.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1512646...247
Read 1 LTL properties
Checking formula 0 : !((F((G("((i0.u0.s1<1)||(i7.u10.l21<1))"))||(F("((i0.u0.s1>=1)&&(i0.u12.l202>=1))")))))
Formula 0 simplified : !F(G"((i0.u0.s1<1)||(i7.u10.l21<1))" | F"((i0.u0.s1>=1)&&(i0.u12.l202>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10958039020364957938
[2022-06-11 12:12:53] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10958039020364957938
Running compilation step : cd /tmp/ltsmin10958039020364957938;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 131 ms.
Running link step : cd /tmp/ltsmin10958039020364957938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10958039020364957938;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-02 finished in 78055 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(!F(p0)) U (X(p0)||p1)))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 60 transition count 62
Applied a total of 19 rules in 9 ms. Remains 60 /69 variables (removed 9) and now considering 62/72 (removed 10) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:08] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:13:08] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 12:13:08] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:08] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/69 places, 62/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/69 places, 62/72 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (OR p1 p0), (OR p1 p0), (AND (NOT p0) p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s16 1) (GEQ s19 1)), p1:(AND (GEQ s1 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22325 reset in 96 ms.
Product exploration explored 100000 steps with 22318 reset in 92 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 319 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1020 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1019 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Finished probabilistic random walk after 379 steps, run visited all 3 properties in 8 ms. (steps per millisecond=47 )
Probabilistic random walk after 379 steps, saw 220 distinct states, run finished after 8 ms. (steps per millisecond=47 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 345 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 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 4 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:10] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 12:13:10] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:10] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 212 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1053 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1038 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Finished probabilistic random walk after 379 steps, run visited all 3 properties in 7 ms. (steps per millisecond=54 )
Probabilistic random walk after 379 steps, saw 220 distinct states, run finished after 7 ms. (steps per millisecond=54 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 250 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 22506 reset in 83 ms.
Product exploration explored 100000 steps with 22292 reset in 112 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 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 4 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2022-06-11 12:13:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:12] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 62/62 transitions.
Product exploration explored 100000 steps with 22299 reset in 205 ms.
Product exploration explored 100000 steps with 22282 reset in 218 ms.
Built C files in :
/tmp/ltsmin4155240504571948372
[2022-06-11 12:13:12] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4155240504571948372
Running compilation step : cd /tmp/ltsmin4155240504571948372;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 127 ms.
Running link step : cd /tmp/ltsmin4155240504571948372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4155240504571948372;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased346835960325224698.hoa' '--buchi-type=spotba'
LTSmin run took 345 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-03 finished in 4805 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(p0)||G(p1)||p2))))'
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 60 transition count 62
Applied a total of 19 rules in 12 ms. Remains 60 /69 variables (removed 9) and now considering 62/72 (removed 10) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:13] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:13:13] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:13] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 12:13:13] [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.
[2022-06-11 12:13:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:13] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/69 places, 62/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/69 places, 62/72 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s18 1)), p1:(AND (GEQ s1 1) (GEQ s37 1)), p2:(AND (GEQ s1 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-05 finished in 329 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(X(G(!(X((p0 U F(p1))) U p2)))))))'
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Applied a total of 16 rules in 5 ms. Remains 61 /69 variables (removed 8) and now considering 64/72 (removed 8) transitions.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 12:13:13] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:13:13] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 12:13:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:13] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 12:13:13] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 12:13:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:13] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/69 places, 64/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/69 places, 64/72 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), p2, (AND p2 p1), (AND p2 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0, 1} source=3 dest: 3}, { cond=p2, acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={2} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0, 2} source=3 dest: 4}], [{ cond=(AND p2 p1), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={2} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0, 2} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={1, 2} source=4 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p2 p1), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={2} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0, 2} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={1, 2} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s31 1)), p2:(AND (GEQ s1 1) (GEQ s50 1)), p1:(AND (GEQ s7 1) (GEQ s19 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 3 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-06 finished in 427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 59 transition count 61
Applied a total of 21 rules in 6 ms. Remains 59 /69 variables (removed 10) and now considering 61/72 (removed 11) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:13:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:13] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:13:13] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 12:13:13] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 12:13:13] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2022-06-11 12:13:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:13:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:13] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/69 places, 61/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/69 places, 61/72 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-07 finished in 210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0)) U p1))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 59 transition count 61
Applied a total of 21 rules in 5 ms. Remains 59 /69 variables (removed 10) and now considering 61/72 (removed 11) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:13:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:14] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:13:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:14] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 12:13:14] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:13:14] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-11 12:13:14] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/69 places, 61/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/69 places, 61/72 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s50 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, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-08 finished in 254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 60 transition count 62
Applied a total of 19 rules in 8 ms. Remains 60 /69 variables (removed 9) and now considering 62/72 (removed 10) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:14] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:14] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-11 12:13:14] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 12:13:14] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:14] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/69 places, 62/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/69 places, 62/72 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-10 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 (GEQ s9 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][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-10 finished in 240 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(((p0 U !p0)||p1))||F(p1)))))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 59 transition count 61
Applied a total of 21 rules in 3 ms. Remains 59 /69 variables (removed 10) and now considering 61/72 (removed 11) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:13:14] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:13:14] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:13:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:14] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 12:13:14] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:13:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:14] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/69 places, 61/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/69 places, 61/72 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s56 1)), p0:(AND (GEQ s1 1) (GEQ s29 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 91 ms.
Product exploration explored 100000 steps with 33333 reset in 100 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) p0))))
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-11 finished in 541 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0)||X(p1)) U (F(X((X(p0) U p3)))&&p2))))'
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 65
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 61 transition count 63
Applied a total of 17 rules in 3 ms. Remains 61 /69 variables (removed 8) and now considering 63/72 (removed 9) transitions.
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 12:13:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:15] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 12:13:15] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:13:15] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 12:13:15] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 61 cols
[2022-06-11 12:13:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:15] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/69 places, 63/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/69 places, 63/72 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p3), true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 3}, { cond=p2, acceptance={0} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s58 1)), p0:(AND (GEQ s1 1) (GEQ s58 1)), p1:(AND (GEQ s1 1) (GEQ s50 1)), p3:(AND (GEQ s9 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, 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-d0m96-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-12 finished in 449 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 59 transition count 61
Applied a total of 21 rules in 12 ms. Remains 59 /69 variables (removed 10) and now considering 61/72 (removed 11) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:13:15] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:13:15] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:13:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 12:13:15] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2022-06-11 12:13:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:13:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:15] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/69 places, 61/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/69 places, 61/72 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-13 finished in 217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((X(X((X(p1)&&p0)))&&F((F(p2)||p3)))))))'
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 59 transition count 61
Applied a total of 21 rules in 4 ms. Remains 59 /69 variables (removed 10) and now considering 61/72 (removed 11) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:13:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:15] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:13:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 12:13:15] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 12:13:15] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 12:13:15] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/69 places, 61/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/69 places, 61/72 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s12 1) (GEQ s46 1)), p2:(AND (GEQ s1 1) (GEQ s32 1)), p0:(AND (GEQ s12 1) (GEQ s46 1)), p1:(AND (GEQ s11 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-14 finished in 304 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))||(F(p1) U !p0))))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 60 transition count 62
Applied a total of 19 rules in 9 ms. Remains 60 /69 variables (removed 9) and now considering 62/72 (removed 10) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:16] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:16] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 12:13:16] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2022-06-11 12:13:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:16] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:13:16] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/69 places, 62/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/69 places, 62/72 transitions.
Stuttering acceptance computed with spot in 89 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s58 1)), p1:(AND (GEQ s1 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 37254 reset in 130 ms.
Product exploration explored 100000 steps with 37271 reset in 141 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2196 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:13:16] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 12:13:16] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 12:13:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 12:13:16] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 12:13:16] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 12:13:16] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 12:13:16] [INFO ] After 8ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 12:13:16] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-11 12:13:16] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 62/62 transitions.
Graph (complete) has 163 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 59 transition count 60
Applied a total of 3 rules in 3 ms. Remains 59 /60 variables (removed 1) and now considering 60/62 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/60 places, 60/62 transitions.
Incomplete random walk after 10000 steps, including 2252 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 328 steps, run visited all 1 properties in 4 ms. (steps per millisecond=82 )
Probabilistic random walk after 328 steps, saw 184 distinct states, run finished after 4 ms. (steps per millisecond=82 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 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 8 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:17] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:13:17] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:17] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:13:17] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 12:13:17] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2022-06-11 12:13:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 12:13:17] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 62/62 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2201 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 513 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 12:13:17] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 12:13:17] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 12:13:17] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 12:13:17] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 12:13:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 12:13:17] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 12:13:17] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 12:13:17] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 12:13:17] [INFO ] After 7ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 12:13:17] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-11 12:13:17] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 62/62 transitions.
Graph (complete) has 163 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 59 transition count 60
Applied a total of 3 rules in 5 ms. Remains 59 /60 variables (removed 1) and now considering 60/62 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/60 places, 60/62 transitions.
Incomplete random walk after 10000 steps, including 2241 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 328 steps, run visited all 1 properties in 4 ms. (steps per millisecond=82 )
Probabilistic random walk after 328 steps, saw 184 distinct states, run finished after 4 ms. (steps per millisecond=82 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[false, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 37293 reset in 110 ms.
Product exploration explored 100000 steps with 37330 reset in 114 ms.
Built C files in :
/tmp/ltsmin3573624846722797543
[2022-06-11 12:13:18] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2022-06-11 12:13:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:13:18] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2022-06-11 12:13:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:13:18] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2022-06-11 12:13:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:13:18] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3573624846722797543
Running compilation step : cd /tmp/ltsmin3573624846722797543;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 144 ms.
Running link step : cd /tmp/ltsmin3573624846722797543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3573624846722797543;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5286572282145550843.hoa' '--buchi-type=spotba'
LTSmin run took 74 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLFireability-15 finished in 2723 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||F(p1))))'
[2022-06-11 12:13:18] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5358407123339218797
[2022-06-11 12:13:18] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2022-06-11 12:13:18] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:13:18] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2022-06-11 12:13:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:13:18] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2022-06-11 12:13:18] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 12:13:18] [INFO ] Applying decomposition
[2022-06-11 12:13:18] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5358407123339218797
Running compilation step : cd /tmp/ltsmin5358407123339218797;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 12:13:18] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17551396175459011038.txt' '-o' '/tmp/graph17551396175459011038.bin' '-w' '/tmp/graph17551396175459011038.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17551396175459011038.bin' '-l' '-1' '-v' '-w' '/tmp/graph17551396175459011038.weights' '-q' '0' '-e' '0.001'
[2022-06-11 12:13:18] [INFO ] Decomposing Gal with order
[2022-06-11 12:13:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 12:13:18] [INFO ] Removed a total of 64 redundant transitions.
[2022-06-11 12:13:18] [INFO ] Flatten gal took : 10 ms
[2022-06-11 12:13:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 3 ms.
[2022-06-11 12:13:18] [INFO ] Time to serialize gal into /tmp/LTLFireability14388073839262376577.gal : 1 ms
[2022-06-11 12:13:18] [INFO ] Time to serialize properties into /tmp/LTLFireability10782544341987253091.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14388073839262376577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10782544341987253091.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((F((G("((i0.u0.s1<1)||(i2.u3.l21<1))"))||(F("((i0.u0.s1>=1)&&(i6.u13.l202>=1))")))))
Formula 0 simplified : !F(G"((i0.u0.s1<1)||(i2.u3.l21<1))" | F"((i0.u0.s1>=1)&&(i6.u13.l202>=1))")
Compilation finished in 223 ms.
Running link step : cd /tmp/ltsmin5358407123339218797;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin5358407123339218797;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: <>(([]((LTLAPp0==true))||<>((LTLAPp1==true))))
pins2lts-mc-linux64( 1/ 8), 0.003: "<>(([]((LTLAPp0==true))||<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Initializing POR dependencies: labels 74, guards 72
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.026: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.030: There are 75 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.030: State length is 70, there are 76 groups
pins2lts-mc-linux64( 0/ 8), 0.030: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.030: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.030: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.030: Visible groups: 0 / 76, labels: 2 / 75
pins2lts-mc-linux64( 0/ 8), 0.030: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.030: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.042: [Blue] ~42 levels ~960 states ~2144 transitions
pins2lts-mc-linux64( 1/ 8), 0.051: [Blue] ~68 levels ~1920 states ~4160 transitions
pins2lts-mc-linux64( 4/ 8), 0.069: [Blue] ~99 levels ~3840 states ~9096 transitions
pins2lts-mc-linux64( 4/ 8), 0.145: [Blue] ~123 levels ~7680 states ~17272 transitions
pins2lts-mc-linux64( 6/ 8), 0.200: [Blue] ~474 levels ~15360 states ~37784 transitions
pins2lts-mc-linux64( 6/ 8), 0.503: [Blue] ~924 levels ~30720 states ~76336 transitions
pins2lts-mc-linux64( 6/ 8), 1.010: [Blue] ~1821 levels ~61440 states ~154168 transitions
pins2lts-mc-linux64( 0/ 8), 1.419: [Blue] ~2339 levels ~122880 states ~313424 transitions
pins2lts-mc-linux64( 0/ 8), 2.144: [Blue] ~2339 levels ~245760 states ~623552 transitions
pins2lts-mc-linux64( 6/ 8), 3.446: [Blue] ~2332 levels ~491520 states ~1329136 transitions
pins2lts-mc-linux64( 1/ 8), 5.445: [Blue] ~2217 levels ~983040 states ~2049440 transitions
pins2lts-mc-linux64( 1/ 8), 8.500: [Blue] ~2217 levels ~1966080 states ~4216288 transitions
pins2lts-mc-linux64( 1/ 8), 14.338: [Blue] ~2217 levels ~3932160 states ~8614808 transitions
pins2lts-mc-linux64( 1/ 8), 25.632: [Blue] ~2217 levels ~7864320 states ~17373880 transitions
pins2lts-mc-linux64( 1/ 8), 49.840: [Blue] ~2217 levels ~15728640 states ~35076368 transitions
pins2lts-mc-linux64( 1/ 8), 96.482: [Blue] ~2217 levels ~31457280 states ~70725952 transitions
pins2lts-mc-linux64( 1/ 8), 189.435: [Blue] ~2217 levels ~62914560 states ~142287576 transitions
pins2lts-mc-linux64( 1/ 8), 421.947: [Blue] ~2217 levels ~125829120 states ~284871584 transitions
pins2lts-mc-linux64( 2/ 8), 714.875: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 714.895:
pins2lts-mc-linux64( 0/ 8), 714.895: Explored 164158572 states 463046589 transitions, fanout: 2.821
pins2lts-mc-linux64( 0/ 8), 714.895: Total exploration time 714.860 sec (714.790 sec minimum, 714.817 sec on average)
pins2lts-mc-linux64( 0/ 8), 714.895: States per second: 229637, Transitions per second: 647744
pins2lts-mc-linux64( 0/ 8), 714.895:
pins2lts-mc-linux64( 0/ 8), 714.895: State space has 134216935 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 714.895: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 714.895: blue states: 164158572 (122.31%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 714.896: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 714.896: all-red states: 4716700 (3.51%), bogus 533703 (0.40%)
pins2lts-mc-linux64( 0/ 8), 714.896:
pins2lts-mc-linux64( 0/ 8), 714.896: Total memory used for local state coloring: 0.3MB
pins2lts-mc-linux64( 0/ 8), 714.896:
pins2lts-mc-linux64( 0/ 8), 714.896: Queue width: 8B, total height: 18525, memory: 0.14MB
pins2lts-mc-linux64( 0/ 8), 714.896: Tree memory: 1028.1MB, 8.0 B/state, compr.: 2.8%
pins2lts-mc-linux64( 0/ 8), 714.896: Tree fill ratio (roots/leafs): 99.0%/1.0%
pins2lts-mc-linux64( 0/ 8), 714.896: Stored 72 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 714.896: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 714.896: Est. total memory use: 1028.3MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5358407123339218797;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5358407123339218797;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-11 12:33:50] [INFO ] Flatten gal took : 6 ms
[2022-06-11 12:33:50] [INFO ] Time to serialize gal into /tmp/LTLFireability4057437722844560827.gal : 1 ms
[2022-06-11 12:33:50] [INFO ] Time to serialize properties into /tmp/LTLFireability8093023076284578948.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4057437722844560827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8093023076284578948.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !((F((G("((s1<1)||(l21<1))"))||(F("((s1>=1)&&(l202>=1))")))))
Formula 0 simplified : !F(G"((s1<1)||(l21<1))" | F"((s1>=1)&&(l202>=1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t7, t8, t10, t19, t25, t35, t46, t50, t51, t52, t53, t54, t55, t56, t57, t59, t60, t6...296
Computing Next relation with stutter on 1.4325e+13 deadlock states
Detected timeout of ITS tools.
[2022-06-11 12:54:21] [INFO ] Flatten gal took : 7 ms
[2022-06-11 12:54:21] [INFO ] Input system was already deterministic with 72 transitions.
[2022-06-11 12:54:21] [INFO ] Transformed 69 places.
[2022-06-11 12:54:21] [INFO ] Transformed 72 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-11 12:54:21] [INFO ] Time to serialize gal into /tmp/LTLFireability2067530741978770220.gal : 1 ms
[2022-06-11 12:54:21] [INFO ] Time to serialize properties into /tmp/LTLFireability18327641624726586962.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2067530741978770220.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18327641624726586962.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("((s1<1)||(l21<1))"))||(F("((s1>=1)&&(l202>=1))")))))
Formula 0 simplified : !F(G"((s1<1)||(l21<1))" | F"((s1>=1)&&(l202>=1))")

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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