About the Execution of LoLa+red for CryptoMiner-PT-D20N100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1280.716 | 88830.00 | 114630.00 | 898.60 | F?FFTFFFFFFF?FFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r519-tall-167987245000211.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is CryptoMiner-PT-D20N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987245000211
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 24K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 28K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 29K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 27K Mar 31 16:48 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 CryptoMiner-PT-D20N100-LTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1680845381975
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=CryptoMiner-PT-D20N100
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 05:29:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 05:29:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 05:29:43] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2023-04-07 05:29:43] [INFO ] Transformed 63 places.
[2023-04-07 05:29:43] [INFO ] Transformed 63 transitions.
[2023-04-07 05:29:43] [INFO ] Parsed PT model containing 63 places and 63 transitions and 187 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2023-04-07 05:29:43] [INFO ] Computed 1 invariants in 13 ms
[2023-04-07 05:29:43] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-04-07 05:29:43] [INFO ] Invariant cache hit.
[2023-04-07 05:29:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:29:43] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-04-07 05:29:43] [INFO ] Invariant cache hit.
[2023-04-07 05:29:43] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places after structural reductions.
[2023-04-07 05:29:44] [INFO ] Flatten gal took : 18 ms
[2023-04-07 05:29:44] [INFO ] Flatten gal took : 8 ms
[2023-04-07 05:29:44] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10064 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=228 ) properties (out of 26) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-04-07 05:29:44] [INFO ] Invariant cache hit.
[2023-04-07 05:29:44] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 05:29:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 05:29:44] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-04-07 05:29:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:29:44] [INFO ] After 28ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :2 sat :7
[2023-04-07 05:29:44] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-07 05:29:44] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 63/63 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 62
Free-agglomeration rule applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 17 place count 63 transition count 46
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 47 transition count 46
Applied a total of 33 rules in 12 ms. Remains 47 /63 variables (removed 16) and now considering 46/63 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 47/63 places, 46/63 transitions.
Incomplete random walk after 10002 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 516866 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 516866 steps, saw 218723 distinct states, run finished after 3002 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 46 rows 47 cols
[2023-04-07 05:29:48] [INFO ] Computed 2 invariants in 5 ms
[2023-04-07 05:29:48] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 05:29:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 57 ms returned sat
[2023-04-07 05:29:48] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 05:29:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:29:48] [INFO ] After 33ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 05:29:48] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-07 05:29:48] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 16 ms.
Support contains 10 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 47/47 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-04-07 05:29:48] [INFO ] Invariant cache hit.
[2023-04-07 05:29:48] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-04-07 05:29:48] [INFO ] Invariant cache hit.
[2023-04-07 05:29:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:29:48] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-04-07 05:29:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 05:29:48] [INFO ] Invariant cache hit.
[2023-04-07 05:29: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 270 ms. Remains : 47/47 places, 46/46 transitions.
Graph (complete) has 66 edges and 47 vertex of which 32 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 32 transition count 29
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 29 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 29 transition count 28
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 9 place count 28 transition count 28
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 28 transition count 24
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 17 place count 24 transition count 24
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 22 place count 24 transition count 19
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 27 place count 19 transition count 19
Applied a total of 27 rules in 9 ms. Remains 19 /47 variables (removed 28) and now considering 19/46 (removed 27) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 19 rows 19 cols
[2023-04-07 05:29:49] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 05:29:49] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 05:29:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 05:29:49] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 05:29:49] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-04-07 05:29:49] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.12 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(!p0))))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2023-04-07 05:29:49] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 05:29:49] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-04-07 05:29:49] [INFO ] Invariant cache hit.
[2023-04-07 05:29:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:29:49] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-04-07 05:29:49] [INFO ] Invariant cache hit.
[2023-04-07 05:29:49] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 63/63 places, 63/63 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 246 ms :[p0, p0, p0, true]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GT (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 0 reset in 452 ms.
Product exploration explored 100000 steps with 0 reset in 393 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, p0]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-00 finished in 1672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((G((p0||X(p1))) U !p0) U (!p2 U p3))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:29:51] [INFO ] Invariant cache hit.
[2023-04-07 05:29:51] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-07 05:29:51] [INFO ] Invariant cache hit.
[2023-04-07 05:29:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:29:51] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-04-07 05:29:51] [INFO ] Invariant cache hit.
[2023-04-07 05:29:51] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 458 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), p0, (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=2 dest: 4}, { cond=(NOT p3), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) p2 p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=5 dest: 4}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 9}], [{ cond=(NOT p1), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=10 dest: 8}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p3:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 451 ms.
Product exploration explored 100000 steps with 0 reset in 658 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), true, (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 p0))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 11 states, 25 edges and 4 AP (stutter sensitive) to 11 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 404 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), p0, (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=529 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 05:29:53] [INFO ] Invariant cache hit.
[2023-04-07 05:29:53] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-04-07 05:29:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 05:29:54] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-04-07 05:29:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:29:54] [INFO ] After 28ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-04-07 05:29:54] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-04-07 05:29:54] [INFO ] After 274ms 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 1 ms.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 63/63 places, 63/63 transitions.
Incomplete random walk after 10073 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5036 ) properties (out of 1) seen :0
Finished Best-First random walk after 4597 steps, including 1 resets, run visited all 1 properties in 8 ms. (steps per millisecond=574 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), true, (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (G (NOT (AND p0 p2 (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (AND (NOT p0) p2 (NOT p3))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (NOT p3)), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3) (NOT p1))), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 6 factoid took 526 ms. Reduced automaton from 11 states, 25 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 335 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:29:55] [INFO ] Invariant cache hit.
[2023-04-07 05:29:55] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-04-07 05:29:55] [INFO ] Invariant cache hit.
[2023-04-07 05:29:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:29:55] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-04-07 05:29:55] [INFO ] Invariant cache hit.
[2023-04-07 05:29:55] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p3 p0 (NOT p2) p1), true, (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 575 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5032 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :1
Finished Best-First random walk after 396 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=396 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 p0 (NOT p2) p1), true, (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (AND (NOT p2) (NOT p0) (NOT p3))), (F (AND p2 (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F (NOT p1)), (F (NOT p3)), (F (NOT p0)), (F (AND p0 (NOT p3)))]
Knowledge based reduction with 3 factoid took 334 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 342 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 335 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 211 ms.
Product exploration explored 100000 steps with 1 reset in 277 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 337 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:29:58] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 05:29:58] [INFO ] Invariant cache hit.
[2023-04-07 05:29:58] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:29:58] [INFO ] Invariant cache hit.
[2023-04-07 05:29:58] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-07 05:29:58] [INFO ] Invariant cache hit.
[2023-04-07 05:29:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:29:58] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-04-07 05:29:58] [INFO ] Invariant cache hit.
[2023-04-07 05:29:58] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 63/63 places, 63/63 transitions.
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-01 finished in 7904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(!p0)) U G(p1)))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:29:59] [INFO ] Invariant cache hit.
[2023-04-07 05:29:59] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-04-07 05:29:59] [INFO ] Invariant cache hit.
[2023-04-07 05:29:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:29:59] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-04-07 05:29:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 05:29:59] [INFO ] Invariant cache hit.
[2023-04-07 05:29:59] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(OR (LEQ (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 455 ms.
Product exploration explored 100000 steps with 0 reset in 458 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 107 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=592 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:30:00] [INFO ] Invariant cache hit.
[2023-04-07 05:30:00] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:30:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 05:30:00] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 15 factoid took 255 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-02 finished in 1985 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 21 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 1 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 05:30:01] [INFO ] Computed 0 invariants in 4 ms
[2023-04-07 05:30:01] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-04-07 05:30:01] [INFO ] Invariant cache hit.
[2023-04-07 05:30:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:01] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-04-07 05:30:01] [INFO ] Invariant cache hit.
[2023-04-07 05:30:01] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 149 ms.
Product exploration explored 100000 steps with 0 reset in 172 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5032 ) properties (out of 1) seen :0
Finished Best-First random walk after 400 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=400 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-04-07 05:30:01] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-03 finished in 1117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(!p1)&&F(G(p2)))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2023-04-07 05:30:02] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 05:30:02] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-04-07 05:30:02] [INFO ] Invariant cache hit.
[2023-04-07 05:30:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:02] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-04-07 05:30:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 05:30:02] [INFO ] Invariant cache hit.
[2023-04-07 05:30:02] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 288 ms.
Product exploration explored 100000 steps with 0 reset in 333 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 92 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3354 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:30:03] [INFO ] Invariant cache hit.
[2023-04-07 05:30:03] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 194 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2023-04-07 05:30:03] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 10 factoid took 230 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-05 finished in 1852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:30:03] [INFO ] Invariant cache hit.
[2023-04-07 05:30:04] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-07 05:30:04] [INFO ] Invariant cache hit.
[2023-04-07 05:30:04] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:04] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-04-07 05:30:04] [INFO ] Invariant cache hit.
[2023-04-07 05:30:04] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1 reset in 180 ms.
Product exploration explored 100000 steps with 0 reset in 213 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[p0]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[p0]
Stuttering acceptance computed with spot in 33 ms :[p0]
[2023-04-07 05:30:04] [INFO ] Invariant cache hit.
[2023-04-07 05:30:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 05:30:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:30:05] [INFO ] [Real]Absence check using state equation in 42 ms returned unsat
Proved EG p0
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-06 finished in 1202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(!p0)))))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 3 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 05:30:05] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 05:30:05] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-04-07 05:30:05] [INFO ] Invariant cache hit.
[2023-04-07 05:30:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:05] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-04-07 05:30:05] [INFO ] Invariant cache hit.
[2023-04-07 05:30:05] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, true, true, p0]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s31 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], 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 CryptoMiner-PT-D20N100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-08 finished in 282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1&&X(p2)))||G(p3))))'
Support contains 7 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2023-04-07 05:30:05] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 05:30:05] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-04-07 05:30:05] [INFO ] Invariant cache hit.
[2023-04-07 05:30:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:05] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-04-07 05:30:05] [INFO ] Invariant cache hit.
[2023-04-07 05:30:05] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 365 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p2), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={} source=2 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p3 p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}], [{ cond=(NOT p3), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=6 dest: 5}]], initial=0, aps=[p0:(GT s17 s55), p3:(LEQ s52 s3), p1:(LEQ s21 s58), p2:(LEQ s33 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 514 steps with 110 reset in 3 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-10 finished in 535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 1 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 05:30:06] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 05:30:06] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 05:30:06] [INFO ] Invariant cache hit.
[2023-04-07 05:30:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:06] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-04-07 05:30:06] [INFO ] Invariant cache hit.
[2023-04-07 05:30:06] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s39)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 134 ms.
Product exploration explored 100000 steps with 0 reset in 147 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10069 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5034 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2819035 steps, run timeout after 3048 ms. (steps per millisecond=924 ) properties seen :{}
Probabilistic random walk after 2819035 steps, saw 1410286 distinct states, run finished after 3049 ms. (steps per millisecond=924 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:30:09] [INFO ] Invariant cache hit.
[2023-04-07 05:30:09] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 05:30:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:09] [INFO ] After 15ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-07 05:30:09] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-07 05:30:09] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 41 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 3 ms
Free SCC test removed 20 places
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 79 edges and 42 vertex of which 18 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 18 transition count 17
Applied a total of 15 rules in 5 ms. Remains 18 /62 variables (removed 44) and now considering 17/63 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 18/62 places, 17/63 transitions.
Incomplete random walk after 10052 steps, including 151 resets, run finished after 3 ms. (steps per millisecond=3350 ) properties (out of 1) seen :0
Finished Best-First random walk after 449 steps, including 28 resets, run visited all 1 properties in 1 ms. (steps per millisecond=449 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2023-04-07 05:30:09] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-11 finished in 4082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(F(p1)))))))'
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 16 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:30:10] [INFO ] Invariant cache hit.
[2023-04-07 05:30:10] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 05:30:10] [INFO ] Invariant cache hit.
[2023-04-07 05:30:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:10] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-04-07 05:30:10] [INFO ] Invariant cache hit.
[2023-04-07 05:30:10] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s44 s9), p1:(LEQ s33 s7)], 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 20006 reset in 89 ms.
Product exploration explored 100000 steps with 19990 reset in 81 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10066 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5033 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:30:11] [INFO ] Invariant cache hit.
[2023-04-07 05:30:11] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:30:11] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:30:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:11] [INFO ] After 5ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:30:11] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 05:30:11] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 62
Free-agglomeration rule applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 19 place count 62 transition count 44
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 44 transition count 44
Applied a total of 37 rules in 5 ms. Remains 44 /62 variables (removed 18) and now considering 44/63 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 44/62 places, 44/63 transitions.
Incomplete random walk after 10082 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=5041 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2525004 steps, run visited all 1 properties in 1727 ms. (steps per millisecond=1462 )
Probabilistic random walk after 2525004 steps, saw 530903 distinct states, run finished after 1728 ms. (steps per millisecond=1461 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:30:13] [INFO ] Invariant cache hit.
[2023-04-07 05:30:13] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-04-07 05:30:13] [INFO ] Invariant cache hit.
[2023-04-07 05:30:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:13] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-04-07 05:30:13] [INFO ] Invariant cache hit.
[2023-04-07 05:30:13] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2516 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:30:13] [INFO ] Invariant cache hit.
[2023-04-07 05:30:13] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:30:13] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:30:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:13] [INFO ] After 4ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:30:13] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 05:30:13] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 62
Free-agglomeration rule applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 19 place count 62 transition count 44
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 44 transition count 44
Applied a total of 37 rules in 7 ms. Remains 44 /62 variables (removed 18) and now considering 44/63 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 44/62 places, 44/63 transitions.
Incomplete random walk after 10020 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1670 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2525004 steps, run visited all 1 properties in 1558 ms. (steps per millisecond=1620 )
Probabilistic random walk after 2525004 steps, saw 530903 distinct states, run finished after 1559 ms. (steps per millisecond=1619 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 19925 reset in 67 ms.
Product exploration explored 100000 steps with 19974 reset in 76 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:30:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 05:30:16] [INFO ] Invariant cache hit.
[2023-04-07 05:30:16] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 62/62 places, 63/63 transitions.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:30:16] [INFO ] Invariant cache hit.
[2023-04-07 05:30:16] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 05:30:16] [INFO ] Invariant cache hit.
[2023-04-07 05:30:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:16] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-04-07 05:30:16] [INFO ] Invariant cache hit.
[2023-04-07 05:30:16] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 62/62 places, 63/63 transitions.
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-12 finished in 6593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U (G(p1)||X(!p0))))))'
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 1 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:30:16] [INFO ] Invariant cache hit.
[2023-04-07 05:30:16] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-04-07 05:30:16] [INFO ] Invariant cache hit.
[2023-04-07 05:30:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:16] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-04-07 05:30:16] [INFO ] Invariant cache hit.
[2023-04-07 05:30:16] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 276 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND p1 p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s21 s54), p0:(LEQ 1 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25080 reset in 84 ms.
Product exploration explored 100000 steps with 25039 reset in 87 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 7 factoid took 368 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0), true, (NOT p1)]
Incomplete random walk after 10086 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=3362 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 05:30:17] [INFO ] Invariant cache hit.
[2023-04-07 05:30:17] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 05:30:18] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 05:30:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:18] [INFO ] After 10ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 05:30:18] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-07 05:30:18] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 40 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 79 edges and 42 vertex of which 39 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 2 ms. Remains 39 /62 variables (removed 23) and now considering 42/63 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 39/62 places, 42/63 transitions.
Incomplete random walk after 10058 steps, including 89 resets, run finished after 13 ms. (steps per millisecond=773 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 224 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 254 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Finished probabilistic random walk after 24896 steps, run visited all 3 properties in 51 ms. (steps per millisecond=488 )
Probabilistic random walk after 24896 steps, saw 10047 distinct states, run finished after 51 ms. (steps per millisecond=488 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND p1 p0)), (F p0), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) p0))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) p0))
Knowledge based reduction with 7 factoid took 569 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-13 finished in 2111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (complete) has 165 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:30:18] [INFO ] Invariant cache hit.
[2023-04-07 05:30:18] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 05:30:18] [INFO ] Invariant cache hit.
[2023-04-07 05:30:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:18] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-04-07 05:30:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:30:18] [INFO ] Invariant cache hit.
[2023-04-07 05:30:18] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s34 s5)], 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 0 reset in 129 ms.
Product exploration explored 100000 steps with 0 reset in 174 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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 31 ms :[(NOT p0)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5032 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3047877 steps, run timeout after 3001 ms. (steps per millisecond=1015 ) properties seen :{}
Probabilistic random walk after 3047877 steps, saw 1517630 distinct states, run finished after 3001 ms. (steps per millisecond=1015 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:30:22] [INFO ] Invariant cache hit.
[2023-04-07 05:30:22] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:30:22] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:30:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:22] [INFO ] After 12ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:30:22] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 05:30:22] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (complete) has 100 edges and 62 vertex of which 48 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 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 14 rules applied. Total rules applied 15 place count 48 transition count 42
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 22 place count 42 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 41 transition count 41
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 35 place count 41 transition count 29
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 47 place count 29 transition count 29
Applied a total of 47 rules in 14 ms. Remains 29 /62 variables (removed 33) and now considering 29/63 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 29/62 places, 29/63 transitions.
Incomplete random walk after 10084 steps, including 5 resets, run finished after 2 ms. (steps per millisecond=5042 ) properties (out of 1) seen :0
Finished Best-First random walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 86 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-04-07 05:30:22] [INFO ] Invariant cache hit.
[2023-04-07 05:30:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:30:22] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-04-07 05:30:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:30:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:30:22] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-04-07 05:30:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:22] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2023-04-07 05:30:22] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-07 05:30:22] [INFO ] Added : 57 causal constraints over 12 iterations in 134 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:30:22] [INFO ] Invariant cache hit.
[2023-04-07 05:30:23] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-04-07 05:30:23] [INFO ] Invariant cache hit.
[2023-04-07 05:30:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:23] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-04-07 05:30:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:30:23] [INFO ] Invariant cache hit.
[2023-04-07 05:30:23] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 55 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)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5032 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2978919 steps, run timeout after 3001 ms. (steps per millisecond=992 ) properties seen :{}
Probabilistic random walk after 2978919 steps, saw 1485310 distinct states, run finished after 3001 ms. (steps per millisecond=992 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:30:26] [INFO ] Invariant cache hit.
[2023-04-07 05:30:26] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:30:26] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:30:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:26] [INFO ] After 3ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:30:26] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 05:30:26] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (complete) has 100 edges and 62 vertex of which 48 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 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 14 rules applied. Total rules applied 15 place count 48 transition count 42
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 22 place count 42 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 41 transition count 41
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 35 place count 41 transition count 29
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 47 place count 29 transition count 29
Applied a total of 47 rules in 9 ms. Remains 29 /62 variables (removed 33) and now considering 29/63 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 29/62 places, 29/63 transitions.
Incomplete random walk after 10096 steps, including 6 resets, run finished after 1 ms. (steps per millisecond=10096 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5638 steps, run visited all 1 properties in 7 ms. (steps per millisecond=805 )
Probabilistic random walk after 5638 steps, saw 1719 distinct states, run finished after 7 ms. (steps per millisecond=805 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 171 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-04-07 05:30:26] [INFO ] Invariant cache hit.
[2023-04-07 05:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:30:26] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-04-07 05:30:26] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:30:26] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-04-07 05:30:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:26] [INFO ] [Nat]Added 20 Read/Feed constraints in 6 ms returned sat
[2023-04-07 05:30:26] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-07 05:30:26] [INFO ] Added : 57 causal constraints over 12 iterations in 157 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 127 ms.
Product exploration explored 100000 steps with 0 reset in 200 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:30:27] [INFO ] Invariant cache hit.
[2023-04-07 05:30:27] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-04-07 05:30:27] [INFO ] Invariant cache hit.
[2023-04-07 05:30:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:27] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-04-07 05:30:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:30:27] [INFO ] Invariant cache hit.
[2023-04-07 05:30:27] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 62/62 places, 63/63 transitions.
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-14 finished in 8717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (trivial) has 41 edges and 63 vertex of which 21 / 63 are part of one of the 1 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 145 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.30 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 31 ms. Remains 42 /63 variables (removed 21) and now considering 43/63 (removed 20) transitions.
// Phase 1: matrix 43 rows 42 cols
[2023-04-07 05:30:27] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 05:30:27] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-04-07 05:30:27] [INFO ] Invariant cache hit.
[2023-04-07 05:30:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:27] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-04-07 05:30:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:30:27] [INFO ] Invariant cache hit.
[2023-04-07 05:30:27] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/63 places, 43/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 42/63 places, 43/63 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s5), p1:(LEQ 3 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-15 finished in 274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((G((p0||X(p1))) U !p0) U (!p2 U p3))))))'
Found a Lengthening insensitive property : CryptoMiner-PT-D20N100-LTLCardinality-01
Stuttering acceptance computed with spot in 388 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), p0, (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2023-04-07 05:30:28] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 05:30:28] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 05:30:28] [INFO ] Invariant cache hit.
[2023-04-07 05:30:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:28] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-04-07 05:30:28] [INFO ] Invariant cache hit.
[2023-04-07 05:30:28] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 120 ms. Remains : 63/63 places, 63/63 transitions.
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=2 dest: 4}, { cond=(NOT p3), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) p2 p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=5 dest: 4}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 9}], [{ cond=(NOT p1), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=10 dest: 8}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p3:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 568 ms.
Product exploration explored 100000 steps with 0 reset in 398 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), true, (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 p0))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 11 states, 25 edges and 4 AP (stutter sensitive) to 11 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 441 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), p0, (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1437 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 05:30:30] [INFO ] Invariant cache hit.
[2023-04-07 05:30:30] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-07 05:30:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 05:30:30] [INFO ] After 26ms SMT Verify possible using all constraints in natural 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 p3 (NOT p2) p0 p1), true, (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (G (NOT (AND p0 p2 (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (AND (NOT p0) p2 (NOT p3))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (NOT p3)), (F (AND p2 (NOT p3) (NOT p1))), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 6 factoid took 402 ms. Reduced automaton from 11 states, 25 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 343 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:30:31] [INFO ] Invariant cache hit.
[2023-04-07 05:30:31] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 05:30:31] [INFO ] Invariant cache hit.
[2023-04-07 05:30:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:31] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-04-07 05:30:31] [INFO ] Invariant cache hit.
[2023-04-07 05:30:31] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p3 p0 (NOT p2) p1), true, (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1118 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-04-07 05:30:31] [INFO ] Invariant cache hit.
[2023-04-07 05:30:31] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:30:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 05:30:31] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:30:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:31] [INFO ] After 10ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:30:31] [INFO ] After 19ms 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-04-07 05:30:31] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 124 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=62 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p3 p0 (NOT p2) p1), true, (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (AND (NOT p2) (NOT p0) (NOT p3))), (F (AND p2 (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F (NOT p1)), (F (NOT p3)), (F (NOT p0)), (F (AND p0 (NOT p3)))]
Knowledge based reduction with 3 factoid took 314 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 285 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 317 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 272 ms.
Product exploration explored 100000 steps with 1 reset in 239 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 434 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:30:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:30:34] [INFO ] Invariant cache hit.
[2023-04-07 05:30:34] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 05:30:34] [INFO ] Invariant cache hit.
[2023-04-07 05:30:34] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 05:30:34] [INFO ] Invariant cache hit.
[2023-04-07 05:30:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 05:30:34] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-04-07 05:30:34] [INFO ] Invariant cache hit.
[2023-04-07 05:30:34] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 63/63 places, 63/63 transitions.
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-01 finished in 6697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(F(p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-04-07 05:30:34] [INFO ] Flatten gal took : 4 ms
[2023-04-07 05:30:34] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-07 05:30:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 63 places, 63 transitions and 187 arcs took 0 ms.
Total runtime 51280 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CryptoMiner-PT-D20N100
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/366
LTLCardinality
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1680845470805
--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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/366/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/366/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/366/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:521
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 # 1 (type EXCL) for 0 CryptoMiner-PT-D20N100-LTLCardinality-01
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
CryptoMiner-PT-D20N100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
CryptoMiner-PT-D20N100-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
CryptoMiner-PT-D20N100-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1200 12/32 CryptoMiner-PT-D20N100-LTLCardinality-01 1546290 m, 309258 m/sec, 4113677 t fired, .
Time elapsed: 5 secs. Pages in use: 12
# 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
CryptoMiner-PT-D20N100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
CryptoMiner-PT-D20N100-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
CryptoMiner-PT-D20N100-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1200 21/32 CryptoMiner-PT-D20N100-LTLCardinality-01 2726663 m, 236074 m/sec, 7661450 t fired, .
Time elapsed: 10 secs. Pages in use: 21
# 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
CryptoMiner-PT-D20N100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
CryptoMiner-PT-D20N100-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
CryptoMiner-PT-D20N100-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1200 29/32 CryptoMiner-PT-D20N100-LTLCardinality-01 3808396 m, 216346 m/sec, 11021880 t fired, .
Time elapsed: 15 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for CryptoMiner-PT-D20N100-LTLCardinality-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D20N100-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D20N100-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
CryptoMiner-PT-D20N100-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 4 (type EXCL) for 3 CryptoMiner-PT-D20N100-LTLCardinality-12
lola: time limit : 1790 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
CryptoMiner-PT-D20N100-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D20N100-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
CryptoMiner-PT-D20N100-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1790 18/32 CryptoMiner-PT-D20N100-LTLCardinality-12 2466587 m, 493317 m/sec, 5853456 t fired, .
Time elapsed: 25 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
CryptoMiner-PT-D20N100-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D20N100-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
CryptoMiner-PT-D20N100-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1790 31/32 CryptoMiner-PT-D20N100-LTLCardinality-12 4369345 m, 380551 m/sec, 11004424 t fired, .
Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for CryptoMiner-PT-D20N100-LTLCardinality-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D20N100-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D20N100-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D20N100-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 CryptoMiner-PT-D20N100-LTLCardinality-14
lola: time limit : 3565 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for CryptoMiner-PT-D20N100-LTLCardinality-14
lola: result : false
lola: markings : 121
lola: fired transitions : 122
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
CryptoMiner-PT-D20N100-LTLCardinality-01: LTL unknown AGGR
CryptoMiner-PT-D20N100-LTLCardinality-12: LTL unknown AGGR
CryptoMiner-PT-D20N100-LTLCardinality-14: LTL false LTL model checker
Time elapsed: 35 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="CryptoMiner-PT-D20N100"
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 CryptoMiner-PT-D20N100, 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 r519-tall-167987245000211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-PT-D20N100.tgz
mv CryptoMiner-PT-D20N100 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 '
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 ;