fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r327-tall-167889200100812
Last Updated
May 14, 2023

About the Execution of LoLa+red for RingSingleMessageInMbox-PT-d0m040

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1201.027 64585.00 88248.00 645.90 ?FFFFFTFTFTFF?FF normal

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.r327-tall-167889200100812.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 lolaxred
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 r327-tall-167889200100812
=====================================================================

--------------------
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 1679058416196

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d0m040
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 13:06:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 13:06:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 13:06:57] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-17 13:06:57] [INFO ] Transformed 385 places.
[2023-03-17 13:06:57] [INFO ] Transformed 59 transitions.
[2023-03-17 13:06:57] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 329 places in 0 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 13 ms. Remains 52 /56 variables (removed 4) and now considering 57/59 (removed 2) transitions.
// Phase 1: matrix 57 rows 52 cols
[2023-03-17 13:06:58] [INFO ] Computed 3 place invariants in 14 ms
[2023-03-17 13:06:58] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-17 13:06:58] [INFO ] Invariant cache hit.
[2023-03-17 13:06:58] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-17 13:06:58] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-17 13:06:58] [INFO ] Invariant cache hit.
[2023-03-17 13:06:58] [INFO ] Dead Transitions using invariants and state equation in 39 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 283 ms. Remains : 52/56 places, 57/59 transitions.
Support contains 22 out of 52 places after structural reductions.
[2023-03-17 13:06:58] [INFO ] Flatten gal took : 19 ms
[2023-03-17 13:06:58] [INFO ] Flatten gal took : 9 ms
[2023-03-17 13:06:58] [INFO ] Input system was already deterministic with 57 transitions.
Incomplete random walk after 10000 steps, including 2196 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 19) seen :8
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 527 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-17 13:06:59] [INFO ] Invariant cache hit.
[2023-03-17 13:06:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-17 13:06:59] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 13:06:59] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:3
[2023-03-17 13:06:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-17 13:06:59] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-17 13:06:59] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-17 13:06:59] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-17 13:06:59] [INFO ] After 14ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :3 sat :3
[2023-03-17 13:06:59] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-17 13:06:59] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 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.1 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 10 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 10 ms. Remains : 48/52 places, 49/57 transitions.
Incomplete random walk after 10000 steps, including 2161 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1151824 steps, run timeout after 3001 ms. (steps per millisecond=383 ) properties seen :{2=1}
Probabilistic random walk after 1151824 steps, saw 444426 distinct states, run finished after 3001 ms. (steps per millisecond=383 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 49 rows 48 cols
[2023-03-17 13:07:03] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-17 13:07:03] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-17 13:07:03] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 13:07:03] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 13:07:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 13:07:03] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 13:07:03] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 13:07:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-17 13:07:03] [INFO ] After 10ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 13:07:03] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-17 13:07:03] [INFO ] After 93ms 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 5 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.
Incomplete random walk after 10000 steps, including 2172 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 520 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1251863 steps, run timeout after 3001 ms. (steps per millisecond=417 ) properties seen :{}
Probabilistic random walk after 1251863 steps, saw 481582 distinct states, run finished after 3002 ms. (steps per millisecond=417 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 13:07:06] [INFO ] Invariant cache hit.
[2023-03-17 13:07:06] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-17 13:07:06] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 13:07:06] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 13:07:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-17 13:07:06] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 13:07:06] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 13:07:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-17 13:07:06] [INFO ] After 9ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 13:07:06] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-17 13:07:06] [INFO ] After 78ms 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 2 ms. Remains 48 /48 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2023-03-17 13:07:06] [INFO ] Invariant cache hit.
[2023-03-17 13:07:06] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-17 13:07:06] [INFO ] Invariant cache hit.
[2023-03-17 13:07:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-17 13:07:06] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-17 13:07:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 13:07:06] [INFO ] Invariant cache hit.
[2023-03-17 13:07:06] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 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 9 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-17 13:07:06] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-17 13:07:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 13:07:06] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 13:07:06] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 13:07:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 13:07:06] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-17 13:07:06] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 13:07:06] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
[2023-03-17 13:07:06] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2023-03-17 13:07:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 74 ms
[2023-03-17 13:07:06] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-17 13:07:06] [INFO ] After 138ms 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.2 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-17 13:07:07] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 13:07:07] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-17 13:07:07] [INFO ] Invariant cache hit.
[2023-03-17 13:07:07] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-17 13:07:07] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-17 13:07:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 13:07:07] [INFO ] Invariant cache hit.
[2023-03-17 13:07:07] [INFO ] Dead Transitions using invariants and state equation in 41 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 162 ms. Remains : 47/52 places, 52/57 transitions.
Stuttering acceptance computed with spot in 181 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 23319 reset in 209 ms.
Product exploration explored 100000 steps with 23202 reset in 128 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 125 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 65 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 139 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 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 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 8 ms. Remains 47 /47 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2023-03-17 13:07:08] [INFO ] Invariant cache hit.
[2023-03-17 13:07:08] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-17 13:07:08] [INFO ] Invariant cache hit.
[2023-03-17 13:07:08] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-17 13:07:08] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-17 13:07:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 13:07:08] [INFO ] Invariant cache hit.
[2023-03-17 13:07:08] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 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 100 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 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 14 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 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 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23190 reset in 81 ms.
Product exploration explored 100000 steps with 23290 reset in 181 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-17 13:07:09] [INFO ] Invariant cache hit.
[2023-03-17 13:07:09] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-17 13:07:09] [INFO ] Invariant cache hit.
[2023-03-17 13:07:09] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-17 13:07:09] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-17 13:07:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 13:07:09] [INFO ] Invariant cache hit.
[2023-03-17 13:07:09] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 47/47 places, 52/52 transitions.
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-00 finished in 2342 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 3 ms. Remains 47 /52 variables (removed 5) and now considering 52/57 (removed 5) transitions.
[2023-03-17 13:07:09] [INFO ] Invariant cache hit.
[2023-03-17 13:07:09] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-17 13:07:09] [INFO ] Invariant cache hit.
[2023-03-17 13:07:09] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-17 13:07:09] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-17 13:07:09] [INFO ] Invariant cache hit.
[2023-03-17 13:07:09] [INFO ] Dead Transitions using invariants and state equation in 33 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 166 ms. Remains : 47/52 places, 52/57 transitions.
Stuttering acceptance computed with spot in 95 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 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-02 finished in 274 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 5 ms. Remains 47 /52 variables (removed 5) and now considering 50/57 (removed 7) transitions.
// Phase 1: matrix 50 rows 47 cols
[2023-03-17 13:07:09] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 13:07:09] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-17 13:07:09] [INFO ] Invariant cache hit.
[2023-03-17 13:07:09] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-17 13:07:09] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-17 13:07:09] [INFO ] Invariant cache hit.
[2023-03-17 13:07:09] [INFO ] Dead Transitions using invariants and state equation in 33 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 134 ms. Remains : 47/52 places, 50/57 transitions.
Stuttering acceptance computed with spot in 105 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 252 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 6 ms. Remains 46 /52 variables (removed 6) and now considering 49/57 (removed 8) transitions.
// Phase 1: matrix 49 rows 46 cols
[2023-03-17 13:07:10] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 13:07:10] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-17 13:07:10] [INFO ] Invariant cache hit.
[2023-03-17 13:07:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-17 13:07:10] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-17 13:07:10] [INFO ] Invariant cache hit.
[2023-03-17 13:07:10] [INFO ] Dead Transitions using invariants and state equation in 29 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 119 ms. Remains : 46/52 places, 49/57 transitions.
Stuttering acceptance computed with spot in 365 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 508 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 7 ms. Remains 46 /52 variables (removed 6) and now considering 49/57 (removed 8) transitions.
[2023-03-17 13:07:10] [INFO ] Invariant cache hit.
[2023-03-17 13:07:10] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-17 13:07:10] [INFO ] Invariant cache hit.
[2023-03-17 13:07:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-17 13:07:10] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-17 13:07:10] [INFO ] Invariant cache hit.
[2023-03-17 13:07:10] [INFO ] Dead Transitions using invariants and state equation in 32 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 123 ms. Remains : 46/52 places, 49/57 transitions.
Stuttering acceptance computed with spot in 96 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 237 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 10 ms. Remains 47 /52 variables (removed 5) and now considering 52/57 (removed 5) transitions.
// Phase 1: matrix 52 rows 47 cols
[2023-03-17 13:07:10] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 13:07:10] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-17 13:07:10] [INFO ] Invariant cache hit.
[2023-03-17 13:07:10] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-17 13:07:10] [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-17 13:07:10] [INFO ] Invariant cache hit.
[2023-03-17 13:07:10] [INFO ] Dead Transitions using invariants and state equation in 30 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 134 ms. Remains : 47/52 places, 52/57 transitions.
Stuttering acceptance computed with spot in 142 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 139 ms.
Product exploration explored 100000 steps with 50000 reset in 130 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 : [(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 161 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 723 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 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-17 13:07:11] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 13:07:11] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-17 13:07:11] [INFO ] Invariant cache hit.
[2023-03-17 13:07:11] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-17 13:07:11] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-17 13:07:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 13:07:11] [INFO ] Invariant cache hit.
[2023-03-17 13:07:11] [INFO ] Dead Transitions using invariants and state equation in 29 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 154 ms. Remains : 46/52 places, 49/57 transitions.
Stuttering acceptance computed with spot in 26 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 197 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 9 ms. Remains 47 /52 variables (removed 5) and now considering 50/57 (removed 7) transitions.
// Phase 1: matrix 50 rows 47 cols
[2023-03-17 13:07:11] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 13:07:11] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-17 13:07:11] [INFO ] Invariant cache hit.
[2023-03-17 13:07:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 13:07:11] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-17 13:07:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 13:07:11] [INFO ] Invariant cache hit.
[2023-03-17 13:07:11] [INFO ] Dead Transitions using invariants and state equation in 30 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 133 ms. Remains : 47/52 places, 50/57 transitions.
Stuttering acceptance computed with spot in 151 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 21606 reset in 147 ms.
Product exploration explored 100000 steps with 21447 reset in 139 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 532 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 163 ms :[true, (AND p1 (NOT p0)), p1, (NOT p0), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2156 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 504 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1033594 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :{0=1, 4=1, 5=1}
Probabilistic random walk after 1033594 steps, saw 397615 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :3
Running SMT prover for 3 properties.
[2023-03-17 13:07:16] [INFO ] Invariant cache hit.
[2023-03-17 13:07:16] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-17 13:07:16] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 13:07:16] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-17 13:07:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-17 13:07:16] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-17 13:07:16] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-17 13:07:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 13:07:16] [INFO ] After 8ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-17 13:07:16] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-17 13:07:16] [INFO ] After 81ms 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.1 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 2149 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1269313 steps, run timeout after 3001 ms. (steps per millisecond=422 ) properties seen :{}
Probabilistic random walk after 1269313 steps, saw 487310 distinct states, run finished after 3001 ms. (steps per millisecond=422 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 47 rows 46 cols
[2023-03-17 13:07:19] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-17 13:07:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-17 13:07:19] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 13:07:19] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 13:07:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 13:07:19] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 13:07:19] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 13:07:19] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-17 13:07:19] [INFO ] After 12ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 13:07:19] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-17 13:07:19] [INFO ] After 82ms 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 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 8 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 8 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 4 ms. Remains 46 /46 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-17 13:07:19] [INFO ] Invariant cache hit.
[2023-03-17 13:07:19] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-17 13:07:19] [INFO ] Invariant cache hit.
[2023-03-17 13:07:19] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-17 13:07:19] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-17 13:07:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 13:07:19] [INFO ] Invariant cache hit.
[2023-03-17 13:07:19] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 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-17 13:07:19] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-17 13:07:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 13:07:19] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-17 13:07:19] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 13:07:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 13:07:19] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 13:07:19] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 13:07:19] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-17 13:07:19] [INFO ] After 50ms 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 657 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 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 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 0 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 47 cols
[2023-03-17 13:07:20] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-17 13:07:20] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-17 13:07:20] [INFO ] Invariant cache hit.
[2023-03-17 13:07:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 13:07:20] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-17 13:07:20] [INFO ] Invariant cache hit.
[2023-03-17 13:07:20] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 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 134 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 88 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2124 resets, run finished after 14 ms. (steps per millisecond=714 ) 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 3599042 steps, run timeout after 3001 ms. (steps per millisecond=1199 ) properties seen :{}
Probabilistic random walk after 3599042 steps, saw 1382813 distinct states, run finished after 3001 ms. (steps per millisecond=1199 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 13:07:24] [INFO ] Invariant cache hit.
[2023-03-17 13:07:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-17 13:07:24] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-17 13:07:24] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 13:07:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-17 13:07:24] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 13:07:24] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 13:07:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 13:07:24] [INFO ] After 4ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 13:07:24] [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 4 ms.
[2023-03-17 13:07:24] [INFO ] After 51ms 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 2194 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3744078 steps, run timeout after 3001 ms. (steps per millisecond=1247 ) properties seen :{}
Probabilistic random walk after 3744078 steps, saw 1430061 distinct states, run finished after 3001 ms. (steps per millisecond=1247 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 47 rows 46 cols
[2023-03-17 13:07:27] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-17 13:07:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 13:07:27] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 13:07:27] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 13:07:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 13:07:27] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 13:07:27] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 13:07:27] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-17 13:07:27] [INFO ] After 8ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 13:07:27] [INFO ] After 13ms 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-17 13:07:27] [INFO ] After 57ms 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 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-17 13:07:27] [INFO ] Invariant cache hit.
[2023-03-17 13:07:27] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-17 13:07:27] [INFO ] Invariant cache hit.
[2023-03-17 13:07:27] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-17 13:07:27] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-17 13:07:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 13:07:27] [INFO ] Invariant cache hit.
[2023-03-17 13:07:27] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 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 4 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-17 13:07:27] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-17 13:07:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 13:07:27] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 13:07:27] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 13:07:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 13:07:27] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 13:07:27] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 13:07:27] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-17 13:07:27] [INFO ] After 47ms 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 154 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)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21579 reset in 75 ms.
Product exploration explored 100000 steps with 21404 reset in 87 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 79 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 4 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-17 13:07:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 47 cols
[2023-03-17 13:07:28] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 13:07:28] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53 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-17 13:07:28] [INFO ] Invariant cache hit.
[2023-03-17 13:07:28] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-17 13:07:28] [INFO ] Invariant cache hit.
[2023-03-17 13:07:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 13:07:28] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-17 13:07:28] [INFO ] Invariant cache hit.
[2023-03-17 13:07:28] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 47/47 places, 50/50 transitions.
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-13 finished in 16894 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-17 13:07:28] [INFO ] Invariant cache hit.
[2023-03-17 13:07:28] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-17 13:07:28] [INFO ] Invariant cache hit.
[2023-03-17 13:07:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 13:07:28] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-17 13:07:28] [INFO ] Invariant cache hit.
[2023-03-17 13:07:28] [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 125 ms. Remains : 47/52 places, 50/57 transitions.
Stuttering acceptance computed with spot in 145 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 283 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 4 ms. Remains 47 /52 variables (removed 5) and now considering 50/57 (removed 7) transitions.
// Phase 1: matrix 50 rows 47 cols
[2023-03-17 13:07:28] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 13:07:28] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-17 13:07:29] [INFO ] Invariant cache hit.
[2023-03-17 13:07:29] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-17 13:07:29] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-17 13:07:29] [INFO ] Invariant cache hit.
[2023-03-17 13:07:29] [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 168 ms. Remains : 47/52 places, 50/57 transitions.
Stuttering acceptance computed with spot in 189 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 7 steps with 1 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-15 finished in 381 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-17 13:07:29] [INFO ] Flatten gal took : 6 ms
[2023-03-17 13:07:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-17 13:07:29] [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 31886 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT RingSingleMessageInMbox-PT-d0m040
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

BK_STOP 1679058480781

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 RingSingleMessageInMbox-PT-d0m040-LTLFireability-00
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RingSingleMessageInMbox-PT-d0m040-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
RingSingleMessageInMbox-PT-d0m040-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 15/32 RingSingleMessageInMbox-PT-d0m040-LTLFireability-00 2178191 m, 435638 m/sec, 4848254 t fired, .

Time elapsed: 5 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RingSingleMessageInMbox-PT-d0m040-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
RingSingleMessageInMbox-PT-d0m040-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 27/32 RingSingleMessageInMbox-PT-d0m040-LTLFireability-00 4080089 m, 380379 m/sec, 9537945 t fired, .

Time elapsed: 10 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for RingSingleMessageInMbox-PT-d0m040-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RingSingleMessageInMbox-PT-d0m040-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
RingSingleMessageInMbox-PT-d0m040-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 RingSingleMessageInMbox-PT-d0m040-LTLFireability-13
lola: time limit : 3585 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RingSingleMessageInMbox-PT-d0m040-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
RingSingleMessageInMbox-PT-d0m040-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3585 12/32 RingSingleMessageInMbox-PT-d0m040-LTLFireability-13 1803706 m, 360741 m/sec, 5087994 t fired, .

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RingSingleMessageInMbox-PT-d0m040-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
RingSingleMessageInMbox-PT-d0m040-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3585 24/32 RingSingleMessageInMbox-PT-d0m040-LTLFireability-13 3548187 m, 348896 m/sec, 10100681 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for RingSingleMessageInMbox-PT-d0m040-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RingSingleMessageInMbox-PT-d0m040-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
RingSingleMessageInMbox-PT-d0m040-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
RingSingleMessageInMbox-PT-d0m040-LTLFireability-00: LTL unknown AGGR
RingSingleMessageInMbox-PT-d0m040-LTLFireability-13: LTL unknown AGGR


Time elapsed: 30 secs. Pages in use: 32

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="lolaxred"
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 lolaxred"
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 r327-tall-167889200100812"
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 ;