Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 32K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 205K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 24K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 174K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 186K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Mar 23 07:07 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 9.2K Mar 31 16:48 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1680843940729

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D10N000
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 05:05:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 05:05:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 05:05:42] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-04-07 05:05:42] [INFO ] Transformed 22 places.
[2023-04-07 05:05:42] [INFO ] Transformed 22 transitions.
[2023-04-07 05:05:42] [INFO ] Parsed PT model containing 22 places and 22 transitions and 64 arcs in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CryptoMiner-PT-D10N000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N000-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N000-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N000-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N000-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 6 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-04-07 05:05:42] [INFO ] Computed 0 invariants in 4 ms
[2023-04-07 05:05:42] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-04-07 05:05:42] [INFO ] Invariant cache hit.
[2023-04-07 05:05:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:42] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-04-07 05:05:42] [INFO ] Invariant cache hit.
[2023-04-07 05:05:42] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 22/22 places, 22/22 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-04-07 05:05:42] [INFO ] Flatten gal took : 13 ms
[2023-04-07 05:05:42] [INFO ] Flatten gal took : 4 ms
[2023-04-07 05:05:42] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10000 steps, including 701 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 326 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 502 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 05:05:43] [INFO ] Invariant cache hit.
[2023-04-07 05:05:43] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA CryptoMiner-PT-D10N000-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA CryptoMiner-PT-D10N000-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 52 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
FORMULA CryptoMiner-PT-D10N000-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(X(G(p1)))))'
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 05:05:43] [INFO ] Invariant cache hit.
[2023-04-07 05:05:43] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 05:05:43] [INFO ] Invariant cache hit.
[2023-04-07 05:05:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:43] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 05:05:43] [INFO ] Invariant cache hit.
[2023-04-07 05:05:43] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 22/22 places, 22/22 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 241 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(AND (OR (LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 ...], 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 14276 reset in 238 ms.
Product exploration explored 100000 steps with 14308 reset in 201 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 52 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 357 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0)]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-04-07 05:05:45] [INFO ] Invariant cache hit.
[2023-04-07 05:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:05:45] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-04-07 05:05:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:45] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2023-04-07 05:05:45] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 6 ms.
[2023-04-07 05:05:45] [INFO ] Added : 9 causal constraints over 2 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 6 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 05:05:45] [INFO ] Invariant cache hit.
[2023-04-07 05:05:45] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-07 05:05:45] [INFO ] Invariant cache hit.
[2023-04-07 05:05:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:45] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-04-07 05:05:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 05:05:45] [INFO ] Invariant cache hit.
[2023-04-07 05:05:45] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 22/22 places, 22/22 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 52 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-04-07 05:05:45] [INFO ] Invariant cache hit.
[2023-04-07 05:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:05:45] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-04-07 05:05:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:45] [INFO ] [Real]Added 10 Read/Feed constraints in 6 ms returned sat
[2023-04-07 05:05:45] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-07 05:05:45] [INFO ] Added : 9 causal constraints over 2 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14205 reset in 67 ms.
Product exploration explored 100000 steps with 14340 reset in 189 ms.
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 13 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 05:05:46] [INFO ] Invariant cache hit.
[2023-04-07 05:05:46] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-04-07 05:05:46] [INFO ] Invariant cache hit.
[2023-04-07 05:05:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:46] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-04-07 05:05:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:05:46] [INFO ] Invariant cache hit.
[2023-04-07 05:05:46] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 22/22 places, 22/22 transitions.
Treatment of property CryptoMiner-PT-D10N000-LTLCardinality-02 finished in 2967 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)&&F(p1)))'
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 05:05:46] [INFO ] Invariant cache hit.
[2023-04-07 05:05:46] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 05:05:46] [INFO ] Invariant cache hit.
[2023-04-07 05:05:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:46] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-07 05:05:46] [INFO ] Invariant cache hit.
[2023-04-07 05:05:46] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 22/22 places, 22/22 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)), p0:(LEQ 1 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Product exploration explored 100000 steps with 50000 reset in 68 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 52 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/22 stabilizing places and 11/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N000-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N000-LTLCardinality-03 finished in 482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 05:05:47] [INFO ] Invariant cache hit.
[2023-04-07 05:05:47] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 05:05:47] [INFO ] Invariant cache hit.
[2023-04-07 05:05:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:47] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 05:05:47] [INFO ] Invariant cache hit.
[2023-04-07 05:05:47] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 22/22 places, 22/22 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LEQ (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)) (LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))), p...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N000-LTLCardinality-05 finished in 252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 05:05:47] [INFO ] Invariant cache hit.
[2023-04-07 05:05:47] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-07 05:05:47] [INFO ] Invariant cache hit.
[2023-04-07 05:05:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:47] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-04-07 05:05:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:05:47] [INFO ] Invariant cache hit.
[2023-04-07 05:05:47] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 22/22 places, 22/22 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N000-LTLCardinality-06 finished in 230 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)&&G((p1||(p1 U p2)))))'
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 05:05:47] [INFO ] Invariant cache hit.
[2023-04-07 05:05:47] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-07 05:05:47] [INFO ] Invariant cache hit.
[2023-04-07 05:05:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:47] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-07 05:05:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 05:05:47] [INFO ] Invariant cache hit.
[2023-04-07 05:05:47] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 22/22 places, 22/22 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p2)), true, (OR p0 (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ 1 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)), p2:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N000-LTLCardinality-07 finished in 215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Graph (complete) has 52 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 21 cols
[2023-04-07 05:05:47] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 05:05:47] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-07 05:05:47] [INFO ] Invariant cache hit.
[2023-04-07 05:05:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:47] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-04-07 05:05:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:05:47] [INFO ] Invariant cache hit.
[2023-04-07 05:05:47] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/22 places, 22/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 21/22 places, 22/22 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s19 s2)], 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 0 ms.
FORMULA CryptoMiner-PT-D10N000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N000-LTLCardinality-10 finished in 157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(p0)) U (G((p0 U X(p0)))||(p1&&(p0 U X(p0)))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 22
Applied a total of 1 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 22/22 (removed 0) transitions.
[2023-04-07 05:05:47] [INFO ] Invariant cache hit.
[2023-04-07 05:05:47] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 05:05:47] [INFO ] Invariant cache hit.
[2023-04-07 05:05:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:47] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-07 05:05:47] [INFO ] Invariant cache hit.
[2023-04-07 05:05:47] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 22/22 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 21/22 places, 22/22 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(LEQ s11 s2), p0:(LEQ s4 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 49 ms.
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N000-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N000-LTLCardinality-14 finished in 392 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(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 22
Applied a total of 1 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 22/22 (removed 0) transitions.
[2023-04-07 05:05:48] [INFO ] Invariant cache hit.
[2023-04-07 05:05:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 05:05:48] [INFO ] Invariant cache hit.
[2023-04-07 05:05:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:48] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 05:05:48] [INFO ] Invariant cache hit.
[2023-04-07 05:05:48] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 22/22 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 21/22 places, 22/22 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s7), p1:(LEQ s8 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N000-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N000-LTLCardinality-15 finished in 296 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(X(G(p1)))))'
Found a Lengthening insensitive property : CryptoMiner-PT-D10N000-LTLCardinality-02
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-04-07 05:05:48] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 05:05:48] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 05:05:48] [INFO ] Invariant cache hit.
[2023-04-07 05:05:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:48] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-07 05:05:48] [INFO ] Invariant cache hit.
[2023-04-07 05:05:48] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 90 ms. Remains : 22/22 places, 22/22 transitions.
Running random walk in product with property : CryptoMiner-PT-D10N000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(AND (OR (LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14230 reset in 73 ms.
Product exploration explored 100000 steps with 14366 reset in 72 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 52 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0)]
Knowledge based reduction with 2 factoid took 230 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2023-04-07 05:05:49] [INFO ] Invariant cache hit.
[2023-04-07 05:05:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:05:49] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-07 05:05:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:49] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-04-07 05:05:49] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 05:05:49] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 05:05:49] [INFO ] Invariant cache hit.
[2023-04-07 05:05:49] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 05:05:49] [INFO ] Invariant cache hit.
[2023-04-07 05:05:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:49] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-04-07 05:05:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:05:49] [INFO ] Invariant cache hit.
[2023-04-07 05:05:49] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 22/22 places, 22/22 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 52 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 143 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-04-07 05:05:50] [INFO ] Invariant cache hit.
[2023-04-07 05:05:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:05:50] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-07 05:05:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:50] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-04-07 05:05:50] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 05:05:50] [INFO ] Added : 9 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14354 reset in 67 ms.
Product exploration explored 100000 steps with 14159 reset in 58 ms.
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 6 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-04-07 05:05:50] [INFO ] Invariant cache hit.
[2023-04-07 05:05:50] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 05:05:50] [INFO ] Invariant cache hit.
[2023-04-07 05:05:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 05:05:50] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-04-07 05:05:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 05:05:50] [INFO ] Invariant cache hit.
[2023-04-07 05:05:50] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 22/22 places, 22/22 transitions.
Treatment of property CryptoMiner-PT-D10N000-LTLCardinality-02 finished in 1944 ms.
[2023-04-07 05:05:50] [INFO ] Flatten gal took : 3 ms
[2023-04-07 05:05:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-07 05:05:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 22 transitions and 64 arcs took 0 ms.
Total runtime 8328 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CryptoMiner-PT-D10N000
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA CryptoMiner-PT-D10N000-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680843951734

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 CryptoMiner-PT-D10N000-LTLCardinality-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CryptoMiner-PT-D10N000-LTLCardinality-02
lola: result : true
lola: markings : 22
lola: fired transitions : 29
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CryptoMiner-PT-D10N000-LTLCardinality-02: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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