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-167987246300164.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CryptoMiner-PT-D03N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246300164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K 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 82K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 5.3K Mar 31 16:48 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1680884440410

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D03N100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 16:20:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 16:20:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 16:20:42] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2023-04-07 16:20:42] [INFO ] Transformed 12 places.
[2023-04-07 16:20:42] [INFO ] Transformed 12 transitions.
[2023-04-07 16:20:42] [INFO ] Parsed PT model containing 12 places and 12 transitions and 34 arcs in 72 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 8 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 16:20:42] [INFO ] Computed 0 invariants in 3 ms
[2023-04-07 16:20:42] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-04-07 16:20:42] [INFO ] Invariant cache hit.
[2023-04-07 16:20:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:42] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-04-07 16:20:42] [INFO ] Invariant cache hit.
[2023-04-07 16:20:42] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 11/12 places, 12/12 transitions.
Support contains 8 out of 11 places after structural reductions.
[2023-04-07 16:20:42] [INFO ] Flatten gal took : 11 ms
[2023-04-07 16:20:42] [INFO ] Flatten gal took : 3 ms
[2023-04-07 16:20:43] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10018 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=213 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 16:20:43] [INFO ] Invariant cache hit.
[2023-04-07 16:20:43] [INFO ] After 37ms 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.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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)&&p0)))'
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:43] [INFO ] Invariant cache hit.
[2023-04-07 16:20:43] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 16:20:43] [INFO ] Invariant cache hit.
[2023-04-07 16:20:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:43] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 16:20:43] [INFO ] Invariant cache hit.
[2023-04-07 16:20:43] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 11/11 places, 12/12 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT 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:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)), p0:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 3 reset in 2 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-00 finished in 524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:44] [INFO ] Invariant cache hit.
[2023-04-07 16:20:44] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 16:20:44] [INFO ] Invariant cache hit.
[2023-04-07 16:20:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:44] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-07 16:20:44] [INFO ] Invariant cache hit.
[2023-04-07 16:20:44] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 176 ms.
Product exploration explored 100000 steps with 0 reset in 129 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:45] [INFO ] Invariant cache hit.
[2023-04-07 16:20:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 16:20:45] [INFO ] Invariant cache hit.
[2023-04-07 16:20:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:45] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-07 16:20:45] [INFO ] Invariant cache hit.
[2023-04-07 16:20:45] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3337 ) properties (out of 1) seen :0
Finished Best-First random walk after 400 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=200 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 122 ms.
Product exploration explored 100000 steps with 0 reset in 158 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 4 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:46] [INFO ] Invariant cache hit.
[2023-04-07 16:20:46] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50 ms. Remains : 11/11 places, 12/12 transitions.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:46] [INFO ] Invariant cache hit.
[2023-04-07 16:20:46] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-04-07 16:20:46] [INFO ] Invariant cache hit.
[2023-04-07 16:20:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-04-07 16:20:46] [INFO ] Invariant cache hit.
[2023-04-07 16:20:46] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 11/11 places, 12/12 transitions.
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-01 finished in 2845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p1))&&p0)))))'
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:46] [INFO ] Invariant cache hit.
[2023-04-07 16:20:46] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 16:20:46] [INFO ] Invariant cache hit.
[2023-04-07 16:20:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:46] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-07 16:20:46] [INFO ] Invariant cache hit.
[2023-04-07 16:20:46] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s7 1)), p1:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-02 finished in 420 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((F(G(p2))||p1))))'
Support contains 7 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:47] [INFO ] Invariant cache hit.
[2023-04-07 16:20:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-04-07 16:20:47] [INFO ] Invariant cache hit.
[2023-04-07 16:20:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:47] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-04-07 16:20:47] [INFO ] Invariant cache hit.
[2023-04-07 16:20:47] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s7 1)), p1:(OR (GEQ s7 1) (GEQ s8 1) (GEQ s9 1)), p2:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], 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 50000 reset in 109 ms.
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D03N100-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-04 finished in 744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:48] [INFO ] Invariant cache hit.
[2023-04-07 16:20:48] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 16:20:48] [INFO ] Invariant cache hit.
[2023-04-07 16:20:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:48] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-04-07 16:20:48] [INFO ] Invariant cache hit.
[2023-04-07 16:20:48] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s7 1) (LT s8 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-05 finished in 433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:48] [INFO ] Invariant cache hit.
[2023-04-07 16:20:48] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 16:20:48] [INFO ] Invariant cache hit.
[2023-04-07 16:20:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:48] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-07 16:20:48] [INFO ] Invariant cache hit.
[2023-04-07 16:20:48] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-06 finished in 369 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 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Graph (trivial) has 4 edges and 11 vertex of which 4 / 11 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 7 ms. Remains 8 /11 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 8 cols
[2023-04-07 16:20:48] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 16:20:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 16:20:48] [INFO ] Invariant cache hit.
[2023-04-07 16:20:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:48] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-07 16:20:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:48] [INFO ] Invariant cache hit.
[2023-04-07 16:20:48] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/11 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 8/11 places, 9/12 transitions.
Stuttering acceptance computed with spot in 34 ms :[p0]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-07 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 (LT s4 1) (LT s5 1) (LT s6 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 12 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-07 finished in 127 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)))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 16:20:48] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 16:20:48] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 16:20:48] [INFO ] Invariant cache hit.
[2023-04-07 16:20:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:49] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-07 16:20:49] [INFO ] Invariant cache hit.
[2023-04-07 16:20:49] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(GEQ s10 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 2 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-08 finished in 192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:49] [INFO ] Invariant cache hit.
[2023-04-07 16:20:49] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 16:20:49] [INFO ] Invariant cache hit.
[2023-04-07 16:20:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:49] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-04-07 16:20:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:49] [INFO ] Invariant cache hit.
[2023-04-07 16:20:49] [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 77 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s7 1)), p1:(LT s7 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 3 reset in 86 ms.
Product exploration explored 100000 steps with 0 reset in 122 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 213 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Finished random walk after 203 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 300 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
[2023-04-07 16:20:50] [INFO ] Invariant cache hit.
[2023-04-07 16:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 16:20:50] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-07 16:20:50] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 16:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 16:20:50] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-07 16:20:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-07 16:20:50] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 16:20:50] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p1)
[2023-04-07 16:20:50] [INFO ] Invariant cache hit.
[2023-04-07 16:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 16:20:50] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-07 16:20:50] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 16:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 16:20:50] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-07 16:20:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-07 16:20:50] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 16:20:50] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:50] [INFO ] Invariant cache hit.
[2023-04-07 16:20:50] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 16:20:50] [INFO ] Invariant cache hit.
[2023-04-07 16:20:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:50] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-04-07 16:20:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:50] [INFO ] Invariant cache hit.
[2023-04-07 16:20:50] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 291 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Finished random walk after 102 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 274 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
[2023-04-07 16:20:51] [INFO ] Invariant cache hit.
[2023-04-07 16:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 16:20:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-07 16:20:51] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 16:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 16:20:51] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-07 16:20:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-07 16:20:51] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 16:20:51] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
[2023-04-07 16:20:51] [INFO ] Invariant cache hit.
[2023-04-07 16:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 16:20:51] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-07 16:20:51] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 16:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 16:20:51] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-07 16:20:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-07 16:20:51] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 16:20:51] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 76 ms.
Product exploration explored 100000 steps with 0 reset in 115 ms.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:51] [INFO ] Invariant cache hit.
[2023-04-07 16:20:51] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-04-07 16:20:51] [INFO ] Invariant cache hit.
[2023-04-07 16:20:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:52] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-04-07 16:20:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:52] [INFO ] Invariant cache hit.
[2023-04-07 16:20:52] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 11/11 places, 12/12 transitions.
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-09 finished in 2998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:52] [INFO ] Invariant cache hit.
[2023-04-07 16:20:52] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 16:20:52] [INFO ] Invariant cache hit.
[2023-04-07 16:20:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:52] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-07 16:20:52] [INFO ] Invariant cache hit.
[2023-04-07 16:20:52] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s10 1), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 17607 reset in 59 ms.
Product exploration explored 100000 steps with 17664 reset in 65 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 16:20:53] [INFO ] Invariant cache hit.
[2023-04-07 16:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 16:20:53] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-07 16:20:53] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 16:20:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 16:20:53] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-07 16:20:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:53] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-07 16:20:53] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 16:20:53] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:53] [INFO ] Invariant cache hit.
[2023-04-07 16:20:53] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 16:20:53] [INFO ] Invariant cache hit.
[2023-04-07 16:20:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:53] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-04-07 16:20:53] [INFO ] Invariant cache hit.
[2023-04-07 16:20:53] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 16:20:54] [INFO ] Invariant cache hit.
[2023-04-07 16:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 16:20:54] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-07 16:20:54] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 16:20:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 16:20:54] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-07 16:20:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:54] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-04-07 16:20:54] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 16:20:54] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17568 reset in 64 ms.
Product exploration explored 100000 steps with 17610 reset in 59 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:54] [INFO ] Invariant cache hit.
[2023-04-07 16:20:54] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35 ms. Remains : 11/11 places, 12/12 transitions.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:54] [INFO ] Invariant cache hit.
[2023-04-07 16:20:54] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 16:20:54] [INFO ] Invariant cache hit.
[2023-04-07 16:20:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:54] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-07 16:20:54] [INFO ] Invariant cache hit.
[2023-04-07 16:20:54] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 11/11 places, 12/12 transitions.
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-10 finished in 2573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(!p1)||p0))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:54] [INFO ] Invariant cache hit.
[2023-04-07 16:20:54] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 16:20:54] [INFO ] Invariant cache hit.
[2023-04-07 16:20:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:54] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-07 16:20:54] [INFO ] Invariant cache hit.
[2023-04-07 16:20:54] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 133 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s0 1) (GEQ s7 1)), p0:(OR (LT s0 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19944 reset in 59 ms.
Stack based approach found an accepted trace after 112 steps with 24 reset with depth 7 and stack size 7 in 1 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-11 finished in 287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((!p0||(p0&&X(!p0))))))))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:55] [INFO ] Invariant cache hit.
[2023-04-07 16:20:55] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-07 16:20:55] [INFO ] Invariant cache hit.
[2023-04-07 16:20:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:55] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-04-07 16:20:55] [INFO ] Invariant cache hit.
[2023-04-07 16:20:55] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 127 ms :[p0, p0, p0, p0]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23720 reset in 50 ms.
Stack based approach found an accepted trace after 385 steps with 90 reset with depth 9 and stack size 9 in 1 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-12 finished in 289 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((X(p1)&&F(p2)))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:55] [INFO ] Invariant cache hit.
[2023-04-07 16:20:55] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 16:20:55] [INFO ] Invariant cache hit.
[2023-04-07 16:20:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:55] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-07 16:20:55] [INFO ] Invariant cache hit.
[2023-04-07 16:20:55] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), 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 p0) p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s10 1), p2:(LT s8 1), p1:(AND (GEQ s0 1) (GEQ s7 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 18 reset in 52 ms.
Stack based approach found an accepted trace after 23 steps with 2 reset with depth 19 and stack size 19 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-13 finished in 334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U G((!p1||X(!p1)))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:55] [INFO ] Invariant cache hit.
[2023-04-07 16:20:55] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 16:20:55] [INFO ] Invariant cache hit.
[2023-04-07 16:20:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:55] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-07 16:20:55] [INFO ] Invariant cache hit.
[2023-04-07 16:20:55] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 220 ms :[p1, false, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), true]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LT s7 1), p0:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-14 finished in 330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : CryptoMiner-PT-D03N100-LTLFireability-01
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:56] [INFO ] Invariant cache hit.
[2023-04-07 16:20:56] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 16:20:56] [INFO ] Invariant cache hit.
[2023-04-07 16:20:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:56] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-07 16:20:56] [INFO ] Invariant cache hit.
[2023-04-07 16:20:56] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 73 ms. Remains : 11/11 places, 12/12 transitions.
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 55 ms.
Product exploration explored 100000 steps with 0 reset in 100 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:56] [INFO ] Invariant cache hit.
[2023-04-07 16:20:56] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 16:20:56] [INFO ] Invariant cache hit.
[2023-04-07 16:20:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:57] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-04-07 16:20:57] [INFO ] Invariant cache hit.
[2023-04-07 16:20:57] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 6785 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=2261 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 131 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:20:58] [INFO ] Invariant cache hit.
[2023-04-07 16:20:58] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37 ms. Remains : 11/11 places, 12/12 transitions.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:58] [INFO ] Invariant cache hit.
[2023-04-07 16:20:58] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 16:20:58] [INFO ] Invariant cache hit.
[2023-04-07 16:20:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:58] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-07 16:20:58] [INFO ] Invariant cache hit.
[2023-04-07 16:20:58] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 11/11 places, 12/12 transitions.
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-01 finished in 2257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Found a Shortening insensitive property : CryptoMiner-PT-D03N100-LTLFireability-10
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:58] [INFO ] Invariant cache hit.
[2023-04-07 16:20:58] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 16:20:58] [INFO ] Invariant cache hit.
[2023-04-07 16:20:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:58] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-04-07 16:20:58] [INFO ] Invariant cache hit.
[2023-04-07 16:20:58] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 82 ms. Remains : 11/11 places, 12/12 transitions.
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s10 1), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 17637 reset in 51 ms.
Product exploration explored 100000 steps with 17607 reset in 67 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 103 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=103 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 16:20:59] [INFO ] Invariant cache hit.
[2023-04-07 16:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 16:20:59] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-07 16:20:59] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 16:20:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 16:20:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-07 16:20:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-07 16:20:59] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 16:20:59] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:20:59] [INFO ] Invariant cache hit.
[2023-04-07 16:20:59] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 16:20:59] [INFO ] Invariant cache hit.
[2023-04-07 16:20:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:20:59] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-07 16:20:59] [INFO ] Invariant cache hit.
[2023-04-07 16:20:59] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 103 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=103 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 16:21:00] [INFO ] Invariant cache hit.
[2023-04-07 16:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 16:21:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-07 16:21:00] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 16:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 16:21:00] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-07 16:21:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:21:00] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-07 16:21:00] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 16:21:00] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17605 reset in 58 ms.
Product exploration explored 100000 steps with 17596 reset in 73 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:21:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:21:00] [INFO ] Invariant cache hit.
[2023-04-07 16:21:00] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30 ms. Remains : 11/11 places, 12/12 transitions.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 16:21:00] [INFO ] Invariant cache hit.
[2023-04-07 16:21:00] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 16:21:00] [INFO ] Invariant cache hit.
[2023-04-07 16:21:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 16:21:00] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-07 16:21:00] [INFO ] Invariant cache hit.
[2023-04-07 16:21:00] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 11/11 places, 12/12 transitions.
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-10 finished in 2354 ms.
[2023-04-07 16:21:00] [INFO ] Flatten gal took : 3 ms
[2023-04-07 16:21:00] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 16:21:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11 places, 12 transitions and 33 arcs took 0 ms.
Total runtime 18242 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1901/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1901/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1901/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CryptoMiner-PT-D03N100-LTLFireability-01
Could not compute solution for formula : CryptoMiner-PT-D03N100-LTLFireability-09
Could not compute solution for formula : CryptoMiner-PT-D03N100-LTLFireability-10

BK_STOP 1680884462005

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CryptoMiner-PT-D03N100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CryptoMiner-PT-D03N100, 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-167987246300164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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