Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r519-tall-167987244800107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is CryptoMiner-COL-D05N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244800107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K 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 16K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Mar 23 15:23 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-D05N100-LTLCardinality-00
FORMULA_NAME CryptoMiner-COL-D05N100-LTLCardinality-01
FORMULA_NAME CryptoMiner-COL-D05N100-LTLCardinality-02
FORMULA_NAME CryptoMiner-COL-D05N100-LTLCardinality-03
FORMULA_NAME CryptoMiner-COL-D05N100-LTLCardinality-04
FORMULA_NAME CryptoMiner-COL-D05N100-LTLCardinality-05
FORMULA_NAME CryptoMiner-COL-D05N100-LTLCardinality-06
FORMULA_NAME CryptoMiner-COL-D05N100-LTLCardinality-07
FORMULA_NAME CryptoMiner-COL-D05N100-LTLCardinality-08
FORMULA_NAME CryptoMiner-COL-D05N100-LTLCardinality-09
FORMULA_NAME CryptoMiner-COL-D05N100-LTLCardinality-10
FORMULA_NAME CryptoMiner-COL-D05N100-LTLCardinality-11
FORMULA_NAME CryptoMiner-COL-D05N100-LTLCardinality-12
FORMULA_NAME CryptoMiner-COL-D05N100-LTLCardinality-13
FORMULA_NAME CryptoMiner-COL-D05N100-LTLCardinality-14
FORMULA_NAME CryptoMiner-COL-D05N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680837174779

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D05N100
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 03:12:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 03:12:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:12:56] [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 03:12:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 03:12:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 380 ms
[2023-04-07 03:12:56] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 18 PT places and 30.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-04-07 03:12:56] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 3 ms.
[2023-04-07 03:12:56] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA CryptoMiner-COL-D05N100-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N100-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N100-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N100-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 3 stabilizing places and 3 stable transitions
Incomplete random walk after 10075 steps, including 189 resets, run finished after 139 ms. (steps per millisecond=72 ) properties (out of 21) seen :17
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 03:12:57] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2023-04-07 03:12:57] [INFO ] Computed 0 invariants in 6 ms
[2023-04-07 03:12:57] [INFO ] After 105ms 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.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA CryptoMiner-COL-D05N100-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N100-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 03:12:57] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-04-07 03:12:57] [INFO ] Flatten gal took : 17 ms
FORMULA CryptoMiner-COL-D05N100-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 03:12:57] [INFO ] Flatten gal took : 1 ms
Arc [0:1*[(MOD (ADD $x 1) 6)]] contains successor/predecessor on variables of sort CD
[2023-04-07 03:12:57] [INFO ] Unfolded HLPN to a Petri net with 18 places and 18 transitions 52 arcs in 5 ms.
[2023-04-07 03:12:57] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 5 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2023-04-07 03:12:57] [INFO ] Computed 1 invariants in 2 ms
[2023-04-07 03:12:57] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-07 03:12:57] [INFO ] Invariant cache hit.
[2023-04-07 03:12:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:12:57] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-04-07 03:12:57] [INFO ] Invariant cache hit.
[2023-04-07 03:12:57] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 18/18 places, 18/18 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 03:12:57] [INFO ] Flatten gal took : 3 ms
[2023-04-07 03:12:57] [INFO ] Flatten gal took : 3 ms
[2023-04-07 03:12:57] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10019 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=589 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-04-07 03:12:57] [INFO ] Invariant cache hit.
[2023-04-07 03:12:57] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 03:12:57] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-04-07 03:12:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 03:12:57] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-04-07 03:12:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:12:57] [INFO ] After 12ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-04-07 03:12:57] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-07 03:12:57] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 18/18 transitions.
Graph (complete) has 28 edges and 18 vertex of which 17 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 4 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 17/18 places, 18/18 transitions.
Finished random walk after 6781 steps, including 2 resets, run visited all 5 properties in 5 ms. (steps per millisecond=1356 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 45 edges and 18 vertex of which 7 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1&&G(p2)&&F(p3)))))'
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:12:57] [INFO ] Invariant cache hit.
[2023-04-07 03:12:57] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 03:12:58] [INFO ] Invariant cache hit.
[2023-04-07 03:12:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:12:58] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-04-07 03:12:58] [INFO ] Invariant cache hit.
[2023-04-07 03:12:58] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 18/18 places, 18/18 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 585 ms :[true, (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D05N100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3), acceptance={0} source=1 dest: 5}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2 p3), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND p0 p1 p2 p3), acceptance={} source=4 dest: 7}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=4 dest: 8}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p2 p3), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=3, aps=[p2:(OR (LEQ 2 (ADD s12 s13 s14 s15 s16 s17)) (LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s6 s7 s8 s9 s10 s11))), p3:(LEQ 2 (ADD s12 s13 s14 s15 s16 s17)), p1:(LEQ 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CryptoMiner-COL-D05N100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D05N100-LTLCardinality-02 finished in 765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((G(F(p1)) U G(!p2)))))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 1 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 17 cols
[2023-04-07 03:12:58] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 03:12:58] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 03:12:58] [INFO ] Invariant cache hit.
[2023-04-07 03:12:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:12:58] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-07 03:12:58] [INFO ] Invariant cache hit.
[2023-04-07 03:12:58] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 17/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 149 ms :[p2, p2, (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CryptoMiner-COL-D05N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(OR (AND (LEQ (ADD s6 s7 s8 s9 s10 s11) (ADD s0 s1 s2 s3 s4 s5)) (LEQ 1 (ADD s6 s7 s8 s9 s10 s11))) (LEQ (ADD s6 s7 s8 s9 s10 s11) (ADD s0 s1 s2 s3 s4 ...], 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 394 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 1 ms.
FORMULA CryptoMiner-COL-D05N100-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D05N100-LTLCardinality-03 finished in 661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&X(p1))||((p2 U G(p1))&&G(p3)))))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2023-04-07 03:12:59] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 03:12:59] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 03:12:59] [INFO ] Invariant cache hit.
[2023-04-07 03:12:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:12:59] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-07 03:12:59] [INFO ] Invariant cache hit.
[2023-04-07 03:12:59] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CryptoMiner-COL-D05N100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p1 p3) (AND (NOT p0) p2 p3)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={1} source=0 dest: 3}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={1} source=0 dest: 4}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p3))), acceptance={0, 1} source=0 dest: 4}, { cond=(AND p0 p1 p2 p3), acceptance={1} source=0 dest: 5}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0, 1} source=0 dest: 5}, { cond=(OR (AND p0 p1 p3) (AND p0 p2 p3)), acceptance={0} source=0 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=1 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p0 p1 p2), acceptance={1} source=1 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p0 p3), acceptance={0} source=2 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p3))), acceptance={1} source=3 dest: 3}, { cond=(OR (AND p0 p1 (NOT p2)) (AND p0 p1 (NOT p3))), acceptance={1} source=3 dest: 4}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p0 p1 p2 p3), acceptance={1} source=3 dest: 5}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p0 p1 p2 p3), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={0} source=4 dest: 2}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=6 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p0 (NOT p1) p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={1} source=7 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={1} source=7 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 1} source=7 dest: 4}, { cond=(AND p0 p1 p3), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1) p3), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5)), p1:(LEQ 2 (ADD s12 s13 s14 s15 s16 s17)), p2:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5)), p3:(LEQ 3 (ADD s12 s13 s14 s15 s16 s17))...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 286 ms.
Stack based approach found an accepted trace after 326 steps with 0 reset with depth 327 and stack size 327 in 1 ms.
FORMULA CryptoMiner-COL-D05N100-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D05N100-LTLCardinality-04 finished in 793 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||G(p1)))))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:13:00] [INFO ] Invariant cache hit.
[2023-04-07 03:13:00] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 03:13:00] [INFO ] Invariant cache hit.
[2023-04-07 03:13:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:13:00] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 03:13:00] [INFO ] Invariant cache hit.
[2023-04-07 03:13:00] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-COL-D05N100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s12 s13 s14 s15 s16 s17)), p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 45 edges and 18 vertex of which 7 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D05N100-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D05N100-LTLCardinality-07 finished in 489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U p2))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:13:00] [INFO ] Invariant cache hit.
[2023-04-07 03:13:00] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 03:13:00] [INFO ] Invariant cache hit.
[2023-04-07 03:13:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:13:00] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 03:13:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:13:00] [INFO ] Invariant cache hit.
[2023-04-07 03:13:00] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p2), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D05N100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(AND (LEQ (ADD s12 s13 s14 s15 s16 s17) (ADD s0 s1 s2 s3 s4 s5)) (LEQ 1 (ADD s12 s13 s14 s15 s16 s17))), p0:(GT 1 (ADD s12 s13 s14 s15 s16 s17)), p1:(G...], nbAcceptance=0, 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 1 reset in 141 ms.
Stack based approach found an accepted trace after 49 steps with 0 reset with depth 50 and stack size 50 in 1 ms.
FORMULA CryptoMiner-COL-D05N100-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D05N100-LTLCardinality-08 finished in 373 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 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:13:01] [INFO ] Invariant cache hit.
[2023-04-07 03:13:01] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 03:13:01] [INFO ] Invariant cache hit.
[2023-04-07 03:13:01] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:13:01] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-04-07 03:13:01] [INFO ] Invariant cache hit.
[2023-04-07 03:13:01] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CryptoMiner-COL-D05N100-LTLCardinality-12 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 1 (ADD s12 s13 s14 s15 s16 s17)), p0:(LEQ 1 (ADD s6 s7 s8 s9 s10 s11))], 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 2 reset in 69 ms.
Stack based approach found an accepted trace after 91 steps with 12 reset with depth 68 and stack size 68 in 0 ms.
FORMULA CryptoMiner-COL-D05N100-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D05N100-LTLCardinality-12 finished in 290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G((!p1&&(p2 U G(p3)))))))'
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 03:13:01] [INFO ] Invariant cache hit.
[2023-04-07 03:13:01] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 03:13:01] [INFO ] Invariant cache hit.
[2023-04-07 03:13:01] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:13:01] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-07 03:13:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:13:01] [INFO ] Invariant cache hit.
[2023-04-07 03:13:01] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p1)), true, (NOT p3), (NOT p3), (OR (NOT p3) p1)]
Running random walk in product with property : CryptoMiner-COL-D05N100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p3 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}], [{ cond=(OR p1 (AND (NOT p3) (NOT p2))), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s12 s13 s14 s15 s16 s17)) (LEQ 2 (ADD s0 s1 s2 s3 s4 s5))), p1:(LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s12 s13 s14 s15...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 225 ms.
Product exploration explored 100000 steps with 0 reset in 127 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 45 edges and 18 vertex of which 7 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 p2), (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (AND p3 p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X p3), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2))), (X (NOT (OR p1 (AND (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), true, (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR p1 (AND (NOT p3) (NOT p2))))))]
False Knowledge obtained : [(X (X (AND p3 p2))), (X (X (NOT (AND p3 p2)))), (X (X (AND (NOT p1) p3 (NOT p2)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2)))))]
Knowledge based reduction with 26 factoid took 395 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p3) p1), true, (NOT p3), (NOT p3)]
Incomplete random walk after 10019 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=715 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 03:13:02] [INFO ] Invariant cache hit.
[2023-04-07 03:13:02] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 03:13:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 03:13:02] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 p2), (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (AND p3 p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X p3), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2))), (X (NOT (OR p1 (AND (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), true, (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR p1 (AND (NOT p3) (NOT p2)))))), (G (NOT (AND (NOT p1) (NOT p3) p2))), (G (NOT (AND (NOT p3) p2)))]
False Knowledge obtained : [(X (X (AND p3 p2))), (X (X (NOT (AND p3 p2)))), (X (X (AND (NOT p1) p3 (NOT p2)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (F (NOT p3)), (F (AND p3 (NOT p2))), (F (AND (NOT p3) (NOT p2))), (F (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (F (AND (NOT p1) p3 (NOT p2))), (F (OR p1 (AND (NOT p3) (NOT p2)))), (F (NOT (AND p3 p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT p3))
Knowledge based reduction with 28 factoid took 486 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D05N100-LTLCardinality-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D05N100-LTLCardinality-14 finished in 1843 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||X(G(!p0)))))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 1 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 17 cols
[2023-04-07 03:13:03] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 03:13:03] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 03:13:03] [INFO ] Invariant cache hit.
[2023-04-07 03:13:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:13:03] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-04-07 03:13:03] [INFO ] Invariant cache hit.
[2023-04-07 03:13:03] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 17/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, false, false, p0]
Running random walk in product with property : CryptoMiner-COL-D05N100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ (ADD s6 s7 s8 s9 s10 s11) (ADD s0 s1 s2 s3 s4 s5))], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Product exploration explored 100000 steps with 50000 reset in 69 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Computed a total of 10 stabilizing places and 11 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 19 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D05N100-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D05N100-LTLCardinality-15 finished in 533 ms.
All properties solved by simple procedures.
Total runtime 7502 ms.
ITS solved all properties within timeout

BK_STOP 1680837184700

--------------------
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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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