Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679246786040

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=SieveSingleMsgMbox-PT-d0m36
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:26:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 17:26:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:26:28] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2023-03-19 17:26:28] [INFO ] Transformed 262 places.
[2023-03-19 17:26:28] [INFO ] Transformed 73 transitions.
[2023-03-19 17:26:28] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 65 transition count 68
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 65 transition count 68
Applied a total of 12 rules in 26 ms. Remains 65 /72 variables (removed 7) and now considering 68/73 (removed 5) transitions.
// Phase 1: matrix 68 rows 65 cols
[2023-03-19 17:26:28] [INFO ] Computed 5 place invariants in 11 ms
[2023-03-19 17:26:28] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-19 17:26:28] [INFO ] Invariant cache hit.
[2023-03-19 17:26:28] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-19 17:26:28] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-19 17:26:28] [INFO ] Invariant cache hit.
[2023-03-19 17:26:28] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/72 places, 68/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 552 ms. Remains : 65/72 places, 68/73 transitions.
Support contains 25 out of 65 places after structural reductions.
[2023-03-19 17:26:29] [INFO ] Flatten gal took : 51 ms
[2023-03-19 17:26:29] [INFO ] Flatten gal took : 14 ms
[2023-03-19 17:26:29] [INFO ] Input system was already deterministic with 68 transitions.
Incomplete random walk after 10000 steps, including 2182 resets, run finished after 711 ms. (steps per millisecond=14 ) properties (out of 24) seen :10
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 987 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 499 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 1541 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 1051 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 1020 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 995 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 491 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-19 17:26:31] [INFO ] Invariant cache hit.
[2023-03-19 17:26:31] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 17:26:31] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 17:26:31] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:12
[2023-03-19 17:26:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:26:31] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 17:26:31] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :12
[2023-03-19 17:26:31] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-19 17:26:31] [INFO ] After 62ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :2 sat :12
[2023-03-19 17:26:31] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :12
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-19 17:26:31] [INFO ] After 396ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :12
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 204 ms.
Support contains 14 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 68/68 transitions.
Graph (complete) has 176 edges and 65 vertex of which 64 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 64 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 63 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 63 transition count 65
Applied a total of 5 rules in 16 ms. Remains 63 /65 variables (removed 2) and now considering 65/68 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 63/65 places, 65/68 transitions.
Incomplete random walk after 10000 steps, including 2237 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 445 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1059 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 501 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 468 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1047 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1005 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1023 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 65 rows 63 cols
[2023-03-19 17:26:33] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-19 17:26:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:26:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 17:26:33] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 17:26:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:26:33] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 17:26:33] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 17:26:33] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-19 17:26:33] [INFO ] After 55ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-19 17:26:33] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-19 17:26:33] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 3 properties in 65 ms.
Support contains 8 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 65/65 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 61 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 61 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 60 transition count 61
Applied a total of 7 rules in 13 ms. Remains 60 /63 variables (removed 3) and now considering 61/65 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 60/63 places, 61/65 transitions.
Incomplete random walk after 10000 steps, including 2255 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1004 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Finished probabilistic random walk after 1405 steps, run visited all 6 properties in 29 ms. (steps per millisecond=48 )
Probabilistic random walk after 1405 steps, saw 710 distinct states, run finished after 29 ms. (steps per millisecond=48 ) properties seen :6
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 200 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 59 transition count 61
Applied a total of 13 rules in 22 ms. Remains 59 /65 variables (removed 6) and now considering 61/68 (removed 7) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-19 17:26:34] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:26:35] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 17:26:35] [INFO ] Invariant cache hit.
[2023-03-19 17:26:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:26:35] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-19 17:26:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:26:35] [INFO ] Invariant cache hit.
[2023-03-19 17:26:35] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/65 places, 61/68 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 59/65 places, 61/68 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-02 finished in 593 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((X(F(p0))||F(p1)))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Applied a total of 10 rules in 8 ms. Remains 60 /65 variables (removed 5) and now considering 63/68 (removed 5) transitions.
// Phase 1: matrix 63 rows 60 cols
[2023-03-19 17:26:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:26:35] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-19 17:26:35] [INFO ] Invariant cache hit.
[2023-03-19 17:26:35] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-19 17:26:35] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-19 17:26:35] [INFO ] Invariant cache hit.
[2023-03-19 17:26:35] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/65 places, 63/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 60/65 places, 63/68 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s21 1)), p0:(AND (GEQ s1 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 304 ms.
Product exploration explored 100000 steps with 33333 reset in 193 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 187 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-03 finished in 1077 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) U X((G(p0)||(F((X(X(p0)) U p2))&&p1)))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 59 transition count 61
Applied a total of 13 rules in 10 ms. Remains 59 /65 variables (removed 6) and now considering 61/68 (removed 7) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-19 17:26:36] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-19 17:26:36] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-19 17:26:36] [INFO ] Invariant cache hit.
[2023-03-19 17:26:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:26:36] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2023-03-19 17:26:36] [INFO ] Invariant cache hit.
[2023-03-19 17:26:37] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/65 places, 61/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 918 ms. Remains : 59/65 places, 61/68 transitions.
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s1 1) (GEQ s50 1)), p0:(AND (GEQ s1 1) (GEQ s45 1)), p1:(AND (GEQ s1 1) (GEQ s26 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-04 finished in 1254 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 U (p1||G(!p0))))&&(F(p3)||p2))))'
Support contains 5 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Applied a total of 8 rules in 5 ms. Remains 61 /65 variables (removed 4) and now considering 64/68 (removed 4) transitions.
// Phase 1: matrix 64 rows 61 cols
[2023-03-19 17:26:37] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:26:37] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-19 17:26:37] [INFO ] Invariant cache hit.
[2023-03-19 17:26:37] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-19 17:26:38] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-19 17:26:38] [INFO ] Invariant cache hit.
[2023-03-19 17:26:38] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/65 places, 64/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 61/65 places, 64/68 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (AND (NOT p1) p0), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (LT s1 1) (LT s22 1)), p3:(OR (AND (GEQ s6 1) (GEQ s19 1)) (LT s1 1) (LT s21 1)), p1:(AND (NOT (AND (GEQ s1 1) (GEQ s22 1))) (NOT (AND (GEQ s6 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 37373 reset in 264 ms.
Product exploration explored 100000 steps with 37246 reset in 212 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 190 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p2 p3 p1 (NOT p0)), (X p3), (X (NOT (AND (NOT p1) p0))), true]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 327 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), true]
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 1010 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1071 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 17:26:39] [INFO ] Invariant cache hit.
[2023-03-19 17:26:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:26:39] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:26:40] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:26:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 17:26:40] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-19 17:26:40] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-19 17:26:40] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-19 17:26:40] [INFO ] After 15ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-19 17:26:40] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-19 17:26:40] [INFO ] After 122ms 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 9 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 64/64 transitions.
Graph (complete) has 169 edges and 61 vertex of which 60 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 60 transition count 62
Applied a total of 3 rules in 6 ms. Remains 60 /61 variables (removed 1) and now considering 62/64 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 60/61 places, 62/64 transitions.
Incomplete random walk after 10000 steps, including 2212 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1042 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1022 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 735988 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{}
Probabilistic random walk after 735988 steps, saw 378313 distinct states, run finished after 3004 ms. (steps per millisecond=245 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 62 rows 60 cols
[2023-03-19 17:26:43] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-19 17:26:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 17:26:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:26:43] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:26:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 17:26:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 17:26:43] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:26:43] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-19 17:26:43] [INFO ] After 10ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:26:43] [INFO ] After 19ms 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-19 17:26:43] [INFO ] After 72ms 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 7 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 60/60 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-19 17:26:43] [INFO ] Invariant cache hit.
[2023-03-19 17:26:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 17:26:43] [INFO ] Invariant cache hit.
[2023-03-19 17:26:43] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-19 17:26:43] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-19 17:26:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:26:43] [INFO ] Invariant cache hit.
[2023-03-19 17:26:43] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 60/60 places, 62/62 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 60 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 58 transition count 58
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 6 place count 58 transition count 49
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 24 place count 49 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 47 transition count 47
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 44 transition count 47
Applied a total of 34 rules in 9 ms. Remains 44 /60 variables (removed 16) and now considering 47/62 (removed 15) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 47 rows 44 cols
[2023-03-19 17:26:43] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-19 17:26:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:26:43] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 17:26:43] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:26:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:26:43] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 17:26:43] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:26:43] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-19 17:26:43] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p3 p1 (NOT p0)), (X p3), (X (NOT (AND (NOT p1) p0))), true, (G (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND p1 (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (NOT p3))]
Knowledge based reduction with 5 factoid took 296 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[true, (AND p0 (NOT p1))]
Support contains 4 out of 61 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 61 /61 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 61 cols
[2023-03-19 17:26:44] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:26:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-19 17:26:44] [INFO ] Invariant cache hit.
[2023-03-19 17:26:44] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-19 17:26:44] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-19 17:26:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:26:44] [INFO ] Invariant cache hit.
[2023-03-19 17:26:44] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 61/61 places, 64/64 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 190 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 278 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2219 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1064 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1049 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 716332 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :{}
Probabilistic random walk after 716332 steps, saw 368291 distinct states, run finished after 3002 ms. (steps per millisecond=238 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:26:47] [INFO ] Invariant cache hit.
[2023-03-19 17:26:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:26:48] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 17:26:48] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:26:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:26:48] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:26:48] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:26:48] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-19 17:26:48] [INFO ] After 16ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:26:48] [INFO ] After 28ms 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-19 17:26:48] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 523 steps, including 44 resets, run visited all 2 properties in 5 ms. (steps per millisecond=104 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (OR (NOT p0) p1)))]
Property proved to be false thanks to negative knowledge :(F (AND p0 (NOT p1)))
Knowledge based reduction with 6 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-07 finished in 10538 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||G(p1))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 65
Applied a total of 6 rules in 2 ms. Remains 62 /65 variables (removed 3) and now considering 65/68 (removed 3) transitions.
// Phase 1: matrix 65 rows 62 cols
[2023-03-19 17:26:48] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:26:48] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-19 17:26:48] [INFO ] Invariant cache hit.
[2023-03-19 17:26:48] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-19 17:26:48] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-19 17:26:48] [INFO ] Invariant cache hit.
[2023-03-19 17:26:48] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 65/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 263 ms. Remains : 62/65 places, 65/68 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s59 1)), p0:(AND (GEQ s1 1) (GEQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-08 finished in 424 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 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 60 transition count 62
Applied a total of 11 rules in 5 ms. Remains 60 /65 variables (removed 5) and now considering 62/68 (removed 6) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-19 17:26:48] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-19 17:26:48] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-19 17:26:48] [INFO ] Invariant cache hit.
[2023-03-19 17:26:48] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-19 17:26:48] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-19 17:26:48] [INFO ] Invariant cache hit.
[2023-03-19 17:26:49] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/65 places, 62/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 60/65 places, 62/68 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT 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) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT 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:(AND (GEQ s1 1) (GEQ s57 1)), p1:(AND (GEQ s1 1) (GEQ s23 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-09 finished in 439 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 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 59 transition count 61
Applied a total of 13 rules in 11 ms. Remains 59 /65 variables (removed 6) and now considering 61/68 (removed 7) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-19 17:26:49] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:26:49] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-19 17:26:49] [INFO ] Invariant cache hit.
[2023-03-19 17:26:49] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:26:49] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-19 17:26:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:26:49] [INFO ] Invariant cache hit.
[2023-03-19 17:26:49] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/65 places, 61/68 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 59/65 places, 61/68 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22371 reset in 205 ms.
Product exploration explored 100000 steps with 22495 reset in 266 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-19 17:26:50] [INFO ] Invariant cache hit.
[2023-03-19 17:26:50] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-19 17:26:50] [INFO ] Invariant cache hit.
[2023-03-19 17:26:50] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:26:50] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-19 17:26:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:26:50] [INFO ] Invariant cache hit.
[2023-03-19 17:26:50] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 291 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 217 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22473 reset in 131 ms.
Product exploration explored 100000 steps with 22426 reset in 204 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-19 17:26:51] [INFO ] Invariant cache hit.
[2023-03-19 17:26:51] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-19 17:26:51] [INFO ] Invariant cache hit.
[2023-03-19 17:26:51] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:26:51] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-19 17:26:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:26:51] [INFO ] Invariant cache hit.
[2023-03-19 17:26:51] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 237 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-10 finished in 2555 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 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 59 transition count 61
Applied a total of 13 rules in 6 ms. Remains 59 /65 variables (removed 6) and now considering 61/68 (removed 7) transitions.
[2023-03-19 17:26:51] [INFO ] Invariant cache hit.
[2023-03-19 17:26:51] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-19 17:26:51] [INFO ] Invariant cache hit.
[2023-03-19 17:26:51] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:26:51] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-19 17:26:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:26:51] [INFO ] Invariant cache hit.
[2023-03-19 17:26:51] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/65 places, 61/68 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 59/65 places, 61/68 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-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:(OR (LT s1 1) (LT s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22330 reset in 104 ms.
Product exploration explored 100000 steps with 22306 reset in 122 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2220 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 288 steps, run visited all 1 properties in 6 ms. (steps per millisecond=48 )
Probabilistic random walk after 288 steps, saw 153 distinct states, run finished after 6 ms. (steps per millisecond=48 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-19 17:26:52] [INFO ] Invariant cache hit.
[2023-03-19 17:26:52] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-19 17:26:52] [INFO ] Invariant cache hit.
[2023-03-19 17:26:52] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:26:52] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-19 17:26:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:26:52] [INFO ] Invariant cache hit.
[2023-03-19 17:26:52] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 271 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2239 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 288 steps, run visited all 1 properties in 19 ms. (steps per millisecond=15 )
Probabilistic random walk after 288 steps, saw 153 distinct states, run finished after 19 ms. (steps per millisecond=15 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 234 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22382 reset in 105 ms.
Product exploration explored 100000 steps with 22359 reset in 136 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-19 17:26:53] [INFO ] Invariant cache hit.
[2023-03-19 17:26:54] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-19 17:26:54] [INFO ] Invariant cache hit.
[2023-03-19 17:26:54] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:26:54] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-19 17:26:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:26:54] [INFO ] Invariant cache hit.
[2023-03-19 17:26:54] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 278 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-11 finished in 2429 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(F(p0)) U !p1)&&X(F(!p2)))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 65
Applied a total of 6 rules in 2 ms. Remains 62 /65 variables (removed 3) and now considering 65/68 (removed 3) transitions.
// Phase 1: matrix 65 rows 62 cols
[2023-03-19 17:26:54] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:26:54] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-19 17:26:54] [INFO ] Invariant cache hit.
[2023-03-19 17:26:54] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-19 17:26:54] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-19 17:26:54] [INFO ] Invariant cache hit.
[2023-03-19 17:26:54] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 65/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 62/65 places, 65/68 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR p1 p2), p2, (OR p1 (AND (NOT p0) p2)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s41 1)), p2:(AND (GEQ s1 1) (GEQ s38 1)), p0:(AND (GEQ s1 1) (GEQ s34 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]]
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-12 finished in 552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 59 transition count 61
Applied a total of 13 rules in 5 ms. Remains 59 /65 variables (removed 6) and now considering 61/68 (removed 7) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-19 17:26:54] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:26:54] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 17:26:54] [INFO ] Invariant cache hit.
[2023-03-19 17:26:54] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:26:54] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-19 17:26:54] [INFO ] Invariant cache hit.
[2023-03-19 17:26:54] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/65 places, 61/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 59/65 places, 61/68 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s56 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 SieveSingleMsgMbox-PT-d0m36-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-13 finished in 304 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&&(X(G(p2))||p1)))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 60 transition count 62
Applied a total of 11 rules in 17 ms. Remains 60 /65 variables (removed 5) and now considering 62/68 (removed 6) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-19 17:26:55] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:26:55] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-19 17:26:55] [INFO ] Invariant cache hit.
[2023-03-19 17:26:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:26:55] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-19 17:26:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:26:55] [INFO ] Invariant cache hit.
[2023-03-19 17:26:55] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/65 places, 62/68 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 60/65 places, 62/68 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s8 1) (LT s40 1)), p0:(OR (LT s8 1) (LT s40 1)), p2:(AND (GEQ s13 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22337 reset in 97 ms.
Product exploration explored 100000 steps with 22369 reset in 118 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 p2))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0)), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 660 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2215 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1060 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1002 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1014 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1054 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 973 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1026 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 604345 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{0=1, 1=1, 3=1, 4=1}
Probabilistic random walk after 604345 steps, saw 310475 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :4
Running SMT prover for 2 properties.
[2023-03-19 17:26:59] [INFO ] Invariant cache hit.
[2023-03-19 17:26:59] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 p2))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0)), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0))), (G (NOT (AND (NOT p2) p0 (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p2 p0)), (F (NOT (OR (AND (NOT p2) p1) (NOT p0)))), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 15 factoid took 777 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-19 17:27:00] [INFO ] Invariant cache hit.
[2023-03-19 17:27:00] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-19 17:27:00] [INFO ] Invariant cache hit.
[2023-03-19 17:27:00] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:27:00] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-19 17:27:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:27:00] [INFO ] Invariant cache hit.
[2023-03-19 17:27:00] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2228 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 980 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 286 steps, run visited all 1 properties in 17 ms. (steps per millisecond=16 )
Probabilistic random walk after 286 steps, saw 152 distinct states, run finished after 18 ms. (steps per millisecond=15 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22313 reset in 90 ms.
Product exploration explored 100000 steps with 22308 reset in 94 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 61
Applied a total of 2 rules in 17 ms. Remains 59 /60 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-19 17:27:01] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:27:01] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-19 17:27:01] [INFO ] Invariant cache hit.
[2023-03-19 17:27:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-19 17:27:01] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-19 17:27:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:27:01] [INFO ] Invariant cache hit.
[2023-03-19 17:27:01] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/60 places, 61/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 287 ms. Remains : 59/60 places, 61/62 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-14 finished in 6917 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)&&F(G((p1 U p2))))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 60 transition count 62
Applied a total of 11 rules in 4 ms. Remains 60 /65 variables (removed 5) and now considering 62/68 (removed 6) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-19 17:27:02] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:27:03] [INFO ] Implicit Places using invariants in 1237 ms returned []
[2023-03-19 17:27:03] [INFO ] Invariant cache hit.
[2023-03-19 17:27:03] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-19 17:27:03] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 1364 ms to find 0 implicit places.
[2023-03-19 17:27:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:27:03] [INFO ] Invariant cache hit.
[2023-03-19 17:27:03] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/65 places, 62/68 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1427 ms. Remains : 60/65 places, 62/68 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s48 1)), p2:(AND (GEQ s1 1) (GEQ s53 1)), p1:(AND (GEQ s1 1) (GEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-15 finished in 1659 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)))'
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)))'
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&&(X(G(p2))||p1)))))'
[2023-03-19 17:27:04] [INFO ] Flatten gal took : 7 ms
[2023-03-19 17:27:04] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 17:27:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 65 places, 68 transitions and 269 arcs took 2 ms.
Total runtime 36099 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SieveSingleMsgMbox-PT-d0m36
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
LTLFireability

FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679246854439

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 4 (type EXCL) for 3 SieveSingleMsgMbox-PT-d0m36-LTLFireability-11
lola: time limit : 1200 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
SieveSingleMsgMbox-PT-d0m36-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d0m36-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d0m36-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1200 14/32 SieveSingleMsgMbox-PT-d0m36-LTLFireability-11 2040257 m, 408051 m/sec, 4522062 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d0m36-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d0m36-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
SieveSingleMsgMbox-PT-d0m36-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1200 26/32 SieveSingleMsgMbox-PT-d0m36-LTLFireability-11 3977499 m, 387448 m/sec, 9175836 t fired, .

Time elapsed: 10 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for SieveSingleMsgMbox-PT-d0m36-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d0m36-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d0m36-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d0m36-LTLFireability-14: 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: 3
lola: LAUNCH task # 7 (type EXCL) for 6 SieveSingleMsgMbox-PT-d0m36-LTLFireability-14
lola: time limit : 1792 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
SieveSingleMsgMbox-PT-d0m36-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d0m36-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d0m36-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1792 13/32 SieveSingleMsgMbox-PT-d0m36-LTLFireability-14 1862175 m, 372435 m/sec, 4786100 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d0m36-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d0m36-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d0m36-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1792 23/32 SieveSingleMsgMbox-PT-d0m36-LTLFireability-14 3507758 m, 329116 m/sec, 9899774 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d0m36-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
SieveSingleMsgMbox-PT-d0m36-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
SieveSingleMsgMbox-PT-d0m36-LTLFireability-14: 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: 3
lola: LAUNCH task # 1 (type EXCL) for 0 SieveSingleMsgMbox-PT-d0m36-LTLFireability-10
lola: time limit : 3570 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for SieveSingleMsgMbox-PT-d0m36-LTLFireability-10
lola: result : false
lola: markings : 575
lola: fired transitions : 1369
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d0m36-LTLFireability-10: LTL false LTL model checker
SieveSingleMsgMbox-PT-d0m36-LTLFireability-11: LTL unknown AGGR
SieveSingleMsgMbox-PT-d0m36-LTLFireability-14: 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="SieveSingleMsgMbox-PT-d0m36"
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 SieveSingleMsgMbox-PT-d0m36, 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 r423-tajo-167905976600380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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