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-167905976800491.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-d2m96, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976800491
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 26 10:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 26 10:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 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 1.1M 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-d2m96-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679249915330

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m96
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 18:18:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 18:18:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 18:18:39] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2023-03-19 18:18:39] [INFO ] Transformed 2398 places.
[2023-03-19 18:18:39] [INFO ] Transformed 1954 transitions.
[2023-03-19 18:18:39] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 483 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1984 places in 18 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 971 place count 271 transition count 380
Iterating global reduction 1 with 118 rules applied. Total rules applied 1089 place count 271 transition count 380
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1099 place count 271 transition count 370
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1190 place count 180 transition count 279
Iterating global reduction 2 with 91 rules applied. Total rules applied 1281 place count 180 transition count 279
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1320 place count 180 transition count 240
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1358 place count 142 transition count 187
Iterating global reduction 3 with 38 rules applied. Total rules applied 1396 place count 142 transition count 187
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1419 place count 142 transition count 164
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1428 place count 133 transition count 151
Iterating global reduction 4 with 9 rules applied. Total rules applied 1437 place count 133 transition count 151
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1446 place count 124 transition count 142
Iterating global reduction 4 with 9 rules applied. Total rules applied 1455 place count 124 transition count 142
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1459 place count 120 transition count 137
Iterating global reduction 4 with 4 rules applied. Total rules applied 1463 place count 120 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1464 place count 120 transition count 136
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1468 place count 116 transition count 132
Iterating global reduction 5 with 4 rules applied. Total rules applied 1472 place count 116 transition count 132
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1475 place count 113 transition count 129
Iterating global reduction 5 with 3 rules applied. Total rules applied 1478 place count 113 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1479 place count 112 transition count 128
Iterating global reduction 5 with 1 rules applied. Total rules applied 1480 place count 112 transition count 128
Applied a total of 1480 rules in 206 ms. Remains 112 /414 variables (removed 302) and now considering 128/1954 (removed 1826) transitions.
// Phase 1: matrix 128 rows 112 cols
[2023-03-19 18:18:40] [INFO ] Computed 5 place invariants in 31 ms
[2023-03-19 18:18:40] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-19 18:18:40] [INFO ] Invariant cache hit.
[2023-03-19 18:18:40] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-19 18:18:40] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-03-19 18:18:40] [INFO ] Invariant cache hit.
[2023-03-19 18:18:40] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/414 places, 128/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 998 ms. Remains : 112/414 places, 128/1954 transitions.
Support contains 3 out of 112 places after structural reductions.
[2023-03-19 18:18:41] [INFO ] Flatten gal took : 58 ms
[2023-03-19 18:18:41] [INFO ] Flatten gal took : 11 ms
[2023-03-19 18:18:41] [INFO ] Input system was already deterministic with 128 transitions.
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1024 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1025 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1043 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 494746 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 494746 steps, saw 234214 distinct states, run finished after 3002 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 18:18:44] [INFO ] Invariant cache hit.
[2023-03-19 18:18:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:18:44] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 18:18:45] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-19 18:18:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-19 18:18:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 18:18:45] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-19 18:18:45] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-19 18:18:45] [INFO ] After 12ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-19 18:18:45] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 8 ms to minimize.
[2023-03-19 18:18:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-19 18:18:45] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-19 18:18:45] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 128/128 transitions.
Graph (complete) has 319 edges and 112 vertex of which 111 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 111 transition count 126
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 109 transition count 124
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 109 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 109 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 107 transition count 119
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 107 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 106 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 106 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 105 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 105 transition count 117
Applied a total of 17 rules in 37 ms. Remains 105 /112 variables (removed 7) and now considering 117/128 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 105/112 places, 117/128 transitions.
Incomplete random walk after 10000 steps, including 2217 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1006 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2113309 steps, run timeout after 3001 ms. (steps per millisecond=704 ) properties seen :{}
Probabilistic random walk after 2113309 steps, saw 986438 distinct states, run finished after 3001 ms. (steps per millisecond=704 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2023-03-19 18:18:48] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-19 18:18:48] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:18:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:18:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:18:48] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:18:48] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:18:48] [INFO ] After 12ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:18:48] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2023-03-19 18:18:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-19 18:18:48] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-19 18:18:48] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 9 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 11 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-19 18:18:48] [INFO ] Invariant cache hit.
[2023-03-19 18:18:49] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-19 18:18:49] [INFO ] Invariant cache hit.
[2023-03-19 18:18:49] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:18:49] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-19 18:18:49] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 18:18:49] [INFO ] Invariant cache hit.
[2023-03-19 18:18:49] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 488 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 38 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2023-03-19 18:18:49] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-19 18:18:49] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:18:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-19 18:18:49] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 18:18:49] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:18:49] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2023-03-19 18:18:49] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2023-03-19 18:18:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-03-19 18:18:49] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-19 18:18:49] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 31 stabilizing places and 39 stable transitions
Graph (complete) has 357 edges and 112 vertex of which 111 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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(X(G(p0))))))'
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 128/128 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 110 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 108 transition count 121
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 108 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 107 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 107 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 106 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 106 transition count 119
Applied a total of 14 rules in 9 ms. Remains 106 /112 variables (removed 6) and now considering 119/128 (removed 9) transitions.
// Phase 1: matrix 119 rows 106 cols
[2023-03-19 18:18:49] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 18:18:49] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-19 18:18:49] [INFO ] Invariant cache hit.
[2023-03-19 18:18:49] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 18:18:49] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-19 18:18:49] [INFO ] Invariant cache hit.
[2023-03-19 18:18:50] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/112 places, 119/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 106/112 places, 119/128 transitions.
Stuttering acceptance computed with spot in 438 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ s58 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22454 reset in 416 ms.
Product exploration explored 100000 steps with 22514 reset in 213 ms.
Computed a total of 30 stabilizing places and 38 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 30 stabilizing places and 38 stable transitions
Detected a total of 30/106 stabilizing places and 38/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2243 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 1054 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2210284 steps, run timeout after 3001 ms. (steps per millisecond=736 ) properties seen :{}
Probabilistic random walk after 2210284 steps, saw 1029068 distinct states, run finished after 3014 ms. (steps per millisecond=733 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 18:18:54] [INFO ] Invariant cache hit.
[2023-03-19 18:18:54] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:18:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:18:54] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 18:18:54] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:18:54] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 18:18:54] [INFO ] After 27ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:18:55] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2023-03-19 18:18:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-19 18:18:55] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-19 18:18:55] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 transitions.
Graph (complete) has 301 edges and 106 vertex of which 105 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 105 transition count 117
Applied a total of 3 rules in 25 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1045 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2260668 steps, run timeout after 3001 ms. (steps per millisecond=753 ) properties seen :{}
Probabilistic random walk after 2260668 steps, saw 1052502 distinct states, run finished after 3001 ms. (steps per millisecond=753 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2023-03-19 18:18:58] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-19 18:18:58] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:18:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:18:58] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:18:58] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:18:58] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:18:58] [INFO ] After 10ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:18:58] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 0 ms to minimize.
[2023-03-19 18:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-19 18:18:58] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-19 18:18:58] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 16 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-19 18:18:58] [INFO ] Invariant cache hit.
[2023-03-19 18:18:58] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-19 18:18:58] [INFO ] Invariant cache hit.
[2023-03-19 18:18:58] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:18:58] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-19 18:18:58] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 18:18:58] [INFO ] Invariant cache hit.
[2023-03-19 18:18:58] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 8 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2023-03-19 18:18:58] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-19 18:18:59] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:18:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 18:18:59] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:18:59] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:18:59] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2023-03-19 18:18:59] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2023-03-19 18:18:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2023-03-19 18:18:59] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-19 18:18:59] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 106 cols
[2023-03-19 18:19:00] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 18:19:01] [INFO ] Implicit Places using invariants in 1491 ms returned []
[2023-03-19 18:19:01] [INFO ] Invariant cache hit.
[2023-03-19 18:19:01] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 18:19:01] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 1698 ms to find 0 implicit places.
[2023-03-19 18:19:01] [INFO ] Invariant cache hit.
[2023-03-19 18:19:01] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1811 ms. Remains : 106/106 places, 119/119 transitions.
Computed a total of 30 stabilizing places and 38 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 30 stabilizing places and 38 stable transitions
Detected a total of 30/106 stabilizing places and 38/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1024 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2101410 steps, run timeout after 3001 ms. (steps per millisecond=700 ) properties seen :{}
Probabilistic random walk after 2101410 steps, saw 980815 distinct states, run finished after 3001 ms. (steps per millisecond=700 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 18:19:05] [INFO ] Invariant cache hit.
[2023-03-19 18:19:05] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:19:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-19 18:19:05] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 18:19:05] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:05] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 18:19:05] [INFO ] After 14ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:05] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2023-03-19 18:19:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-19 18:19:05] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-19 18:19:05] [INFO ] After 264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 transitions.
Graph (complete) has 301 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 117
Applied a total of 3 rules in 13 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2213 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1013 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2163950 steps, run timeout after 3001 ms. (steps per millisecond=721 ) properties seen :{}
Probabilistic random walk after 2163950 steps, saw 1008973 distinct states, run finished after 3001 ms. (steps per millisecond=721 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2023-03-19 18:19:08] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 18:19:08] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:19:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 18:19:08] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-19 18:19:08] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:19:08] [INFO ] After 11ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:08] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2023-03-19 18:19:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-19 18:19:08] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-19 18:19:09] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-19 18:19:09] [INFO ] Invariant cache hit.
[2023-03-19 18:19:09] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-19 18:19:09] [INFO ] Invariant cache hit.
[2023-03-19 18:19:09] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:19:09] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-19 18:19:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 18:19:09] [INFO ] Invariant cache hit.
[2023-03-19 18:19:10] [INFO ] Dead Transitions using invariants and state equation in 1156 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1503 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 24 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2023-03-19 18:19:10] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-19 18:19:10] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:19:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:10] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:19:10] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:10] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2023-03-19 18:19:10] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 0 ms to minimize.
[2023-03-19 18:19:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2023-03-19 18:19:10] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-19 18:19:10] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 329 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 407 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22422 reset in 151 ms.
Product exploration explored 100000 steps with 22459 reset in 275 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 18 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-19 18:19:12] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 119 rows 106 cols
[2023-03-19 18:19:12] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 18:19:12] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 106/106 places, 119/119 transitions.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-19 18:19:12] [INFO ] Invariant cache hit.
[2023-03-19 18:19:13] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-19 18:19:13] [INFO ] Invariant cache hit.
[2023-03-19 18:19:13] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 18:19:13] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-19 18:19:13] [INFO ] Invariant cache hit.
[2023-03-19 18:19:13] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 511 ms. Remains : 106/106 places, 119/119 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 finished in 23893 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(X(G(p0))))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 112/112 places, 128/128 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 110 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 108 transition count 121
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 108 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 107 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 107 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 106 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 106 transition count 119
Applied a total of 14 rules in 29 ms. Remains 106 /112 variables (removed 6) and now considering 119/128 (removed 9) transitions.
[2023-03-19 18:19:13] [INFO ] Invariant cache hit.
[2023-03-19 18:19:14] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-19 18:19:14] [INFO ] Invariant cache hit.
[2023-03-19 18:19:14] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 18:19:14] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-19 18:19:14] [INFO ] Invariant cache hit.
[2023-03-19 18:19:14] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 106/112 places, 119/128 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 556 ms. Remains : 106/112 places, 119/128 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ s58 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22409 reset in 238 ms.
Product exploration explored 100000 steps with 22470 reset in 208 ms.
Computed a total of 30 stabilizing places and 38 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 30 stabilizing places and 38 stable transitions
Detected a total of 30/106 stabilizing places and 38/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2229 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1026 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2313294 steps, run timeout after 3001 ms. (steps per millisecond=770 ) properties seen :{}
Probabilistic random walk after 2313294 steps, saw 1078524 distinct states, run finished after 3001 ms. (steps per millisecond=770 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 18:19:18] [INFO ] Invariant cache hit.
[2023-03-19 18:19:18] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:19:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:18] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 18:19:18] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:18] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 18:19:18] [INFO ] After 19ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:18] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2023-03-19 18:19:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-19 18:19:18] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-19 18:19:18] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 transitions.
Graph (complete) has 301 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 117
Applied a total of 3 rules in 6 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2246 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 1008 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2329608 steps, run timeout after 3001 ms. (steps per millisecond=776 ) properties seen :{}
Probabilistic random walk after 2329608 steps, saw 1086524 distinct states, run finished after 3001 ms. (steps per millisecond=776 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2023-03-19 18:19:21] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-19 18:19:21] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:19:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 18:19:21] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:21] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:19:21] [INFO ] After 28ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:21] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2023-03-19 18:19:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-19 18:19:22] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-19 18:19:22] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-19 18:19:22] [INFO ] Invariant cache hit.
[2023-03-19 18:19:22] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-19 18:19:22] [INFO ] Invariant cache hit.
[2023-03-19 18:19:22] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:19:22] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-19 18:19:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 18:19:22] [INFO ] Invariant cache hit.
[2023-03-19 18:19:22] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 483 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 14 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2023-03-19 18:19:22] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-19 18:19:22] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:19:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:22] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:19:22] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:22] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2023-03-19 18:19:22] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2023-03-19 18:19:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2023-03-19 18:19:22] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-19 18:19:22] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 229 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 423 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 106 cols
[2023-03-19 18:19:23] [INFO ] Computed 5 place invariants in 12 ms
[2023-03-19 18:19:23] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-19 18:19:23] [INFO ] Invariant cache hit.
[2023-03-19 18:19:23] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 18:19:24] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-19 18:19:24] [INFO ] Invariant cache hit.
[2023-03-19 18:19:24] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 106/106 places, 119/119 transitions.
Computed a total of 30 stabilizing places and 38 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 30 stabilizing places and 38 stable transitions
Detected a total of 30/106 stabilizing places and 38/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 234 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2197 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1081 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2271771 steps, run timeout after 3001 ms. (steps per millisecond=757 ) properties seen :{}
Probabilistic random walk after 2271771 steps, saw 1057912 distinct states, run finished after 3001 ms. (steps per millisecond=757 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 18:19:27] [INFO ] Invariant cache hit.
[2023-03-19 18:19:27] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:19:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 18:19:27] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 18:19:27] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:27] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 18:19:27] [INFO ] After 12ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:28] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2023-03-19 18:19:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-19 18:19:28] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-19 18:19:28] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 transitions.
Graph (complete) has 301 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 117
Applied a total of 3 rules in 4 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1049 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2255188 steps, run timeout after 3001 ms. (steps per millisecond=751 ) properties seen :{}
Probabilistic random walk after 2255188 steps, saw 1049698 distinct states, run finished after 3001 ms. (steps per millisecond=751 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2023-03-19 18:19:31] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-19 18:19:31] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:19:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 18:19:31] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-19 18:19:31] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:31] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:19:31] [INFO ] After 15ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:31] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2023-03-19 18:19:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-19 18:19:31] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-19 18:19:31] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-19 18:19:31] [INFO ] Invariant cache hit.
[2023-03-19 18:19:31] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-19 18:19:31] [INFO ] Invariant cache hit.
[2023-03-19 18:19:31] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 18:19:31] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-19 18:19:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 18:19:31] [INFO ] Invariant cache hit.
[2023-03-19 18:19:31] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 435 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 12 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2023-03-19 18:19:31] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-19 18:19:31] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:19:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 18:19:31] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:19:31] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:32] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2023-03-19 18:19:32] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 2 ms to minimize.
[2023-03-19 18:19:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2023-03-19 18:19:32] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-19 18:19:32] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 377 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 399 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 389 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22389 reset in 154 ms.
Product exploration explored 100000 steps with 22445 reset in 147 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 523 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 15 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-19 18:19:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 119 rows 106 cols
[2023-03-19 18:19:34] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 18:19:38] [INFO ] Dead Transitions using invariants and state equation in 4379 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4440 ms. Remains : 106/106 places, 119/119 transitions.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-19 18:19:39] [INFO ] Invariant cache hit.
[2023-03-19 18:19:39] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-19 18:19:39] [INFO ] Invariant cache hit.
[2023-03-19 18:19:39] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-19 18:19:39] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-03-19 18:19:39] [INFO ] Invariant cache hit.
[2023-03-19 18:19:39] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 391 ms. Remains : 106/106 places, 119/119 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 finished in 25891 ms.
[2023-03-19 18:19:39] [INFO ] Flatten gal took : 12 ms
[2023-03-19 18:19:39] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-19 18:19:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 128 transitions and 509 arcs took 2 ms.
Total runtime 60500 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SieveSingleMsgMbox-PT-d2m96
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLCardinality

BK_STOP 1679249994795

--------------------
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 LTLCardinality -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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11
lola: time limit : 3600 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-d2m96-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 12/32 SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 1603806 m, 320761 m/sec, 3229608 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 23/32 SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 3166598 m, 312558 m/sec, 6387377 t fired, .

Time elapsed: 10 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for SieveSingleMsgMbox-PT-d2m96-LTLCardinality-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-d2m96-LTLCardinality-11: LTL 0 0 0 0 1 0 1 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: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11: LTL unknown AGGR


Time elapsed: 15 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-d2m96"
export BK_EXAMINATION="LTLCardinality"
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-d2m96, examination is LTLCardinality"
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-167905976800491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m96.tgz
mv SieveSingleMsgMbox-PT-d2m96 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;