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.r521-tall-167987246300203.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CryptoMiner-PT-D10N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246300203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 13K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 32K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 30K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 214K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K 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 15K 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-D10N100-LTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680891263841

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D10N100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 18:14:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 18:14:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:14:29] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-04-07 18:14:29] [INFO ] Transformed 33 places.
[2023-04-07 18:14:29] [INFO ] Transformed 33 transitions.
[2023-04-07 18:14:29] [INFO ] Parsed PT model containing 33 places and 33 transitions and 97 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 6 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2023-04-07 18:14:29] [INFO ] Computed 1 invariants in 36 ms
[2023-04-07 18:14:29] [INFO ] Implicit Places using invariants in 471 ms returned []
[2023-04-07 18:14:29] [INFO ] Invariant cache hit.
[2023-04-07 18:14:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:30] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2023-04-07 18:14:30] [INFO ] Invariant cache hit.
[2023-04-07 18:14:30] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 715 ms. Remains : 33/33 places, 33/33 transitions.
Support contains 33 out of 33 places after structural reductions.
[2023-04-07 18:14:30] [INFO ] Flatten gal took : 29 ms
[2023-04-07 18:14:30] [INFO ] Flatten gal took : 22 ms
[2023-04-07 18:14:30] [INFO ] Input system was already deterministic with 33 transitions.
Incomplete random walk after 10064 steps, including 3 resets, run finished after 121 ms. (steps per millisecond=83 ) properties (out of 22) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-04-07 18:14:31] [INFO ] Invariant cache hit.
[2023-04-07 18:14:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 18:14:31] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 18:14:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-04-07 18:14:31] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-04-07 18:14:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:31] [INFO ] After 32ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-04-07 18:14:31] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-07 18:14:31] [INFO ] After 509ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 33/33 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 33 transition count 32
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 9 place count 33 transition count 24
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 25 transition count 24
Applied a total of 17 rules in 12 ms. Remains 25 /33 variables (removed 8) and now considering 24/33 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 25/33 places, 24/33 transitions.
Incomplete random walk after 10053 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=386 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 667875 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 667875 steps, saw 144312 distinct states, run finished after 3002 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 24 rows 25 cols
[2023-04-07 18:14:34] [INFO ] Computed 2 invariants in 0 ms
[2023-04-07 18:14:35] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 18:14:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:14:35] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 18:14:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:35] [INFO ] After 24ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 18:14:35] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-07 18:14:35] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 24/24 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-04-07 18:14:35] [INFO ] Invariant cache hit.
[2023-04-07 18:14:35] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-04-07 18:14:35] [INFO ] Invariant cache hit.
[2023-04-07 18:14:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:35] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-04-07 18:14:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:14:35] [INFO ] Invariant cache hit.
[2023-04-07 18:14:35] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 25/25 places, 24/24 transitions.
Graph (complete) has 34 edges and 25 vertex of which 15 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 15 transition count 8
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 15 place count 8 transition count 8
Applied a total of 15 rules in 2 ms. Remains 8 /25 variables (removed 17) and now considering 8/24 (removed 16) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-04-07 18:14:35] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 18:14:35] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 18:14:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2023-04-07 18:14:35] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 18:14:35] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-04-07 18:14:35] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 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(F(p0)))'
Support contains 11 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 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 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 18:14:36] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:14:36] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-04-07 18:14:36] [INFO ] Invariant cache hit.
[2023-04-07 18:14:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:36] [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 18:14:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:14:36] [INFO ] Invariant cache hit.
[2023-04-07 18:14:36] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 32/33 places, 33/33 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 267 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 293 ms.
Stack based approach found an accepted trace after 114 steps with 0 reset with depth 115 and stack size 115 in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-01 finished in 795 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 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 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 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:14:36] [INFO ] Invariant cache hit.
[2023-04-07 18:14:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 18:14:36] [INFO ] Invariant cache hit.
[2023-04-07 18:14:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:36] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-04-07 18:14:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:14:36] [INFO ] Invariant cache hit.
[2023-04-07 18:14:36] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-02 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 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31))], 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 235 ms.
Product exploration explored 100000 steps with 0 reset in 316 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 3447 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3447 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 190 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 22 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:14:37] [INFO ] Invariant cache hit.
[2023-04-07 18:14:38] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-04-07 18:14:38] [INFO ] Invariant cache hit.
[2023-04-07 18:14:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:38] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-04-07 18:14:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:14:38] [INFO ] Invariant cache hit.
[2023-04-07 18:14:38] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 62 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 26 ms :[(NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 148 ms.
Product exploration explored 100000 steps with 0 reset in 181 ms.
Support contains 22 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:14:38] [INFO ] Invariant cache hit.
[2023-04-07 18:14:38] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-04-07 18:14:38] [INFO ] Invariant cache hit.
[2023-04-07 18:14:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:38] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-04-07 18:14:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:14:38] [INFO ] Invariant cache hit.
[2023-04-07 18:14:38] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 32/32 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-02 finished in 2142 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((X((G(p0) U p1))&&F(!p0))))'
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2023-04-07 18:14:38] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 18:14:38] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 18:14:39] [INFO ] Invariant cache hit.
[2023-04-07 18:14:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:39] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-07 18:14:39] [INFO ] Invariant cache hit.
[2023-04-07 18:14:39] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)), p1:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.8 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-03 finished in 624 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(F(p0)))'
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 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 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 18:14:39] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:14:39] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-04-07 18:14:39] [INFO ] Invariant cache hit.
[2023-04-07 18:14:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:39] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-04-07 18:14:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:14:39] [INFO ] Invariant cache hit.
[2023-04-07 18:14:39] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31)) (LEQ 1 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 137 ms.
Stack based approach found an accepted trace after 745 steps with 0 reset with depth 746 and stack size 746 in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-04 finished in 375 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||X(F((p1||G(p2)||G(!p0)))))))'
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2023-04-07 18:14:39] [INFO ] Computed 1 invariants in 2 ms
[2023-04-07 18:14:40] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-04-07 18:14:40] [INFO ] Invariant cache hit.
[2023-04-07 18:14:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:40] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-04-07 18:14:40] [INFO ] Invariant cache hit.
[2023-04-07 18:14:40] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p2:(GT (ADD 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], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 260 ms.
Stack based approach found an accepted trace after 430 steps with 0 reset with depth 431 and stack size 431 in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-05 finished in 517 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) U G(!p1)) U (F(G(p2))||(F(!p1)&&X(!p0)))))'
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:14:40] [INFO ] Invariant cache hit.
[2023-04-07 18:14:40] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 18:14:40] [INFO ] Invariant cache hit.
[2023-04-07 18:14:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:40] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-04-07 18:14:40] [INFO ] Invariant cache hit.
[2023-04-07 18:14:40] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND p1 p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GT (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32) (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)), p2:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 ...], 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 1 reset in 128 ms.
Product exploration explored 100000 steps with 0 reset in 135 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p2 (NOT p1) p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 568 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p2)]
Incomplete random walk after 10034 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5017 ) 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 : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p2 (NOT p1) p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 828 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 p2)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p2)]
Support contains 11 out of 33 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:14:42] [INFO ] Invariant cache hit.
[2023-04-07 18:14:42] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 18:14:42] [INFO ] Invariant cache hit.
[2023-04-07 18:14:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:42] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-04-07 18:14:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:14:42] [INFO ] Invariant cache hit.
[2023-04-07 18:14:42] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 191 ms. Remains : 33/33 places, 33/33 transitions.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 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 25 ms :[(NOT p2)]
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 : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p2)]
Product exploration explored 100000 steps with 0 reset in 116 ms.
Product exploration explored 100000 steps with 0 reset in 164 ms.
Support contains 11 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 18:14:43] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:14:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-04-07 18:14:43] [INFO ] Invariant cache hit.
[2023-04-07 18:14:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:43] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-04-07 18:14:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:14:43] [INFO ] Invariant cache hit.
[2023-04-07 18:14:43] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 32/33 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-06 finished in 3246 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(F(!p0)) U (p1||G(!p1)))))'
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2023-04-07 18:14:43] [INFO ] Computed 1 invariants in 3 ms
[2023-04-07 18:14:43] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 18:14:43] [INFO ] Invariant cache hit.
[2023-04-07 18:14:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:43] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 18:14:43] [INFO ] Invariant cache hit.
[2023-04-07 18:14:43] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 131 ms :[p0, false, false, (AND p0 p1)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32)), p1:(GT 2 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 10 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-07 finished in 455 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||(!p1 U p2)))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:14:44] [INFO ] Invariant cache hit.
[2023-04-07 18:14:44] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-07 18:14:44] [INFO ] Invariant cache hit.
[2023-04-07 18:14:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:44] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-04-07 18:14:44] [INFO ] Invariant cache hit.
[2023-04-07 18:14:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(LEQ s12 s2), p2:(LEQ s11 s0), p0:(LEQ s10 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 68 ms.
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 12 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-08 finished in 520 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(F(p0))||(F(p0)&&F(G(p1))))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 18:14:44] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:14:44] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-07 18:14:44] [INFO ] Invariant cache hit.
[2023-04-07 18:14:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:44] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-04-07 18:14:44] [INFO ] Invariant cache hit.
[2023-04-07 18:14:44] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s1 s14), p1:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 133 reset in 95 ms.
Product exploration explored 100000 steps with 139 reset in 102 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 202 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 261 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 18:14:46] [INFO ] Invariant cache hit.
[2023-04-07 18:14:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 18:14:46] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-07 18:14:46] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 18:14:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 18:14:46] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-04-07 18:14:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-04-07 18:14:46] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-07 18:14:46] [INFO ] Added : 21 causal constraints over 5 iterations in 25 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:14:46] [INFO ] Invariant cache hit.
[2023-04-07 18:14:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 18:14:46] [INFO ] Invariant cache hit.
[2023-04-07 18:14:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:46] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-04-07 18:14:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:14:46] [INFO ] Invariant cache hit.
[2023-04-07 18:14:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 234 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 432 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=216 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 450 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 18:14:47] [INFO ] Invariant cache hit.
[2023-04-07 18:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 18:14:47] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-04-07 18:14:47] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 18:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 18:14:47] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-04-07 18:14:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:47] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-04-07 18:14:47] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-07 18:14:47] [INFO ] Added : 21 causal constraints over 5 iterations in 60 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 396 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 346 reset in 104 ms.
Product exploration explored 100000 steps with 240 reset in 151 ms.
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:14:48] [INFO ] Invariant cache hit.
[2023-04-07 18:14:48] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-04-07 18:14:48] [INFO ] Invariant cache hit.
[2023-04-07 18:14:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:48] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-04-07 18:14:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:14:48] [INFO ] Invariant cache hit.
[2023-04-07 18:14:48] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 32/32 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-10 finished in 4125 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((G(p1)||p0)))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 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 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:14:48] [INFO ] Invariant cache hit.
[2023-04-07 18:14:49] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-04-07 18:14:49] [INFO ] Invariant cache hit.
[2023-04-07 18:14:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:49] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-04-07 18:14:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:14:49] [INFO ] Invariant cache hit.
[2023-04-07 18:14:49] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-12 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 p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(GT 3 s17), p0:(OR (LEQ s5 s24) (LEQ s15 s28))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 118 ms.
Product exploration explored 100000 steps with 0 reset in 137 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 127 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10037 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3345 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2023-04-07 18:14:49] [INFO ] Invariant cache hit.
[2023-04-07 18:14:49] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 18:14:49] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 18:14:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:49] [INFO ] After 7ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 18:14:49] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-07 18:14:49] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (complete) has 50 edges and 32 vertex of which 24 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 24 transition count 21
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 20 transition count 21
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 20 transition count 17
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 21 place count 16 transition count 17
Applied a total of 21 rules in 3 ms. Remains 16 /32 variables (removed 16) and now considering 17/33 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 16/32 places, 17/33 transitions.
Incomplete random walk after 10033 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1254 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 2784313 steps, run timeout after 3001 ms. (steps per millisecond=927 ) properties seen :{}
Probabilistic random walk after 2784313 steps, saw 576205 distinct states, run finished after 3001 ms. (steps per millisecond=927 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 17 rows 16 cols
[2023-04-07 18:14:52] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:14:52] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 18:14:53] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 18:14:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:14:53] [INFO ] After 4ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 18:14:53] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 18:14:53] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 17/17 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 16/16 places, 17/17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 17/17 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-04-07 18:14:53] [INFO ] Invariant cache hit.
[2023-04-07 18:14:53] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 18:14:53] [INFO ] Invariant cache hit.
[2023-04-07 18:14:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:14:53] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-04-07 18:14:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:14:53] [INFO ] Invariant cache hit.
[2023-04-07 18:14:53] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 16/16 places, 17/17 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 16
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 14 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 14 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 13 transition count 14
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 9 place count 13 transition count 11
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 12 place count 10 transition count 11
Applied a total of 12 rules in 6 ms. Remains 10 /16 variables (removed 6) and now considering 11/17 (removed 6) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 10 cols
[2023-04-07 18:14:53] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 18:14:53] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 18:14:53] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 18:14:53] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-04-07 18:14:53] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 11 factoid took 335 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 9 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 18:14:53] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:14:53] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-04-07 18:14:53] [INFO ] Invariant cache hit.
[2023-04-07 18:14:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:53] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-04-07 18:14:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:14:53] [INFO ] Invariant cache hit.
[2023-04-07 18:14:53] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 112 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10046 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1116 ) 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2023-04-07 18:14:54] [INFO ] Invariant cache hit.
[2023-04-07 18:14:54] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 18:14:54] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 18:14:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:54] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 18:14:54] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 18:14:54] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (complete) has 50 edges and 32 vertex of which 24 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 24 transition count 21
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 20 transition count 21
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 20 transition count 17
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 21 place count 16 transition count 17
Applied a total of 21 rules in 9 ms. Remains 16 /32 variables (removed 16) and now considering 17/33 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 16/32 places, 17/33 transitions.
Incomplete random walk after 10030 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=2006 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1867628 steps, run timeout after 3001 ms. (steps per millisecond=622 ) properties seen :{}
Probabilistic random walk after 1867628 steps, saw 389463 distinct states, run finished after 3001 ms. (steps per millisecond=622 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 17 rows 16 cols
[2023-04-07 18:14:57] [INFO ] Computed 0 invariants in 7 ms
[2023-04-07 18:14:57] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 18:14:57] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 18:14:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:14:57] [INFO ] After 3ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 18:14:57] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-07 18:14:57] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 17/17 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 16/16 places, 17/17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 17/17 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-04-07 18:14:57] [INFO ] Invariant cache hit.
[2023-04-07 18:14:57] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 18:14:57] [INFO ] Invariant cache hit.
[2023-04-07 18:14:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:14:57] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-07 18:14:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:14:57] [INFO ] Invariant cache hit.
[2023-04-07 18:14:57] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 16/16 places, 17/17 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 16
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 14 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 14 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 13 transition count 14
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 9 place count 13 transition count 11
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 12 place count 10 transition count 11
Applied a total of 12 rules in 2 ms. Remains 10 /16 variables (removed 6) and now considering 11/17 (removed 6) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 10 cols
[2023-04-07 18:14:57] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 18:14:57] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 18:14:57] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 18:14:57] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-07 18:14:57] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 11 factoid took 179 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 111 ms.
Product exploration explored 100000 steps with 0 reset in 150 ms.
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 18:14:58] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 18:14:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 18:14:58] [INFO ] Invariant cache hit.
[2023-04-07 18:14:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:58] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-04-07 18:14:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:14:58] [INFO ] Invariant cache hit.
[2023-04-07 18:14:58] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 32/32 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-12 finished in 9454 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 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:14:58] [INFO ] Invariant cache hit.
[2023-04-07 18:14:58] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 18:14:58] [INFO ] Invariant cache hit.
[2023-04-07 18:14:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:58] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-07 18:14:58] [INFO ] Invariant cache hit.
[2023-04-07 18:14:58] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 2 s6) (LEQ s9 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 50000 reset in 61 ms.
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 9 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-13 finished in 381 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(G(p1))) U X(X(G(p2)))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:14:58] [INFO ] Invariant cache hit.
[2023-04-07 18:14:58] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-04-07 18:14:58] [INFO ] Invariant cache hit.
[2023-04-07 18:14:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:58] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-04-07 18:14:58] [INFO ] Invariant cache hit.
[2023-04-07 18:14:58] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 1}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p2:(GT s17 s21), p0:(OR (LEQ s17 s21) (LEQ 1 s2)), p1:(LEQ s24 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 0 reset in 89 ms.
Product exploration explored 100000 steps with 0 reset in 135 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 218 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Incomplete random walk after 10034 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1433 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-04-07 18:14:59] [INFO ] Invariant cache hit.
[2023-04-07 18:14:59] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 18:14:59] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 18:14:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:14:59] [INFO ] After 15ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 18:14:59] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-04-07 18:14:59] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 33/33 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 32 transition count 32
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 10 place count 32 transition count 23
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 23 transition count 23
Applied a total of 19 rules in 9 ms. Remains 23 /32 variables (removed 9) and now considering 23/33 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 23/32 places, 23/33 transitions.
Incomplete random walk after 10033 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=627 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Finished probabilistic random walk after 24327 steps, run visited all 4 properties in 94 ms. (steps per millisecond=258 )
Probabilistic random walk after 24327 steps, saw 7624 distinct states, run finished after 94 ms. (steps per millisecond=258 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (AND p0 p2)), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 879 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
[2023-04-07 18:15:01] [INFO ] Invariant cache hit.
[2023-04-07 18:15:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 18:15:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-07 18:15:01] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 18:15:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 18:15:01] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-07 18:15:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:01] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (AND p0 p2)), (F (NOT p0)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 11 factoid took 581 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-14 finished in 3630 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 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:15:02] [INFO ] Invariant cache hit.
[2023-04-07 18:15:02] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 18:15:02] [INFO ] Invariant cache hit.
[2023-04-07 18:15:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:02] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-04-07 18:15:02] [INFO ] Invariant cache hit.
[2023-04-07 18:15:02] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-15 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 s14 s23)], 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 99 ms.
Stack based approach found an accepted trace after 10003 steps with 0 reset with depth 10004 and stack size 10004 in 10 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-15 finished in 280 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)))'
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) U G(!p1)) U (F(G(p2))||(F(!p1)&&X(!p0)))))'
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(F(p0))||(F(p0)&&F(G(p1))))))'
Found a Shortening insensitive property : CryptoMiner-PT-D10N100-LTLCardinality-10
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:15:03] [INFO ] Invariant cache hit.
[2023-04-07 18:15:03] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-04-07 18:15:03] [INFO ] Invariant cache hit.
[2023-04-07 18:15:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:03] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-04-07 18:15:03] [INFO ] Invariant cache hit.
[2023-04-07 18:15:03] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 140 ms. Remains : 32/33 places, 33/33 transitions.
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s1 s14), p1:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 145 reset in 87 ms.
Product exploration explored 100000 steps with 282 reset in 110 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 300 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 202 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=202 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 241 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 18:15:04] [INFO ] Invariant cache hit.
[2023-04-07 18:15:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 18:15:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-07 18:15:04] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 18:15:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 18:15:04] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-07 18:15:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-04-07 18:15:04] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 18:15:04] [INFO ] Added : 21 causal constraints over 5 iterations in 22 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:15:04] [INFO ] Invariant cache hit.
[2023-04-07 18:15:04] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 18:15:04] [INFO ] Invariant cache hit.
[2023-04-07 18:15:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:04] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-04-07 18:15:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:15:04] [INFO ] Invariant cache hit.
[2023-04-07 18:15:04] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 414 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 202 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=202 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 552 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 18:15:06] [INFO ] Invariant cache hit.
[2023-04-07 18:15:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 18:15:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-07 18:15:06] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 18:15:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 18:15:06] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-07 18:15:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 12 ms returned sat
[2023-04-07 18:15:06] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 18:15:06] [INFO ] Added : 21 causal constraints over 5 iterations in 31 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 307 reset in 86 ms.
Product exploration explored 100000 steps with 270 reset in 104 ms.
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:15:06] [INFO ] Invariant cache hit.
[2023-04-07 18:15:06] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 18:15:06] [INFO ] Invariant cache hit.
[2023-04-07 18:15:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:06] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 18:15:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:15:06] [INFO ] Invariant cache hit.
[2023-04-07 18:15:06] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 32/32 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-10 finished in 3926 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((G(p1)||p0)))'
[2023-04-07 18:15:06] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:15:06] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-07 18:15:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 33 transitions and 97 arcs took 0 ms.
Total runtime 38055 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2009/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2009/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2009/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2009/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CryptoMiner-PT-D10N100-LTLCardinality-02
Could not compute solution for formula : CryptoMiner-PT-D10N100-LTLCardinality-06
Could not compute solution for formula : CryptoMiner-PT-D10N100-LTLCardinality-10
Could not compute solution for formula : CryptoMiner-PT-D10N100-LTLCardinality-12

BK_STOP 1680891308347

--------------------
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
mcc2023
ltl formula name CryptoMiner-PT-D10N100-LTLCardinality-02
ltl formula formula --ltl=/tmp/2009/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 33 places, 33 transitions and 97 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2009/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2009/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2009/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2009/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name CryptoMiner-PT-D10N100-LTLCardinality-06
ltl formula formula --ltl=/tmp/2009/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 33 places, 33 transitions and 97 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2009/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2009/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2009/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2009/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name CryptoMiner-PT-D10N100-LTLCardinality-10
ltl formula formula --ltl=/tmp/2009/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 33 places, 33 transitions and 97 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2009/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2009/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2009/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2009/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name CryptoMiner-PT-D10N100-LTLCardinality-12
ltl formula formula --ltl=/tmp/2009/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 33 places, 33 transitions and 97 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2009/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2009/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2009/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2009/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CryptoMiner-PT-D10N100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-PT-D10N100.tgz
mv CryptoMiner-PT-D10N100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;