fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r521-tall-167987246200091
Last Updated
May 14, 2023

About the Execution of LTSMin+red for CryptoMiner-COL-D03N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
483.012 27930.00 54718.00 742.90 FFTTFF?FFTTFFFF? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r521-tall-167987246200091.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-D03N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246200091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 7.5K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 23 15:24 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 13K 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-D03N100-LTLCardinality-00
FORMULA_NAME CryptoMiner-COL-D03N100-LTLCardinality-01
FORMULA_NAME CryptoMiner-COL-D03N100-LTLCardinality-02
FORMULA_NAME CryptoMiner-COL-D03N100-LTLCardinality-03
FORMULA_NAME CryptoMiner-COL-D03N100-LTLCardinality-04
FORMULA_NAME CryptoMiner-COL-D03N100-LTLCardinality-05
FORMULA_NAME CryptoMiner-COL-D03N100-LTLCardinality-06
FORMULA_NAME CryptoMiner-COL-D03N100-LTLCardinality-07
FORMULA_NAME CryptoMiner-COL-D03N100-LTLCardinality-08
FORMULA_NAME CryptoMiner-COL-D03N100-LTLCardinality-09
FORMULA_NAME CryptoMiner-COL-D03N100-LTLCardinality-10
FORMULA_NAME CryptoMiner-COL-D03N100-LTLCardinality-11
FORMULA_NAME CryptoMiner-COL-D03N100-LTLCardinality-12
FORMULA_NAME CryptoMiner-COL-D03N100-LTLCardinality-13
FORMULA_NAME CryptoMiner-COL-D03N100-LTLCardinality-14
FORMULA_NAME CryptoMiner-COL-D03N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680875046257

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D03N100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 13:44:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 13:44:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 13:44:10] [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 13:44:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 13:44:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 822 ms
[2023-04-07 13:44:11] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 12 PT places and 20.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
[2023-04-07 13:44:11] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 10 ms.
[2023-04-07 13:44:11] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-COL-D03N100-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N100-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 3 stabilizing places and 3 stable transitions
Incomplete random walk after 10090 steps, including 197 resets, run finished after 155 ms. (steps per millisecond=65 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 13:44:11] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2023-04-07 13:44:11] [INFO ] Computed 0 invariants in 2 ms
[2023-04-07 13:44:12] [INFO ] After 171ms 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.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-04-07 13:44:12] [INFO ] Flatten gal took : 30 ms
[2023-04-07 13:44:12] [INFO ] Flatten gal took : 1 ms
Arc [0:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2023-04-07 13:44:12] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 34 arcs in 3 ms.
[2023-04-07 13:44:12] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 11 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 13:44:12] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 13:44:12] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-04-07 13:44:12] [INFO ] Invariant cache hit.
[2023-04-07 13:44:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:12] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-04-07 13:44:12] [INFO ] Invariant cache hit.
[2023-04-07 13:44:12] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-04-07 13:44:12] [INFO ] Flatten gal took : 23 ms
[2023-04-07 13:44:12] [INFO ] Flatten gal took : 2 ms
[2023-04-07 13:44:12] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10017 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :4
Running SMT prover for 1 properties.
[2023-04-07 13:44:13] [INFO ] Invariant cache hit.
[2023-04-07 13:44:13] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2023-04-07 13:44:13] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 13:44:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 32 ms returned sat
[2023-04-07 13:44:13] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 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 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 11 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 13:44:14] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 13:44:14] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-04-07 13:44:14] [INFO ] Invariant cache hit.
[2023-04-07 13:44:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:14] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-04-07 13:44:14] [INFO ] Invariant cache hit.
[2023-04-07 13:44:14] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 11/12 places, 12/12 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 544 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLCardinality-01 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:(GT 1 (ADD s4 s5 s6 s7))], 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 6881 reset in 380 ms.
Stack based approach found an accepted trace after 97 steps with 6 reset with depth 23 and stack size 23 in 5 ms.
FORMULA CryptoMiner-COL-D03N100-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLCardinality-01 finished in 1199 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 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 13:44:15] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 13:44:15] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 13:44:15] [INFO ] Invariant cache hit.
[2023-04-07 13:44:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:15] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 13:44:15] [INFO ] Invariant cache hit.
[2023-04-07 13:44:15] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ (ADD s8 s9 s10 s11) (ADD s0 s1 s2 s3)) (LEQ 3 (ADD s4 s5 s6 s7)))], 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 105 ms.
Product exploration explored 100000 steps with 50000 reset in 271 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 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 28 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-D03N100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N100-LTLCardinality-03 finished in 573 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(p1)&&p0) U (!p2 U (G(!p2)||(!p2&&(p3||G(!p1)))))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:44:16] [INFO ] Invariant cache hit.
[2023-04-07 13:44:16] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-04-07 13:44:16] [INFO ] Invariant cache hit.
[2023-04-07 13:44:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:16] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-04-07 13:44:16] [INFO ] Invariant cache hit.
[2023-04-07 13:44:16] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 571 ms :[p2, true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), p2, (AND p1 p2), false, (AND p1 p2), (AND p0 (NOT p1) p2), p1, false]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p0)), acceptance={} source=2 dest: 1}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={0} source=6 dest: 0}, { cond=(AND p1 p2 p0), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p1) p2 p0), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=7 dest: 4}], [{ cond=p1, acceptance={} source=8 dest: 1}, { cond=(NOT p1), acceptance={} source=8 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p0)), acceptance={} source=9 dest: 8}]], initial=0, aps=[p3:(GT (ADD s0 s1 s2 s3) (ADD s8 s9 s10 s11)), p1:(LEQ 2 (ADD s0 s1 s2 s3)), p2:(LEQ (ADD s8 s9 s10 s11) (ADD s0 s1 s2 s3)), p0:(AND (LEQ (ADD s8 s9 s10 s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33406 reset in 571 ms.
Stack based approach found an accepted trace after 332 steps with 108 reset with depth 4 and stack size 4 in 1 ms.
FORMULA CryptoMiner-COL-D03N100-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLCardinality-04 finished in 1302 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 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:44:17] [INFO ] Invariant cache hit.
[2023-04-07 13:44:17] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-04-07 13:44:17] [INFO ] Invariant cache hit.
[2023-04-07 13:44:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:17] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-04-07 13:44:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:44:17] [INFO ] Invariant cache hit.
[2023-04-07 13:44:17] [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 255 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s8 s9 s10 s11) (ADD s0 s1 s2 s3)), p1:(OR (LEQ (ADD s8 s9 s10 s11) (ADD s0 s1 s2 s3)) (AND (LEQ (ADD s8 s9 s10 s11) (ADD s0 s1 s2 s3)) (GT (A...], 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 120 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLCardinality-05 finished in 609 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 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (complete) has 29 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 13:44:18] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 13:44:18] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-04-07 13:44:18] [INFO ] Invariant cache hit.
[2023-04-07 13:44:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:18] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-04-07 13:44:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:44:18] [INFO ] Invariant cache hit.
[2023-04-07 13:44:18] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Product exploration explored 100000 steps with 0 reset in 239 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0)]
Incomplete random walk after 10017 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5008 ) properties (out of 1) seen :0
Finished Best-First random walk after 396 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=396 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Support contains 8 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:44:19] [INFO ] Invariant cache hit.
[2023-04-07 13:44:19] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-04-07 13:44:19] [INFO ] Invariant cache hit.
[2023-04-07 13:44:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:19] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-04-07 13:44:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:44:19] [INFO ] Invariant cache hit.
[2023-04-07 13:44:19] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Incomplete random walk after 10017 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2504 ) properties (out of 1) seen :0
Finished Best-First random walk after 396 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=396 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 107 ms.
Product exploration explored 100000 steps with 0 reset in 86 ms.
Support contains 8 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 16 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:44:20] [INFO ] Invariant cache hit.
[2023-04-07 13:44:20] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-04-07 13:44:20] [INFO ] Invariant cache hit.
[2023-04-07 13:44:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:20] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-04-07 13:44:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:44:20] [INFO ] Invariant cache hit.
[2023-04-07 13:44:20] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 11/11 places, 12/12 transitions.
Treatment of property CryptoMiner-COL-D03N100-LTLCardinality-06 finished in 2310 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) U G((!p1&&X(!p0))))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 12 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 13:44:20] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 13:44:20] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-04-07 13:44:20] [INFO ] Invariant cache hit.
[2023-04-07 13:44:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:20] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-04-07 13:44:20] [INFO ] Invariant cache hit.
[2023-04-07 13:44:20] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), p0]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s8 s9 s10 s11) (ADD s0 s1 s2 s3)), p0:(LEQ 3 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 138 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLCardinality-07 finished in 484 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 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (complete) has 29 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 13:44:21] [INFO ] Computed 0 invariants in 2 ms
[2023-04-07 13:44:21] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-04-07 13:44:21] [INFO ] Invariant cache hit.
[2023-04-07 13:44:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:21] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-04-07 13:44:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:44:21] [INFO ] Invariant cache hit.
[2023-04-07 13:44:21] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 90 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLCardinality-08 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:(GT (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7))], 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 85 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLCardinality-08 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((G(!p1) U p2))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 13:44:21] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 13:44:21] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-04-07 13:44:21] [INFO ] Invariant cache hit.
[2023-04-07 13:44:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:21] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-04-07 13:44:21] [INFO ] Invariant cache hit.
[2023-04-07 13:44:21] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p2), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s8 s9 s10 s11) (ADD s4 s5 s6 s7)), p2:(LEQ (ADD s8 s9 s10 s11) (ADD s0 s1 s2 s3)), p1:(GT (ADD s0 s1 s2 s3) (ADD s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 75 ms.
Product exploration explored 100000 steps with 50000 reset in 69 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.11 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 24 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D03N100-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N100-LTLCardinality-09 finished in 660 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 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:44:22] [INFO ] Invariant cache hit.
[2023-04-07 13:44:22] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-04-07 13:44:22] [INFO ] Invariant cache hit.
[2023-04-07 13:44:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:22] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-04-07 13:44:22] [INFO ] Invariant cache hit.
[2023-04-07 13:44:22] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7)), p0:(LEQ (ADD s8 s9 s10 s11) (ADD s4 s5 s6 s7))], 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 50000 reset in 84 ms.
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 39 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D03N100-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N100-LTLCardinality-10 finished in 580 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(G(p1)) U p2))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 8 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:44:22] [INFO ] Invariant cache hit.
[2023-04-07 13:44:22] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-04-07 13:44:22] [INFO ] Invariant cache hit.
[2023-04-07 13:44:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:22] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-04-07 13:44:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:44:22] [INFO ] Invariant cache hit.
[2023-04-07 13:44:22] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s8 s9 s10 s11) (ADD s0 s1 s2 s3)), p2:(LEQ (ADD s8 s9 s10 s11) (ADD s4 s5 s6 s7)), p1:(GT 1 (ADD s0 s1 s2 s3))], 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 0 reset in 109 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLCardinality-12 finished in 548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U !p1))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:44:23] [INFO ] Invariant cache hit.
[2023-04-07 13:44:23] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-07 13:44:23] [INFO ] Invariant cache hit.
[2023-04-07 13:44:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:23] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-04-07 13:44:23] [INFO ] Invariant cache hit.
[2023-04-07 13:44:23] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 186 ms :[p1, p1, true, p1]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT 1 (ADD s4 s5 s6 s7)), p0:(AND (LEQ 2 (ADD s0 s1 s2 s3)) (LEQ 3 (ADD s8 s9 s10 s11)))], 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 28 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLCardinality-13 finished in 335 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 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:44:23] [INFO ] Invariant cache hit.
[2023-04-07 13:44:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-04-07 13:44:23] [INFO ] Invariant cache hit.
[2023-04-07 13:44:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:23] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-04-07 13:44:23] [INFO ] Invariant cache hit.
[2023-04-07 13:44:23] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLCardinality-14 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:(LEQ 3 (ADD s8 s9 s10 s11))], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLCardinality-14 finished in 314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G(p1))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:44:23] [INFO ] Invariant cache hit.
[2023-04-07 13:44:23] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-07 13:44:23] [INFO ] Invariant cache hit.
[2023-04-07 13:44:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:24] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-04-07 13:44:24] [INFO ] Invariant cache hit.
[2023-04-07 13:44:24] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 503 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s8 s9 s10 s11) (ADD s4 s5 s6 s7)), p1:(GT (ADD s0 s1 s2 s3) (ADD s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 130 ms.
Product exploration explored 100000 steps with 0 reset in 148 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 234 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 3439 steps, including 1 resets, run visited all 3 properties in 1 ms. (steps per millisecond=3439 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 301 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:44:25] [INFO ] Invariant cache hit.
[2023-04-07 13:44:25] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-04-07 13:44:26] [INFO ] Invariant cache hit.
[2023-04-07 13:44:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:26] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-04-07 13:44:26] [INFO ] Invariant cache hit.
[2023-04-07 13:44:26] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 12/12 places, 12/12 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 246 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 338 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 143 ms.
Product exploration explored 100000 steps with 0 reset in 136 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:44:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:44:27] [INFO ] Invariant cache hit.
[2023-04-07 13:44:28] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:44:28] [INFO ] Invariant cache hit.
[2023-04-07 13:44:28] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-04-07 13:44:28] [INFO ] Invariant cache hit.
[2023-04-07 13:44:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:28] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-04-07 13:44:28] [INFO ] Invariant cache hit.
[2023-04-07 13:44:28] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 12/12 places, 12/12 transitions.
Treatment of property CryptoMiner-COL-D03N100-LTLCardinality-15 finished in 4302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G(p1))))'
Found a Lengthening insensitive property : CryptoMiner-COL-D03N100-LTLCardinality-15
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:44:28] [INFO ] Invariant cache hit.
[2023-04-07 13:44:28] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 13:44:28] [INFO ] Invariant cache hit.
[2023-04-07 13:44:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:28] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-07 13:44:28] [INFO ] Invariant cache hit.
[2023-04-07 13:44:28] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 104 ms. Remains : 12/12 places, 12/12 transitions.
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s8 s9 s10 s11) (ADD s4 s5 s6 s7)), p1:(GT (ADD s0 s1 s2 s3) (ADD s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 84 ms.
Product exploration explored 100000 steps with 0 reset in 118 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 378 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3337 ) properties (out of 3) seen :0
Finished Best-First random walk after 200 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=100 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 402 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:44:30] [INFO ] Invariant cache hit.
[2023-04-07 13:44:30] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-04-07 13:44:30] [INFO ] Invariant cache hit.
[2023-04-07 13:44:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:30] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 13:44:30] [INFO ] Invariant cache hit.
[2023-04-07 13:44:30] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 12/12 places, 12/12 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 215 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 3439 steps, including 1 resets, run visited all 3 properties in 4 ms. (steps per millisecond=859 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 352 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 80 ms.
Product exploration explored 100000 steps with 1 reset in 104 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:44:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:44:32] [INFO ] Invariant cache hit.
[2023-04-07 13:44:32] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 13:44:32] [INFO ] Invariant cache hit.
[2023-04-07 13:44:32] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-04-07 13:44:32] [INFO ] Invariant cache hit.
[2023-04-07 13:44:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:44:32] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-04-07 13:44:32] [INFO ] Invariant cache hit.
[2023-04-07 13:44:32] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 12/12 places, 12/12 transitions.
Treatment of property CryptoMiner-COL-D03N100-LTLCardinality-15 finished in 4123 ms.
[2023-04-07 13:44:32] [INFO ] Flatten gal took : 2 ms
[2023-04-07 13:44:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-07 13:44:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 12 transitions and 34 arcs took 0 ms.
Total runtime 22403 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1360/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1360/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CryptoMiner-COL-D03N100-LTLCardinality-06
Could not compute solution for formula : CryptoMiner-COL-D03N100-LTLCardinality-15

BK_STOP 1680875074187

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name CryptoMiner-COL-D03N100-LTLCardinality-06
ltl formula formula --ltl=/tmp/1360/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 12 places, 12 transitions and 34 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1360/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1360/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1360/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1360/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name CryptoMiner-COL-D03N100-LTLCardinality-15
ltl formula formula --ltl=/tmp/1360/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 12 places, 12 transitions and 34 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1360/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1360/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1360/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1360/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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-D03N100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CryptoMiner-COL-D03N100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r521-tall-167987246200091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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