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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 8.4K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.8K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 9.2K 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-COL-D03N000-LTLFireability-00
FORMULA_NAME CryptoMiner-COL-D03N000-LTLFireability-01
FORMULA_NAME CryptoMiner-COL-D03N000-LTLFireability-02
FORMULA_NAME CryptoMiner-COL-D03N000-LTLFireability-03
FORMULA_NAME CryptoMiner-COL-D03N000-LTLFireability-04
FORMULA_NAME CryptoMiner-COL-D03N000-LTLFireability-05
FORMULA_NAME CryptoMiner-COL-D03N000-LTLFireability-06
FORMULA_NAME CryptoMiner-COL-D03N000-LTLFireability-07
FORMULA_NAME CryptoMiner-COL-D03N000-LTLFireability-08
FORMULA_NAME CryptoMiner-COL-D03N000-LTLFireability-09
FORMULA_NAME CryptoMiner-COL-D03N000-LTLFireability-10
FORMULA_NAME CryptoMiner-COL-D03N000-LTLFireability-11
FORMULA_NAME CryptoMiner-COL-D03N000-LTLFireability-12
FORMULA_NAME CryptoMiner-COL-D03N000-LTLFireability-13
FORMULA_NAME CryptoMiner-COL-D03N000-LTLFireability-14
FORMULA_NAME CryptoMiner-COL-D03N000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680871806327

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-COL-D03N000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 12:50:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 12:50:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 12:50:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-07 12:50:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 12:50:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1058 ms
[2023-04-07 12:50:10] [INFO ] Imported 2 HL places and 4 HL transitions for a total of 8 PT places and 16.0 transition bindings in 47 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 48 ms.
Working with output stream class java.io.PrintStream
[2023-04-07 12:50:10] [INFO ] Built PT skeleton of HLPN with 2 places and 4 transitions 10 arcs in 17 ms.
[2023-04-07 12:50:10] [INFO ] Skeletonized 5 HLPN properties in 1 ms. Removed 11 properties that had guard overlaps.
Computed a total of 1 stabilizing places and 1 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Arc [1:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2023-04-07 12:50:10] [INFO ] Unfolded HLPN to a Petri net with 8 places and 8 transitions 22 arcs in 25 ms.
[2023-04-07 12:50:10] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-COL-D03N000-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N000-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 8
Applied a total of 1 rules in 9 ms. Remains 7 /8 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 7 cols
[2023-04-07 12:50:10] [INFO ] Computed 0 invariants in 2 ms
[2023-04-07 12:50:10] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-04-07 12:50:10] [INFO ] Invariant cache hit.
[2023-04-07 12:50:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:10] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-04-07 12:50:10] [INFO ] Invariant cache hit.
[2023-04-07 12:50:10] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 7/8 places, 8/8 transitions.
Support contains 4 out of 7 places after structural reductions.
[2023-04-07 12:50:11] [INFO ] Flatten gal took : 26 ms
[2023-04-07 12:50:11] [INFO ] Flatten gal took : 2 ms
[2023-04-07 12:50:11] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10000 steps, including 1435 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 795 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 12:50:11] [INFO ] Invariant cache hit.
[2023-04-07 12:50:12] [INFO ] After 373ms 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.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA CryptoMiner-COL-D03N000-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N000-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 4 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&G(p2))))'
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 3 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:12] [INFO ] Invariant cache hit.
[2023-04-07 12:50:12] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-04-07 12:50:12] [INFO ] Invariant cache hit.
[2023-04-07 12:50:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:13] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-04-07 12:50:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 12:50:13] [INFO ] Invariant cache hit.
[2023-04-07 12:50:13] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 7/7 places, 8/8 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 434 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s3 1), p0:(OR (GEQ s3 1) (LT s0 1)), p2:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA CryptoMiner-COL-D03N000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N000-LTLFireability-01 finished in 898 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)||X(p1)||(X(X(p1)) U (X(X(G(p1)))||(!p2&&X(X(p1))))))))'
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:13] [INFO ] Invariant cache hit.
[2023-04-07 12:50:13] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-04-07 12:50:13] [INFO ] Invariant cache hit.
[2023-04-07 12:50:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:13] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-04-07 12:50:13] [INFO ] Invariant cache hit.
[2023-04-07 12:50:13] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 352 ms. Remains : 7/7 places, 8/8 transitions.
Stuttering acceptance computed with spot in 527 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s0 1), p2:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1)), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33271 reset in 388 ms.
Product exploration explored 100000 steps with 33331 reset in 186 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/7 stabilizing places and 4/8 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 1157 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 451 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 1393 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 12:50:17] [INFO ] Invariant cache hit.
[2023-04-07 12:50:17] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1))), (G (NOT (AND p0 (NOT p2) p1))), (G (NOT (AND p0 p2 p1)))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 2182 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[p0]
Stuttering acceptance computed with spot in 67 ms :[p0]
[2023-04-07 12:50:19] [INFO ] Invariant cache hit.
Proved EG p0
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1))), (G (NOT (AND p0 (NOT p2) p1))), (G (NOT (AND p0 p2 p1)))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 9 factoid took 2124 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D03N000-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N000-LTLFireability-03 finished in 8228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:21] [INFO ] Invariant cache hit.
[2023-04-07 12:50:21] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-04-07 12:50:21] [INFO ] Invariant cache hit.
[2023-04-07 12:50:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:21] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-04-07 12:50:21] [INFO ] Invariant cache hit.
[2023-04-07 12:50:21] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 7/7 places, 8/8 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 18268 reset in 136 ms.
Product exploration explored 100000 steps with 18164 reset in 335 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/7 stabilizing places and 4/8 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-04-07 12:50:23] [INFO ] Invariant cache hit.
[2023-04-07 12:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 12:50:23] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-04-07 12:50:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 12:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 12:50:23] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-07 12:50:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2023-04-07 12:50:23] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 7 ms.
[2023-04-07 12:50:23] [INFO ] Added : 3 causal constraints over 1 iterations in 39 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:23] [INFO ] Invariant cache hit.
[2023-04-07 12:50:23] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-04-07 12:50:23] [INFO ] Invariant cache hit.
[2023-04-07 12:50:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:24] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-04-07 12:50:24] [INFO ] Invariant cache hit.
[2023-04-07 12:50:24] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 302 ms. Remains : 7/7 places, 8/8 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/7 stabilizing places and 4/8 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 244 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 327 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-04-07 12:50:25] [INFO ] Invariant cache hit.
[2023-04-07 12:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 12:50:25] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-04-07 12:50:25] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 12:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 12:50:25] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-04-07 12:50:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:25] [INFO ] [Nat]Added 3 Read/Feed constraints in 9 ms returned sat
[2023-04-07 12:50:25] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 5 ms.
[2023-04-07 12:50:25] [INFO ] Added : 3 causal constraints over 1 iterations in 45 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18284 reset in 58 ms.
Product exploration explored 100000 steps with 18271 reset in 57 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 12:50:26] [INFO ] Invariant cache hit.
[2023-04-07 12:50:26] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 7/7 places, 8/8 transitions.
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:26] [INFO ] Invariant cache hit.
[2023-04-07 12:50:26] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-04-07 12:50:26] [INFO ] Invariant cache hit.
[2023-04-07 12:50:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:26] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-04-07 12:50:26] [INFO ] Invariant cache hit.
[2023-04-07 12:50:26] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 7/7 places, 8/8 transitions.
Treatment of property CryptoMiner-COL-D03N000-LTLFireability-04 finished in 5161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:26] [INFO ] Invariant cache hit.
[2023-04-07 12:50:27] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-04-07 12:50:27] [INFO ] Invariant cache hit.
[2023-04-07 12:50:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:27] [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 12:50:27] [INFO ] Invariant cache hit.
[2023-04-07 12:50:27] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 490 ms. Remains : 7/7 places, 8/8 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLFireability-06 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))], 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 80 ms.
Product exploration explored 100000 steps with 50000 reset in 42 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/7 stabilizing places and 4/8 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 77 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-COL-D03N000-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N000-LTLFireability-06 finished in 894 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)&&F(!p0)&&F((G(!p1)||G(!p2))))))'
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:27] [INFO ] Invariant cache hit.
[2023-04-07 12:50:27] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-04-07 12:50:27] [INFO ] Invariant cache hit.
[2023-04-07 12:50:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:28] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-04-07 12:50:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 12:50:28] [INFO ] Invariant cache hit.
[2023-04-07 12:50:28] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 7/7 places, 8/8 transitions.
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p0), p0, (AND p1 p2)]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(OR p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={1} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1)), p1:(GEQ s0 1), p2:(GEQ s3 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 24 steps with 4 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N000-LTLFireability-07 finished in 472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(((p1&&X(F(p1)))||(p1&&G(p0)))))))))'
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:28] [INFO ] Invariant cache hit.
[2023-04-07 12:50:28] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-04-07 12:50:28] [INFO ] Invariant cache hit.
[2023-04-07 12:50:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:28] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-04-07 12:50:28] [INFO ] Invariant cache hit.
[2023-04-07 12:50:28] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 368 ms. Remains : 7/7 places, 8/8 transitions.
Stuttering acceptance computed with spot in 398 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s3 1), p1:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N000-LTLFireability-08 finished in 804 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 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:29] [INFO ] Invariant cache hit.
[2023-04-07 12:50:29] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-04-07 12:50:29] [INFO ] Invariant cache hit.
[2023-04-07 12:50:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:29] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-04-07 12:50:29] [INFO ] Invariant cache hit.
[2023-04-07 12:50:29] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 385 ms. Remains : 7/7 places, 8/8 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, p0, p0]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N000-LTLFireability-09 finished in 568 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(X(!p0))))'
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:29] [INFO ] Invariant cache hit.
[2023-04-07 12:50:29] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 12:50:29] [INFO ] Invariant cache hit.
[2023-04-07 12:50:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:29] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-07 12:50:29] [INFO ] Invariant cache hit.
[2023-04-07 12:50:29] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 7/7 places, 8/8 transitions.
Stuttering acceptance computed with spot in 368 ms :[p0, p0, p0, p0, true]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 5 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N000-LTLFireability-10 finished in 482 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((F(!p1)&&p0)))'
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:30] [INFO ] Invariant cache hit.
[2023-04-07 12:50:30] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-04-07 12:50:30] [INFO ] Invariant cache hit.
[2023-04-07 12:50:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:30] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-04-07 12:50:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 12:50:30] [INFO ] Invariant cache hit.
[2023-04-07 12:50:30] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 7/7 places, 8/8 transitions.
Stuttering acceptance computed with spot in 198 ms :[p1, (OR (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(GEQ s3 1), p0:(AND (LT s0 1) (LT s1 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15305 reset in 223 ms.
Product exploration explored 100000 steps with 15269 reset in 212 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/7 stabilizing places and 4/8 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 394 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[p1, (OR (NOT p0) p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 665 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 113 ms :[p1, (OR (NOT p0) p1)]
[2023-04-07 12:50:32] [INFO ] Invariant cache hit.
[2023-04-07 12:50:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 12:50:32] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-07 12:50:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 12:50:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 12:50:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-07 12:50:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:32] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-07 12:50:32] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 12:50:32] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:32] [INFO ] Invariant cache hit.
[2023-04-07 12:50:32] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-04-07 12:50:32] [INFO ] Invariant cache hit.
[2023-04-07 12:50:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:32] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-04-07 12:50:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 12:50:32] [INFO ] Invariant cache hit.
[2023-04-07 12:50:32] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 7/7 places, 8/8 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/7 stabilizing places and 4/8 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 258 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[p1, (OR (NOT p0) p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 572 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 114 ms :[p1, (OR (NOT p0) p1)]
[2023-04-07 12:50:34] [INFO ] Invariant cache hit.
[2023-04-07 12:50:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 12:50:34] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-07 12:50:34] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 12:50:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 12:50:34] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-04-07 12:50:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-07 12:50:34] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-07 12:50:34] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 86 ms :[p1, (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 15319 reset in 106 ms.
Product exploration explored 100000 steps with 15329 reset in 105 ms.
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:34] [INFO ] Invariant cache hit.
[2023-04-07 12:50:34] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-04-07 12:50:34] [INFO ] Invariant cache hit.
[2023-04-07 12:50:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:34] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-04-07 12:50:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 12:50:34] [INFO ] Invariant cache hit.
[2023-04-07 12:50:34] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 7/7 places, 8/8 transitions.
Treatment of property CryptoMiner-COL-D03N000-LTLFireability-11 finished in 4735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:34] [INFO ] Invariant cache hit.
[2023-04-07 12:50:34] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 12:50:34] [INFO ] Invariant cache hit.
[2023-04-07 12:50:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:34] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-04-07 12:50:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 12:50:34] [INFO ] Invariant cache hit.
[2023-04-07 12:50:34] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 7/7 places, 8/8 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s3 1) (OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N000-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N000-LTLFireability-12 finished in 117 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 p1)&&X((G(p1) U X(!p2)))))'
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:35] [INFO ] Invariant cache hit.
[2023-04-07 12:50:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-04-07 12:50:35] [INFO ] Invariant cache hit.
[2023-04-07 12:50:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:35] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 12:50:35] [INFO ] Invariant cache hit.
[2023-04-07 12:50:35] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 7/7 places, 8/8 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p1) p2), true, (NOT p1), p2, p2, p2, (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=p2, acceptance={} source=4 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s0 1), p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1)), p2:(GEQ s3 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 44 ms.
Product exploration explored 100000 steps with 33333 reset in 63 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/7 stabilizing places and 4/8 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 19 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D03N000-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N000-LTLFireability-14 finished in 532 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 G((!p0||G(p0)))))'
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:35] [INFO ] Invariant cache hit.
[2023-04-07 12:50:35] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 12:50:35] [INFO ] Invariant cache hit.
[2023-04-07 12:50:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:35] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-07 12:50:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 12:50:35] [INFO ] Invariant cache hit.
[2023-04-07 12:50:35] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 7/7 places, 8/8 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), false, false]
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=3, aps=[p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N000-LTLFireability-15 finished in 183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : CryptoMiner-COL-D03N000-LTLFireability-04
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:35] [INFO ] Invariant cache hit.
[2023-04-07 12:50:35] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-04-07 12:50:35] [INFO ] Invariant cache hit.
[2023-04-07 12:50:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:36] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-04-07 12:50:36] [INFO ] Invariant cache hit.
[2023-04-07 12:50:36] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 114 ms. Remains : 7/7 places, 8/8 transitions.
Running random walk in product with property : CryptoMiner-COL-D03N000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 18255 reset in 47 ms.
Product exploration explored 100000 steps with 18283 reset in 58 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/7 stabilizing places and 4/8 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-04-07 12:50:36] [INFO ] Invariant cache hit.
[2023-04-07 12:50:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 12:50:36] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-07 12:50:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 12:50:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 12:50:36] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-07 12:50:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:36] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-04-07 12:50:36] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 7 ms.
[2023-04-07 12:50:36] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:36] [INFO ] Invariant cache hit.
[2023-04-07 12:50:36] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 12:50:36] [INFO ] Invariant cache hit.
[2023-04-07 12:50:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:36] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-04-07 12:50:36] [INFO ] Invariant cache hit.
[2023-04-07 12:50:36] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 7/7 places, 8/8 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/7 stabilizing places and 4/8 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-04-07 12:50:37] [INFO ] Invariant cache hit.
[2023-04-07 12:50:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 12:50:37] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-07 12:50:37] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 12:50:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 12:50:37] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-07 12:50:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-07 12:50:37] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 12:50:37] [INFO ] Added : 3 causal constraints over 1 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18371 reset in 53 ms.
Product exploration explored 100000 steps with 18253 reset in 58 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 12:50:37] [INFO ] Invariant cache hit.
[2023-04-07 12:50:37] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25 ms. Remains : 7/7 places, 8/8 transitions.
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-04-07 12:50:37] [INFO ] Invariant cache hit.
[2023-04-07 12:50:37] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-04-07 12:50:37] [INFO ] Invariant cache hit.
[2023-04-07 12:50:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 12:50:37] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-07 12:50:37] [INFO ] Invariant cache hit.
[2023-04-07 12:50:37] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 7/7 places, 8/8 transitions.
Treatment of property CryptoMiner-COL-D03N000-LTLFireability-04 finished in 1996 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((F(!p1)&&p0)))'
[2023-04-07 12:50:37] [INFO ] Flatten gal took : 3 ms
[2023-04-07 12:50:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 12:50:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 7 places, 8 transitions and 21 arcs took 0 ms.
Total runtime 28975 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1470/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1470/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CryptoMiner-COL-D03N000-LTLFireability-04
Could not compute solution for formula : CryptoMiner-COL-D03N000-LTLFireability-11

BK_STOP 1680871838986

--------------------
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-COL-D03N000-LTLFireability-04
ltl formula formula --ltl=/tmp/1470/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 7 places, 8 transitions and 21 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1470/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1470/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1470/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1470/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CryptoMiner-COL-D03N000-LTLFireability-11
ltl formula formula --ltl=/tmp/1470/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7 places, 8 transitions and 21 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
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1470/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1470/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1470/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1470/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CryptoMiner-COL-D03N000"
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-COL-D03N000, 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-167987246200076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-COL-D03N000.tgz
mv CryptoMiner-COL-D03N000 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 ;