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-167987246400212.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-D20N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 24K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 28K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 29K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 27K Mar 31 16:48 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1680891778965

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D20N100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 18:23:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 18:23:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:23:01] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-04-07 18:23:01] [INFO ] Transformed 63 places.
[2023-04-07 18:23:01] [INFO ] Transformed 63 transitions.
[2023-04-07 18:23:01] [INFO ] Parsed PT model containing 63 places and 63 transitions and 187 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 11 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 18:23:01] [INFO ] Computed 0 invariants in 7 ms
[2023-04-07 18:23:01] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-04-07 18:23:01] [INFO ] Invariant cache hit.
[2023-04-07 18:23:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:01] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-04-07 18:23:01] [INFO ] Invariant cache hit.
[2023-04-07 18:23:01] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 482 ms. Remains : 62/63 places, 63/63 transitions.
Support contains 42 out of 62 places after structural reductions.
[2023-04-07 18:23:02] [INFO ] Flatten gal took : 21 ms
[2023-04-07 18:23:02] [INFO ] Flatten gal took : 12 ms
[2023-04-07 18:23:02] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10007 steps, including 4 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 18) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) 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 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 18:23:02] [INFO ] Invariant cache hit.
[2023-04-07 18:23:02] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-04-07 18:23:02] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:03] [INFO ] Invariant cache hit.
[2023-04-07 18:23:03] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-04-07 18:23:03] [INFO ] Invariant cache hit.
[2023-04-07 18:23:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:03] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-04-07 18:23:03] [INFO ] Invariant cache hit.
[2023-04-07 18:23:03] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 359 ms. Remains : 62/62 places, 63/63 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s41 1)), p1:(LT s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-01 finished in 674 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 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 8 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:03] [INFO ] Invariant cache hit.
[2023-04-07 18:23:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-04-07 18:23:03] [INFO ] Invariant cache hit.
[2023-04-07 18:23:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:04] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-04-07 18:23:04] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 18:23:04] [INFO ] Invariant cache hit.
[2023-04-07 18:23:04] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 98 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 339 ms.
Product exploration explored 100000 steps with 0 reset in 373 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.8 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[p0, p0]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[p0, p0]
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:05] [INFO ] Invariant cache hit.
[2023-04-07 18:23:05] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-04-07 18:23:05] [INFO ] Invariant cache hit.
[2023-04-07 18:23:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:05] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-04-07 18:23:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:23:05] [INFO ] Invariant cache hit.
[2023-04-07 18:23:05] [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 183 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[p0, p0]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
Product exploration explored 100000 steps with 0 reset in 150 ms.
Product exploration explored 100000 steps with 0 reset in 206 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 13 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:06] [INFO ] Invariant cache hit.
[2023-04-07 18:23:06] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 18:23:06] [INFO ] Invariant cache hit.
[2023-04-07 18:23:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:06] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-04-07 18:23:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:23:06] [INFO ] Invariant cache hit.
[2023-04-07 18:23:06] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 282 ms. Remains : 62/62 places, 63/63 transitions.
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-02 finished in 3203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 21 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:07] [INFO ] Invariant cache hit.
[2023-04-07 18:23:07] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-04-07 18:23:07] [INFO ] Invariant cache hit.
[2023-04-07 18:23:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:07] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-04-07 18:23:07] [INFO ] Invariant cache hit.
[2023-04-07 18:23:07] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 252 ms.
Product exploration explored 100000 steps with 0 reset in 221 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-04 finished in 1478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 21 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:08] [INFO ] Invariant cache hit.
[2023-04-07 18:23:08] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 18:23:08] [INFO ] Invariant cache hit.
[2023-04-07 18:23:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:08] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-04-07 18:23:08] [INFO ] Invariant cache hit.
[2023-04-07 18:23:08] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-07 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 (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Product exploration explored 100000 steps with 50000 reset in 166 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [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 18 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-D20N100-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-07 finished in 874 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(G(p0))&&F(p1))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:09] [INFO ] Invariant cache hit.
[2023-04-07 18:23:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-04-07 18:23:09] [INFO ] Invariant cache hit.
[2023-04-07 18:23:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:09] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-04-07 18:23:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:23:09] [INFO ] Invariant cache hit.
[2023-04-07 18:23:09] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s41 1)), p1:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 295 ms.
Product exploration explored 100000 steps with 0 reset in 377 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.18 ms
Computed a total of 40 stabilizing places and 41 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)))]
Knowledge based reduction with 3 factoid took 257 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 185 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 612 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=612 )
Parikh walk visited 0 properties in 0 ms.
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))), (F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 465 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 227 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-04-07 18:23:11] [INFO ] Invariant cache hit.
[2023-04-07 18:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 18:23:12] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2023-04-07 18:23:12] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 18:23:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 18:23:13] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-04-07 18:23:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:13] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2023-04-07 18:23:13] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-04-07 18:23:13] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:13] [INFO ] Invariant cache hit.
[2023-04-07 18:23:13] [INFO ] Implicit Places using invariants in 782 ms returned []
[2023-04-07 18:23:13] [INFO ] Invariant cache hit.
[2023-04-07 18:23:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:14] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
[2023-04-07 18:23:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:23:14] [INFO ] Invariant cache hit.
[2023-04-07 18:23:14] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 983 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Computed a total of 40 stabilizing places and 41 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)))]
Knowledge based reduction with 3 factoid took 209 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 232 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 612 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=612 )
Parikh walk visited 0 properties in 0 ms.
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))), (F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 381 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 173 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-04-07 18:23:15] [INFO ] Invariant cache hit.
[2023-04-07 18:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 18:23:15] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-04-07 18:23:15] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 18:23:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 18:23:15] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-04-07 18:23:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:15] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2023-04-07 18:23:15] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-07 18:23:15] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 206 ms.
Product exploration explored 100000 steps with 1 reset in 284 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:16] [INFO ] Invariant cache hit.
[2023-04-07 18:23:16] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-04-07 18:23:16] [INFO ] Invariant cache hit.
[2023-04-07 18:23:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:16] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-04-07 18:23:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:23:16] [INFO ] Invariant cache hit.
[2023-04-07 18:23:16] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 276 ms. Remains : 62/62 places, 63/63 transitions.
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-08 finished in 7222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:16] [INFO ] Invariant cache hit.
[2023-04-07 18:23:16] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-04-07 18:23:16] [INFO ] Invariant cache hit.
[2023-04-07 18:23:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:16] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-04-07 18:23:16] [INFO ] Invariant cache hit.
[2023-04-07 18:23:16] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 395 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.14 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 33 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-09 finished in 929 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 U X((!p1 U p2)))&&X(G(p3))))'
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 12 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:17] [INFO ] Invariant cache hit.
[2023-04-07 18:23:17] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-04-07 18:23:17] [INFO ] Invariant cache hit.
[2023-04-07 18:23:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:17] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-04-07 18:23:17] [INFO ] Invariant cache hit.
[2023-04-07 18:23:17] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 364 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 399 ms :[(NOT p3), (OR (NOT p3) (NOT p2)), true, (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p3), acceptance={0} source=3 dest: 0}, { cond=(NOT p3), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p3), acceptance={0} source=3 dest: 4}], [{ cond=(AND p2 p3), acceptance={0} source=4 dest: 0}, { cond=(OR (AND (NOT p2) p1) (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p3:(LT s45 1), p0:(LT s54 1), p2:(GEQ s48 1), p1:(OR (LT s0 1) (LT s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-11 finished in 779 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))||(G(F(p1))&&F(!p2))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 9 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:18] [INFO ] Invariant cache hit.
[2023-04-07 18:23:18] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-04-07 18:23:18] [INFO ] Invariant cache hit.
[2023-04-07 18:23:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:18] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-04-07 18:23:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:23:18] [INFO ] Invariant cache hit.
[2023-04-07 18:23:18] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 280 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s54 1) (LT s15 1)), p1:(GEQ s15 1), p2:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 192 ms.
Product exploration explored 100000 steps with 2 reset in 227 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND p0 (NOT p1))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (AND p0 (NOT p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 241 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 575 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2), false, false, false, false]
Incomplete random walk after 10086 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=720 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 18:23:20] [INFO ] Invariant cache hit.
[2023-04-07 18:23:20] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND p0 (NOT p1))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (AND p0 (NOT p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 12 factoid took 499 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:21] [INFO ] Invariant cache hit.
[2023-04-07 18:23:21] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-04-07 18:23:21] [INFO ] Invariant cache hit.
[2023-04-07 18:23:21] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:21] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-04-07 18:23:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:23:21] [INFO ] Invariant cache hit.
[2023-04-07 18:23:21] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 324 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p2), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 174 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 470 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Incomplete random walk after 10067 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1258 ) properties (out of 4) seen :2
Finished Best-First random walk after 1461 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=208 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 9 factoid took 603 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Product exploration explored 100000 steps with 1385 reset in 102 ms.
Product exploration explored 100000 steps with 1374 reset in 128 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:24] [INFO ] Invariant cache hit.
[2023-04-07 18:23:24] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-04-07 18:23:24] [INFO ] Invariant cache hit.
[2023-04-07 18:23:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:24] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-04-07 18:23:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:23:24] [INFO ] Invariant cache hit.
[2023-04-07 18:23:24] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 62/62 places, 63/63 transitions.
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-12 finished in 5943 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((G(p0)||(X(p1) U ((p2&&X(p1))||X(G(p1)))))))))'
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:24] [INFO ] Invariant cache hit.
[2023-04-07 18:23:24] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-04-07 18:23:24] [INFO ] Invariant cache hit.
[2023-04-07 18:23:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:24] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-04-07 18:23:24] [INFO ] Invariant cache hit.
[2023-04-07 18:23:24] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s4 1) (GEQ s0 1) (GEQ s41 1)), p2:(LT s42 1), p1:(LT s54 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19371 reset in 109 ms.
Product exploration explored 100000 steps with 19380 reset in 119 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1))))]
Knowledge based reduction with 9 factoid took 441 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10006 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-07 18:23:26] [INFO ] Invariant cache hit.
[2023-04-07 18:23:26] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-04-07 18:23:26] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (G (NOT (AND p2 (NOT p1) p0))), (G (NOT (AND (NOT p2) p1 p0))), (G (NOT (AND (NOT p2) (NOT p1) p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (F (AND p2 p1 p0)), (F (NOT (AND p2 p1 (NOT p0)))), (F (AND (NOT p2) p1 (NOT p0))), (F (AND p2 (NOT p1) (NOT p0)))]
Knowledge based reduction with 13 factoid took 1324 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 2 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:27] [INFO ] Invariant cache hit.
[2023-04-07 18:23:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-07 18:23:27] [INFO ] Invariant cache hit.
[2023-04-07 18:23:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:27] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-04-07 18:23:27] [INFO ] Invariant cache hit.
[2023-04-07 18:23:28] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Finished random walk after 1838 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=919 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 249 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 19285 reset in 67 ms.
Product exploration explored 100000 steps with 19351 reset in 74 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 38 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 3 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 6 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
[2023-04-07 18:23:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 43 rows 42 cols
[2023-04-07 18:23:29] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:23:29] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/62 places, 43/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 42/62 places, 43/63 transitions.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 18:23:29] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:23:29] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-07 18:23:29] [INFO ] Invariant cache hit.
[2023-04-07 18:23:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:29] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-04-07 18:23:29] [INFO ] Invariant cache hit.
[2023-04-07 18:23:29] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 62/62 places, 63/63 transitions.
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-13 finished in 5473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(G(p2)&&p1)))))'
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:29] [INFO ] Invariant cache hit.
[2023-04-07 18:23:29] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 18:23:29] [INFO ] Invariant cache hit.
[2023-04-07 18:23:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:29] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-04-07 18:23:29] [INFO ] Invariant cache hit.
[2023-04-07 18:23:29] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (NOT p2)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 p0), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(OR (LT s0 1) (LT s41 1)), p0:(OR (GEQ s53 1) (GEQ s13 1)), p1:(AND (LT s19 1) (NOT (OR (GEQ s53 1) (GEQ s13 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 153 ms.
Product exploration explored 100000 steps with 0 reset in 174 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p1 p2 p0))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (AND p1 p2 (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 579 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 264 ms :[true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), false, false]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1006 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 18:23:31] [INFO ] Invariant cache hit.
[2023-04-07 18:23:31] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p1 p2 p0))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (AND p1 p2 (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (F p2), (F (AND (NOT p0) p1 p2)), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) (AND p1 p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))]
Property proved to be false thanks to negative knowledge :(F (AND p0 (NOT p2)))
Knowledge based reduction with 7 factoid took 807 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-15 finished in 2447 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)))'
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(G(p0))&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||(G(F(p1))&&F(!p2))))'
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((G(p0)||(X(p1) U ((p2&&X(p1))||X(G(p1)))))))))'
Found a Shortening insensitive property : CryptoMiner-PT-D20N100-LTLFireability-13
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:32] [INFO ] Invariant cache hit.
[2023-04-07 18:23:32] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-04-07 18:23:32] [INFO ] Invariant cache hit.
[2023-04-07 18:23:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:32] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-04-07 18:23:32] [INFO ] Invariant cache hit.
[2023-04-07 18:23:33] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 298 ms. Remains : 62/62 places, 63/63 transitions.
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s4 1) (GEQ s0 1) (GEQ s41 1)), p2:(LT s42 1), p1:(LT s54 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19451 reset in 106 ms.
Product exploration explored 100000 steps with 19270 reset in 136 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1))))]
Knowledge based reduction with 9 factoid took 504 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10089 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=917 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) 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 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-07 18:23:34] [INFO ] Invariant cache hit.
[2023-04-07 18:23:34] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-04-07 18:23:34] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (G (NOT (AND p2 (NOT p1) p0))), (G (NOT (AND (NOT p2) p1 p0))), (G (NOT (AND (NOT p2) (NOT p1) p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (F (AND p2 p1 p0)), (F (NOT (AND p2 p1 (NOT p0)))), (F (AND (NOT p2) p1 (NOT p0))), (F (AND p2 (NOT p1) (NOT p0)))]
Knowledge based reduction with 13 factoid took 1245 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 2 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 18:23:35] [INFO ] Invariant cache hit.
[2023-04-07 18:23:35] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-04-07 18:23:35] [INFO ] Invariant cache hit.
[2023-04-07 18:23:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:35] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-04-07 18:23:35] [INFO ] Invariant cache hit.
[2023-04-07 18:23:36] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Finished random walk after 2546 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2546 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 339 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 315 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 19279 reset in 72 ms.
Product exploration explored 100000 steps with 19368 reset in 105 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 38 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 5 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
[2023-04-07 18:23:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 43 rows 42 cols
[2023-04-07 18:23:37] [INFO ] Computed 0 invariants in 2 ms
[2023-04-07 18:23:38] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/62 places, 43/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 42/62 places, 43/63 transitions.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 18:23:38] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:23:38] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 18:23:38] [INFO ] Invariant cache hit.
[2023-04-07 18:23:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:23:38] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-04-07 18:23:38] [INFO ] Invariant cache hit.
[2023-04-07 18:23:38] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 62/62 places, 63/63 transitions.
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-13 finished in 5709 ms.
[2023-04-07 18:23:38] [INFO ] Flatten gal took : 24 ms
[2023-04-07 18:23:38] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 18:23:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 63 transitions and 186 arcs took 1 ms.
Total runtime 37154 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1956/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1956/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1956/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1956/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CryptoMiner-PT-D20N100-LTLFireability-02
Could not compute solution for formula : CryptoMiner-PT-D20N100-LTLFireability-08
Could not compute solution for formula : CryptoMiner-PT-D20N100-LTLFireability-12
Could not compute solution for formula : CryptoMiner-PT-D20N100-LTLFireability-13

BK_STOP 1680891820083

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name CryptoMiner-PT-D20N100-LTLFireability-02
ltl formula formula --ltl=/tmp/1956/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 62 places, 63 transitions and 186 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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/1956/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1956/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1956/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1956/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CryptoMiner-PT-D20N100-LTLFireability-08
ltl formula formula --ltl=/tmp/1956/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: =============================================================================
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 62 places, 63 transitions and 186 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1956/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1956/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1956/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1956/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CryptoMiner-PT-D20N100-LTLFireability-12
ltl formula formula --ltl=/tmp/1956/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 62 places, 63 transitions and 186 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.030 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1956/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1956/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1956/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1956/ltl_2_
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:
0: pnml2lts-mc(+0xa23f4) [0x5574aa12a3f4]
1: pnml2lts-mc(+0xa2496) [0x5574aa12a496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f8c63d6f140]
3: pnml2lts-mc(+0x405be5) [0x5574aa48dbe5]
4: pnml2lts-mc(+0x16b3f9) [0x5574aa1f33f9]
5: pnml2lts-mc(+0x164ac4) [0x5574aa1ecac4]
6: pnml2lts-mc(+0x272e0a) [0x5574aa2fae0a]
7: pnml2lts-mc(+0xb61f0) [0x5574aa13e1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f8c63bc24d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f8c63bc267a]
10: pnml2lts-mc(+0xa1581) [0x5574aa129581]
11: pnml2lts-mc(+0xa1910) [0x5574aa129910]
12: pnml2lts-mc(+0xa32a2) [0x5574aa12b2a2]
13: pnml2lts-mc(+0xa50f4) [0x5574aa12d0f4]
14: pnml2lts-mc(+0xa516b) [0x5574aa12d16b]
15: pnml2lts-mc(+0x3f34b3) [0x5574aa47b4b3]
16: pnml2lts-mc(+0x7c63d) [0x5574aa10463d]
17: pnml2lts-mc(+0x67d86) [0x5574aa0efd86]
18: pnml2lts-mc(+0x60a8a) [0x5574aa0e8a8a]
19: pnml2lts-mc(+0x5eb15) [0x5574aa0e6b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f8c63baad0a]
21: pnml2lts-mc(+0x6075e) [0x5574aa0e875e]
ltl formula name CryptoMiner-PT-D20N100-LTLFireability-13
ltl formula formula --ltl=/tmp/1956/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: =============================================================================
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 62 places, 63 transitions and 186 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.030 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1956/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1956/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1956/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1956/ltl_3_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CryptoMiner-PT-D20N100"
export BK_EXAMINATION="LTLFireability"
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-D20N100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r521-tall-167987246400212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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