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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 9.8K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K 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-D05N250-LTLFireability-00
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-01
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-02
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-03
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-04
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-05
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-06
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-07
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-08
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-09
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-10
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-11
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-12
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-13
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-14
FORMULA_NAME CryptoMiner-COL-D05N250-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680877111624

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D05N250
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 14:18:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 14:18:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 14:18:33] [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 14:18:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 14:18:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 442 ms
[2023-04-07 14:18:33] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 18 PT places and 30.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-04-07 14:18:34] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 4 ms.
[2023-04-07 14:18:34] [INFO ] Skeletonized 6 HLPN properties in 1 ms. Removed 10 properties that had guard overlaps.
Computed a total of 3 stabilizing places and 3 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Arc [0:1*[(MOD (ADD $x 1) 6)]] contains successor/predecessor on variables of sort CD
[2023-04-07 14:18:34] [INFO ] Unfolded HLPN to a Petri net with 18 places and 18 transitions 52 arcs in 5 ms.
[2023-04-07 14:18:34] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N250-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N250-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N250-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 9 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 14:18:34] [INFO ] Computed 0 invariants in 3 ms
[2023-04-07 14:18:34] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-04-07 14:18:34] [INFO ] Invariant cache hit.
[2023-04-07 14:18:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:34] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-04-07 14:18:34] [INFO ] Invariant cache hit.
[2023-04-07 14:18:34] [INFO ] Dead Transitions using invariants and state equation in 39 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 270 ms. Remains : 17/18 places, 18/18 transitions.
Support contains 12 out of 17 places after structural reductions.
[2023-04-07 14:18:34] [INFO ] Flatten gal took : 12 ms
[2023-04-07 14:18:34] [INFO ] Flatten gal took : 5 ms
[2023-04-07 14:18:34] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 256 steps, including 0 resets, run visited all 7 properties in 22 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 1 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.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' '!(X(G((!p0 U !p1))))'
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:34] [INFO ] Invariant cache hit.
[2023-04-07 14:18:34] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-04-07 14:18:34] [INFO ] Invariant cache hit.
[2023-04-07 14:18:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:35] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-04-07 14:18:35] [INFO ] Invariant cache hit.
[2023-04-07 14:18:35] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 17/17 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 246 ms :[p1, p1, true, p1]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s6 1)), p0:(OR (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (AND (GEQ s0 1) (GEQ s6 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-00 finished in 457 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(p1))))'
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:35] [INFO ] Invariant cache hit.
[2023-04-07 14:18:35] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 14:18:35] [INFO ] Invariant cache hit.
[2023-04-07 14:18:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:35] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-07 14:18:35] [INFO ] Invariant cache hit.
[2023-04-07 14:18:35] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s11 1), p0:(AND (GEQ s0 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-01 finished in 257 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 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 14 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:35] [INFO ] Invariant cache hit.
[2023-04-07 14:18:35] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-04-07 14:18:35] [INFO ] Invariant cache hit.
[2023-04-07 14:18:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:35] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-04-07 14:18:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:18:35] [INFO ] Invariant cache hit.
[2023-04-07 14:18:35] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s6 1))], 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 259 ms.
Product exploration explored 100000 steps with 0 reset in 262 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 255 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 27 ms :[p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[p0]
Stuttering acceptance computed with spot in 30 ms :[p0]
[2023-04-07 14:18:36] [INFO ] Invariant cache hit.
[2023-04-07 14:18:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 14:18:36] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-04-07 14:18:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:36] [INFO ] [Real]Added 5 Read/Feed constraints in 7 ms returned sat
[2023-04-07 14:18:36] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 5 ms.
[2023-04-07 14:18:36] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:36] [INFO ] Invariant cache hit.
[2023-04-07 14:18:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 14:18:36] [INFO ] Invariant cache hit.
[2023-04-07 14:18:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:37] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-04-07 14:18:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:18:37] [INFO ] Invariant cache hit.
[2023-04-07 14:18:37] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 17/17 places, 18/18 transitions.
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.1 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p0]
Stuttering acceptance computed with spot in 35 ms :[p0]
[2023-04-07 14:18:37] [INFO ] Invariant cache hit.
[2023-04-07 14:18:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 14:18:37] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-07 14:18:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:37] [INFO ] [Real]Added 5 Read/Feed constraints in 16 ms returned sat
[2023-04-07 14:18:37] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 14:18:37] [INFO ] Added : 0 causal constraints over 0 iterations in 27 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 29 ms :[p0]
Product exploration explored 100000 steps with 0 reset in 106 ms.
Product exploration explored 100000 steps with 0 reset in 212 ms.
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 9 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:37] [INFO ] Invariant cache hit.
[2023-04-07 14:18:37] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 14:18:37] [INFO ] Invariant cache hit.
[2023-04-07 14:18:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:38] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-04-07 14:18:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:18:38] [INFO ] Invariant cache hit.
[2023-04-07 14:18:38] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 17/17 places, 18/18 transitions.
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-02 finished in 2568 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))||G((F(!p1)&&F(G(p2))))))'
Support contains 8 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:38] [INFO ] Invariant cache hit.
[2023-04-07 14:18:38] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-07 14:18:38] [INFO ] Invariant cache hit.
[2023-04-07 14:18:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:38] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-04-07 14:18:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:18:38] [INFO ] Invariant cache hit.
[2023-04-07 14:18:38] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s6 1)), p2:(AND (LT s11 1) (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1)), p1:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Stack based approach found an accepted trace after 53 steps with 0 reset with depth 54 and stack size 54 in 0 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-03 finished in 349 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((p0||X(G(!p1))))))'
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:38] [INFO ] Invariant cache hit.
[2023-04-07 14:18:38] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 14:18:38] [INFO ] Invariant cache hit.
[2023-04-07 14:18:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:38] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-04-07 14:18:38] [INFO ] Invariant cache hit.
[2023-04-07 14:18:38] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (GEQ s0 1) (GEQ s6 1)), p1:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 1 reset in 1 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-04 finished in 264 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(((!p1 U p2)||p0))))'
Support contains 12 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:38] [INFO ] Invariant cache hit.
[2023-04-07 14:18:38] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-04-07 14:18:38] [INFO ] Invariant cache hit.
[2023-04-07 14:18:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:38] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-04-07 14:18:38] [INFO ] Invariant cache hit.
[2023-04-07 14:18:38] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (AND (LT s6 1) (LT s7 1) (LT s8 1) (LT s9 1) (LT s10 1))), p2:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Product exploration explored 100000 steps with 50000 reset in 96 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
Detected a total of 10/17 stabilizing places and 11/18 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 12 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D05N250-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-06 finished in 429 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 p1) U (!p1&&(F(p0) U p1)))))'
Support contains 7 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:39] [INFO ] Invariant cache hit.
[2023-04-07 14:18:39] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-04-07 14:18:39] [INFO ] Invariant cache hit.
[2023-04-07 14:18:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:39] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-04-07 14:18:39] [INFO ] Invariant cache hit.
[2023-04-07 14:18:39] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 247 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, true, (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1)), p0:(GEQ s11 1)], nbAcceptance=0, 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]]
Product exploration explored 100000 steps with 0 reset in 66 ms.
Stack based approach found an accepted trace after 53 steps with 0 reset with depth 54 and stack size 54 in 0 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-08 finished in 458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(p0) U p1)))))'
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:39] [INFO ] Invariant cache hit.
[2023-04-07 14:18:39] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-04-07 14:18:39] [INFO ] Invariant cache hit.
[2023-04-07 14:18:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:39] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-04-07 14:18:39] [INFO ] Invariant cache hit.
[2023-04-07 14:18:39] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1)), p0:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 50 ms.
Stack based approach found an accepted trace after 104 steps with 0 reset with depth 105 and stack size 105 in 0 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-09 finished in 596 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 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Graph (trivial) has 6 edges and 17 vertex of which 6 / 17 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Applied a total of 1 rules in 3 ms. Remains 12 /17 variables (removed 5) and now considering 13/18 (removed 5) transitions.
// Phase 1: matrix 13 rows 12 cols
[2023-04-07 14:18:40] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 14:18:40] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 14:18:40] [INFO ] Invariant cache hit.
[2023-04-07 14:18:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:40] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-07 14:18:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 14:18:40] [INFO ] Invariant cache hit.
[2023-04-07 14:18:40] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/17 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 12/17 places, 13/18 transitions.
Stuttering acceptance computed with spot in 58 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-10 finished in 156 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(!p0))))'
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Graph (trivial) has 6 edges and 17 vertex of which 6 / 17 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Applied a total of 1 rules in 1 ms. Remains 12 /17 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2023-04-07 14:18:40] [INFO ] Invariant cache hit.
[2023-04-07 14:18:40] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-07 14:18:40] [INFO ] Invariant cache hit.
[2023-04-07 14:18:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:40] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-04-07 14:18:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:18:40] [INFO ] Invariant cache hit.
[2023-04-07 14:18:40] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/17 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 12/17 places, 13/18 transitions.
Stuttering acceptance computed with spot in 70 ms :[p0, true, p0]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-11 finished in 155 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 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Graph (trivial) has 6 edges and 17 vertex of which 6 / 17 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Applied a total of 1 rules in 1 ms. Remains 12 /17 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2023-04-07 14:18:40] [INFO ] Invariant cache hit.
[2023-04-07 14:18:40] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 14:18:40] [INFO ] Invariant cache hit.
[2023-04-07 14:18:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:40] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-07 14:18:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:18:40] [INFO ] Invariant cache hit.
[2023-04-07 14:18:40] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/17 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 12/17 places, 13/18 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-COL-D05N250-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-13 finished in 128 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 U !p1))))'
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 17 cols
[2023-04-07 14:18:40] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 14:18:40] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 14:18:40] [INFO ] Invariant cache hit.
[2023-04-07 14:18:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:40] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-07 14:18:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:18:40] [INFO ] Invariant cache hit.
[2023-04-07 14:18:40] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 74 ms :[p1, p1]
Running random walk in product with property : CryptoMiner-COL-D05N250-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s6 1)), p0:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 220 ms.
Product exploration explored 100000 steps with 0 reset in 102 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.1 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Detected a total of 10/17 stabilizing places and 11/18 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (NOT p1) p0)), (X (NOT (OR (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (OR (NOT p1) p0))), (X (X (NOT (OR (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 254 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[p1, p1]
Incomplete random walk after 10067 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1438 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 14:18:41] [INFO ] Invariant cache hit.
[2023-04-07 14:18:41] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (OR (NOT p1) p0)), (X (NOT (OR (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (OR (NOT p1) p0))), (X (X (NOT (OR (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 334 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p1]
Stuttering acceptance computed with spot in 28 ms :[p1]
[2023-04-07 14:18:41] [INFO ] Invariant cache hit.
[2023-04-07 14:18:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 14:18:41] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-07 14:18:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:41] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 14:18:41] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 14:18:41] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG p1
Support contains 2 out of 17 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:42] [INFO ] Invariant cache hit.
[2023-04-07 14:18:42] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 14:18:42] [INFO ] Invariant cache hit.
[2023-04-07 14:18:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:42] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-04-07 14:18:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:18:42] [INFO ] Invariant cache hit.
[2023-04-07 14:18:42] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 17/17 places, 18/18 transitions.
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 : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 137 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 38 ms :[p1]
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p1]
Stuttering acceptance computed with spot in 25 ms :[p1]
[2023-04-07 14:18:42] [INFO ] Invariant cache hit.
[2023-04-07 14:18:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 14:18:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-07 14:18:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:42] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 14:18:42] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 14:18:42] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 27 ms :[p1]
Product exploration explored 100000 steps with 0 reset in 66 ms.
Product exploration explored 100000 steps with 0 reset in 78 ms.
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 14:18:42] [INFO ] Invariant cache hit.
[2023-04-07 14:18:42] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 14:18:42] [INFO ] Invariant cache hit.
[2023-04-07 14:18:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 14:18:42] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-07 14:18:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:18:42] [INFO ] Invariant cache hit.
[2023-04-07 14:18:42] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 17/17 places, 18/18 transitions.
Treatment of property CryptoMiner-COL-D05N250-LTLFireability-15 finished in 2332 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(G((p0 U !p1))))'
[2023-04-07 14:18:43] [INFO ] Flatten gal took : 2 ms
[2023-04-07 14:18:43] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 14:18:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 17 places, 18 transitions and 51 arcs took 0 ms.
Total runtime 9796 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1080/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1080/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CryptoMiner-COL-D05N250-LTLFireability-02
Could not compute solution for formula : CryptoMiner-COL-D05N250-LTLFireability-15

BK_STOP 1680877124521

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name CryptoMiner-COL-D05N250-LTLFireability-02
ltl formula formula --ltl=/tmp/1080/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 17 places, 18 transitions and 51 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1080/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1080/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1080/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1080/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-D05N250-LTLFireability-15
ltl formula formula --ltl=/tmp/1080/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 17 places, 18 transitions and 51 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.020 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1080/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1080/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1080/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1080/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x562e9a2bf3f4]
1: pnml2lts-mc(+0xa2496) [0x562e9a2bf496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f5958416140]
3: pnml2lts-mc(+0x405b30) [0x562e9a622b30]
4: pnml2lts-mc(+0x16b3f9) [0x562e9a3883f9]
5: pnml2lts-mc(+0x164ac4) [0x562e9a381ac4]
6: pnml2lts-mc(+0x272e0a) [0x562e9a48fe0a]
7: pnml2lts-mc(+0xb61f0) [0x562e9a2d31f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f59582694d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f595826967a]
10: pnml2lts-mc(+0xa1581) [0x562e9a2be581]
11: pnml2lts-mc(+0xa1910) [0x562e9a2be910]
12: pnml2lts-mc(+0xa32a2) [0x562e9a2c02a2]
13: pnml2lts-mc(+0xa50f4) [0x562e9a2c20f4]
14: pnml2lts-mc(+0xa516b) [0x562e9a2c216b]
15: pnml2lts-mc(+0x3f34b3) [0x562e9a6104b3]
16: pnml2lts-mc(+0x7c63d) [0x562e9a29963d]
17: pnml2lts-mc(+0x67d86) [0x562e9a284d86]
18: pnml2lts-mc(+0x60a8a) [0x562e9a27da8a]
19: pnml2lts-mc(+0x5eb15) [0x562e9a27bb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f5958251d0a]
21: pnml2lts-mc(+0x6075e) [0x562e9a27d75e]

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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