Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 6.6K Feb 26 05:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 05:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 05:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 05:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 05:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 05:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 26 05:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 64K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679171410869

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d0m040
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 20:30:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 20:30:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:30:12] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-18 20:30:12] [INFO ] Transformed 385 places.
[2023-03-18 20:30:12] [INFO ] Transformed 59 transitions.
[2023-03-18 20:30:12] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 52 transition count 57
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 52 transition count 57
Applied a total of 6 rules in 15 ms. Remains 52 /56 variables (removed 4) and now considering 57/59 (removed 2) transitions.
// Phase 1: matrix 57 rows 52 cols
[2023-03-18 20:30:12] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-18 20:30:13] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-18 20:30:13] [INFO ] Invariant cache hit.
[2023-03-18 20:30:13] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-18 20:30:13] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-18 20:30:13] [INFO ] Invariant cache hit.
[2023-03-18 20:30:13] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 57/59 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 525 ms. Remains : 52/56 places, 57/59 transitions.
Support contains 22 out of 52 places after structural reductions.
[2023-03-18 20:30:13] [INFO ] Flatten gal took : 33 ms
[2023-03-18 20:30:13] [INFO ] Flatten gal took : 9 ms
[2023-03-18 20:30:13] [INFO ] Input system was already deterministic with 57 transitions.
Incomplete random walk after 10000 steps, including 2147 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 19) seen :9
Incomplete Best-First random walk after 10001 steps, including 926 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 969 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 525 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 477 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 20:30:14] [INFO ] Invariant cache hit.
[2023-03-18 20:30:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 20:30:14] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 20:30:15] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:5
[2023-03-18 20:30:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 20:30:15] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 20:30:15] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-18 20:30:15] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-18 20:30:15] [INFO ] After 34ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2023-03-18 20:30:15] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-18 20:30:15] [INFO ] After 252ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 57/57 transitions.
Graph (complete) has 137 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 51 transition count 54
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 48 transition count 49
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 48 transition count 49
Applied a total of 10 rules in 20 ms. Remains 48 /52 variables (removed 4) and now considering 49/57 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 48/52 places, 49/57 transitions.
Incomplete random walk after 10000 steps, including 2216 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 436 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 522 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1017978 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :{0=1, 3=1, 4=1}
Probabilistic random walk after 1017978 steps, saw 392388 distinct states, run finished after 3001 ms. (steps per millisecond=339 ) properties seen :3
Running SMT prover for 2 properties.
// Phase 1: matrix 49 rows 48 cols
[2023-03-18 20:30:18] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-18 20:30:18] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 20:30:18] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 20:30:18] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:30:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 20:30:18] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 20:30:18] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:30:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-18 20:30:18] [INFO ] After 20ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 20:30:18] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 20:30:18] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 49/49 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 48/48 places, 49/49 transitions.
Incomplete random walk after 10000 steps, including 2206 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 883473 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :{}
Probabilistic random walk after 883473 steps, saw 340594 distinct states, run finished after 3002 ms. (steps per millisecond=294 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 20:30:22] [INFO ] Invariant cache hit.
[2023-03-18 20:30:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 20:30:22] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 20:30:22] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:30:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 20:30:22] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 20:30:22] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:30:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-18 20:30:22] [INFO ] After 11ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 20:30:22] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-18 20:30:22] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 49/49 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 48/48 places, 49/49 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 49/49 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2023-03-18 20:30:22] [INFO ] Invariant cache hit.
[2023-03-18 20:30:22] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-18 20:30:22] [INFO ] Invariant cache hit.
[2023-03-18 20:30:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-18 20:30:22] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-18 20:30:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:30:22] [INFO ] Invariant cache hit.
[2023-03-18 20:30:22] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 48/48 places, 49/49 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 48 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 1 place count 48 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 13 place count 42 transition count 42
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 37 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 36 transition count 37
Applied a total of 25 rules in 11 ms. Remains 36 /48 variables (removed 12) and now considering 37/49 (removed 12) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 37 rows 36 cols
[2023-03-18 20:30:22] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-18 20:30:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 20:30:22] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 20:30:22] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:30:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 20:30:22] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 20:30:22] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:30:22] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
[2023-03-18 20:30:22] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2023-03-18 20:30:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 71 ms
[2023-03-18 20:30:22] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-18 20:30:22] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 159 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 52
Applied a total of 10 rules in 7 ms. Remains 47 /52 variables (removed 5) and now considering 52/57 (removed 5) transitions.
// Phase 1: matrix 52 rows 47 cols
[2023-03-18 20:30:22] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 20:30:22] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-18 20:30:22] [INFO ] Invariant cache hit.
[2023-03-18 20:30:22] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-18 20:30:22] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-18 20:30:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:30:22] [INFO ] Invariant cache hit.
[2023-03-18 20:30:23] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/52 places, 52/57 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 47/52 places, 52/57 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23191 reset in 286 ms.
Product exploration explored 100000 steps with 23209 reset in 138 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 145 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 52/52 transitions.
Applied a total of 0 rules in 5 ms. Remains 47 /47 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2023-03-18 20:30:24] [INFO ] Invariant cache hit.
[2023-03-18 20:30:24] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-18 20:30:24] [INFO ] Invariant cache hit.
[2023-03-18 20:30:24] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-18 20:30:24] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-18 20:30:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:30:24] [INFO ] Invariant cache hit.
[2023-03-18 20:30:24] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 47/47 places, 52/52 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 145 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23148 reset in 92 ms.
Product exploration explored 100000 steps with 23122 reset in 88 ms.
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 52/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2023-03-18 20:30:25] [INFO ] Invariant cache hit.
[2023-03-18 20:30:25] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-18 20:30:25] [INFO ] Invariant cache hit.
[2023-03-18 20:30:25] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-18 20:30:25] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-18 20:30:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:30:25] [INFO ] Invariant cache hit.
[2023-03-18 20:30:25] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 47/47 places, 52/52 transitions.
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-00 finished in 2469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(!p0))))))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 52
Applied a total of 10 rules in 6 ms. Remains 47 /52 variables (removed 5) and now considering 52/57 (removed 5) transitions.
[2023-03-18 20:30:25] [INFO ] Invariant cache hit.
[2023-03-18 20:30:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-18 20:30:25] [INFO ] Invariant cache hit.
[2023-03-18 20:30:25] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-18 20:30:25] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-18 20:30:25] [INFO ] Invariant cache hit.
[2023-03-18 20:30:25] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 52/57 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 47/52 places, 52/57 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, true, p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-02 finished in 294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 50
Applied a total of 10 rules in 6 ms. Remains 47 /52 variables (removed 5) and now considering 50/57 (removed 7) transitions.
// Phase 1: matrix 50 rows 47 cols
[2023-03-18 20:30:25] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-18 20:30:25] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-18 20:30:25] [INFO ] Invariant cache hit.
[2023-03-18 20:30:25] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-18 20:30:25] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-18 20:30:25] [INFO ] Invariant cache hit.
[2023-03-18 20:30:25] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 50/57 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 47/52 places, 50/57 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s10 1) (GEQ s15 1)), p0:(OR (AND (GEQ s1 1) (GEQ s20 1) (GEQ s1 1) (GEQ s45 1)) (AND (GEQ s1 1) (GEQ s45 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-05 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((X(G(p1))||F(p2)))&&p0))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 47 transition count 50
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 46 transition count 49
Applied a total of 12 rules in 7 ms. Remains 46 /52 variables (removed 6) and now considering 49/57 (removed 8) transitions.
// Phase 1: matrix 49 rows 46 cols
[2023-03-18 20:30:25] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-18 20:30:26] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-18 20:30:26] [INFO ] Invariant cache hit.
[2023-03-18 20:30:26] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-18 20:30:26] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-18 20:30:26] [INFO ] Invariant cache hit.
[2023-03-18 20:30:26] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/52 places, 49/57 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 46/52 places, 49/57 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)), acceptance={0, 1} source=5 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s20 1)), p2:(AND (GEQ s10 1) (GEQ s20 1)), p1:(OR (LT s8 1) (LT s28 1))], nbAcceptance=2, 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 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-07 finished in 503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&X(p1)&&(G(X(p1))||p0))))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 47 transition count 50
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 46 transition count 49
Applied a total of 12 rules in 3 ms. Remains 46 /52 variables (removed 6) and now considering 49/57 (removed 8) transitions.
[2023-03-18 20:30:26] [INFO ] Invariant cache hit.
[2023-03-18 20:30:26] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-18 20:30:26] [INFO ] Invariant cache hit.
[2023-03-18 20:30:26] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-18 20:30:26] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-18 20:30:26] [INFO ] Invariant cache hit.
[2023-03-18 20:30:26] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/52 places, 49/57 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 46/52 places, 49/57 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s38 1)), p1:(AND (GEQ s1 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-09 finished in 255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((!p0 U !p1))))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 52
Applied a total of 10 rules in 5 ms. Remains 47 /52 variables (removed 5) and now considering 52/57 (removed 5) transitions.
// Phase 1: matrix 52 rows 47 cols
[2023-03-18 20:30:26] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-18 20:30:26] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-18 20:30:26] [INFO ] Invariant cache hit.
[2023-03-18 20:30:26] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-18 20:30:26] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-18 20:30:26] [INFO ] Invariant cache hit.
[2023-03-18 20:30:26] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 52/57 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 47/52 places, 52/57 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s21 1)), p1:(AND (GEQ s1 1) (GEQ s43 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 50000 reset in 157 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 145 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 7 factoid took 131 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-10 finished in 745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 47 transition count 50
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 46 transition count 49
Applied a total of 12 rules in 5 ms. Remains 46 /52 variables (removed 6) and now considering 49/57 (removed 8) transitions.
// Phase 1: matrix 49 rows 46 cols
[2023-03-18 20:30:27] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 20:30:27] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-18 20:30:27] [INFO ] Invariant cache hit.
[2023-03-18 20:30:27] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-18 20:30:27] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-18 20:30:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:30:27] [INFO ] Invariant cache hit.
[2023-03-18 20:30:27] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/52 places, 49/57 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 46/52 places, 49/57 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-11 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 s40 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 RingSingleMessageInMbox-PT-d0m040-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-11 finished in 196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(G(!p1) U !p0)))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 50
Applied a total of 10 rules in 16 ms. Remains 47 /52 variables (removed 5) and now considering 50/57 (removed 7) transitions.
// Phase 1: matrix 50 rows 47 cols
[2023-03-18 20:30:27] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:30:27] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-18 20:30:27] [INFO ] Invariant cache hit.
[2023-03-18 20:30:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-18 20:30:27] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-18 20:30:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:30:27] [INFO ] Invariant cache hit.
[2023-03-18 20:30:27] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/52 places, 50/57 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 47/52 places, 50/57 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, false, p1, (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s41 1) (LT s1 1) (LT s16 1)), p1:(AND (GEQ s1 1) (GEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 21469 reset in 140 ms.
Product exploration explored 100000 steps with 21408 reset in 150 ms.
Computed a total of 4 stabilizing places and 8 stable transitions
Graph (complete) has 144 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 580 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (AND p1 (NOT p0)), p1, (NOT p0), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2140 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 544 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 780179 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :{0=1, 4=1, 5=1}
Probabilistic random walk after 780179 steps, saw 301136 distinct states, run finished after 3003 ms. (steps per millisecond=259 ) properties seen :3
Running SMT prover for 3 properties.
[2023-03-18 20:30:32] [INFO ] Invariant cache hit.
[2023-03-18 20:30:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 20:30:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 20:30:32] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-18 20:30:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 20:30:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 20:30:32] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-18 20:30:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-18 20:30:32] [INFO ] After 9ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-18 20:30:32] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-18 20:30:32] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 50/50 transitions.
Graph (complete) has 124 edges and 47 vertex of which 46 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 46 transition count 47
Applied a total of 4 rules in 3 ms. Remains 46 /47 variables (removed 1) and now considering 47/50 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 46/47 places, 47/50 transitions.
Incomplete random walk after 10000 steps, including 2179 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1386101 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :{}
Probabilistic random walk after 1386101 steps, saw 534232 distinct states, run finished after 3001 ms. (steps per millisecond=461 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 47 rows 46 cols
[2023-03-18 20:30:35] [INFO ] Computed 4 place invariants in 18 ms
[2023-03-18 20:30:35] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 20:30:35] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 20:30:35] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:30:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 20:30:36] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 20:30:36] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:30:36] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-18 20:30:36] [INFO ] After 9ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 20:30:36] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-18 20:30:36] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 47/47 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 46/46 places, 47/47 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 47/47 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-18 20:30:36] [INFO ] Invariant cache hit.
[2023-03-18 20:30:36] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-18 20:30:36] [INFO ] Invariant cache hit.
[2023-03-18 20:30:36] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-18 20:30:36] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-18 20:30:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:30:36] [INFO ] Invariant cache hit.
[2023-03-18 20:30:36] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 46/46 places, 47/47 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 46
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 1 place count 46 transition count 40
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 13 place count 40 transition count 40
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 35 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 34 transition count 35
Applied a total of 25 rules in 6 ms. Remains 34 /46 variables (removed 12) and now considering 35/47 (removed 12) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 35 rows 34 cols
[2023-03-18 20:30:36] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 20:30:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 20:30:36] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 20:30:36] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:30:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 20:30:36] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 20:30:36] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:30:36] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-18 20:30:36] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 14 factoid took 729 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 47 cols
[2023-03-18 20:30:37] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 20:30:37] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-18 20:30:37] [INFO ] Invariant cache hit.
[2023-03-18 20:30:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-18 20:30:37] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-18 20:30:37] [INFO ] Invariant cache hit.
[2023-03-18 20:30:37] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 47/47 places, 50/50 transitions.
Computed a total of 4 stabilizing places and 8 stable transitions
Graph (complete) has 144 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2167 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3301997 steps, run timeout after 3001 ms. (steps per millisecond=1100 ) properties seen :{}
Probabilistic random walk after 3301997 steps, saw 1269235 distinct states, run finished after 3001 ms. (steps per millisecond=1100 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 20:30:40] [INFO ] Invariant cache hit.
[2023-03-18 20:30:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 20:30:40] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-18 20:30:40] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:30:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 20:30:40] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 20:30:40] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:30:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-18 20:30:40] [INFO ] After 5ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 20:30:40] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-18 20:30:40] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 50/50 transitions.
Graph (complete) has 124 edges and 47 vertex of which 46 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 46 transition count 47
Applied a total of 4 rules in 3 ms. Remains 46 /47 variables (removed 1) and now considering 47/50 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 46/47 places, 47/50 transitions.
Incomplete random walk after 10000 steps, including 2173 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3523910 steps, run timeout after 3001 ms. (steps per millisecond=1174 ) properties seen :{}
Probabilistic random walk after 3523910 steps, saw 1345704 distinct states, run finished after 3001 ms. (steps per millisecond=1174 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 47 rows 46 cols
[2023-03-18 20:30:43] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 20:30:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 20:30:43] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 20:30:43] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:30:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 20:30:44] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 20:30:44] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:30:44] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-18 20:30:44] [INFO ] After 5ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 20:30:44] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-18 20:30:44] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 47/47 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 46/46 places, 47/47 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 47/47 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-18 20:30:44] [INFO ] Invariant cache hit.
[2023-03-18 20:30:44] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-18 20:30:44] [INFO ] Invariant cache hit.
[2023-03-18 20:30:44] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-18 20:30:44] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-18 20:30:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:30:44] [INFO ] Invariant cache hit.
[2023-03-18 20:30:44] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 46/46 places, 47/47 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 46
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 1 place count 46 transition count 40
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 13 place count 40 transition count 40
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 35 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 34 transition count 35
Applied a total of 25 rules in 6 ms. Remains 34 /46 variables (removed 12) and now considering 35/47 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 34 cols
[2023-03-18 20:30:44] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 20:30:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 20:30:44] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 20:30:44] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:30:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 20:30:44] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 20:30:44] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:30:44] [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 4 ms.
[2023-03-18 20:30:44] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21541 reset in 79 ms.
Product exploration explored 100000 steps with 21605 reset in 84 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-18 20:30:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 50 rows 47 cols
[2023-03-18 20:30:45] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:30:45] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 47/47 places, 50/50 transitions.
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-18 20:30:45] [INFO ] Invariant cache hit.
[2023-03-18 20:30:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-18 20:30:45] [INFO ] Invariant cache hit.
[2023-03-18 20:30:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-18 20:30:45] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-18 20:30:45] [INFO ] Invariant cache hit.
[2023-03-18 20:30:45] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 47/47 places, 50/50 transitions.
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-13 finished in 17797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G(p1))))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 50
Applied a total of 10 rules in 2 ms. Remains 47 /52 variables (removed 5) and now considering 50/57 (removed 7) transitions.
[2023-03-18 20:30:45] [INFO ] Invariant cache hit.
[2023-03-18 20:30:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-18 20:30:45] [INFO ] Invariant cache hit.
[2023-03-18 20:30:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-18 20:30:45] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-18 20:30:45] [INFO ] Invariant cache hit.
[2023-03-18 20:30:45] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 50/57 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 47/52 places, 50/57 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s41 1)), p0:(AND (GEQ s1 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-14 finished in 323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U (F(p1)&&(p2||X(G(!p0))))))'
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 50
Applied a total of 10 rules in 2 ms. Remains 47 /52 variables (removed 5) and now considering 50/57 (removed 7) transitions.
// Phase 1: matrix 50 rows 47 cols
[2023-03-18 20:30:45] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 20:30:45] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-18 20:30:45] [INFO ] Invariant cache hit.
[2023-03-18 20:30:45] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-18 20:30:45] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-18 20:30:45] [INFO ] Invariant cache hit.
[2023-03-18 20:30:45] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 50/57 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 47/52 places, 50/57 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (NOT p1), p0, p0, (AND (NOT p1) p0), true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s27 1)), p2:(AND (GEQ s10 1) (GEQ s15 1)), p0:(AND (GEQ s11 1) (GEQ s21 1))], nbAcceptance=1, 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 3 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-15 finished in 374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(G(!p1) U !p0)))'
[2023-03-18 20:30:46] [INFO ] Flatten gal took : 12 ms
[2023-03-18 20:30:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-18 20:30:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 52 places, 57 transitions and 223 arcs took 1 ms.
Total runtime 33889 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1255/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1255/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m040-LTLFireability-00
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m040-LTLFireability-13

BK_STOP 1679171447508

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is RingSingleMessageInMbox-PT-d0m040, 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 r329-tall-167889202500812"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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