Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 12K Apr 12 12:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 12:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 12:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 12 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 12 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 12 12:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 7.8K May 18 16:42 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-D05N250-LTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D05N250-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716319985875

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D05N250
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 19:33:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:33:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:33:07] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2024-05-21 19:33:07] [INFO ] Transformed 18 places.
[2024-05-21 19:33:07] [INFO ] Transformed 18 transitions.
[2024-05-21 19:33:07] [INFO ] Parsed PT model containing 18 places and 18 transitions and 52 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 7 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2024-05-21 19:33:07] [INFO ] Computed 1 invariants in 5 ms
[2024-05-21 19:33:07] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 19:33:07] [INFO ] Invariant cache hit.
[2024-05-21 19:33:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 19:33:07] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-21 19:33:07] [INFO ] Invariant cache hit.
[2024-05-21 19:33:07] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 18/18 places, 18/18 transitions.
Support contains 18 out of 18 places after structural reductions.
[2024-05-21 19:33:08] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:33:08] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:33:08] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10060 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=359 ) properties (out of 24) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-21 19:33:08] [INFO ] Invariant cache hit.
[2024-05-21 19:33:08] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 19:33:08] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-21 19:33:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 19:33:08] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2024-05-21 19:33:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 19:33:08] [INFO ] After 4ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :6 sat :1
[2024-05-21 19:33:08] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-21 19:33:08] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :1
Fused 7 Parikh solutions to 1 different solutions.
Finished Parikh walk after 274 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=137 )
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 18/18 transitions.
Graph (trivial) has 11 edges and 18 vertex of which 6 / 18 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 22 edges and 13 vertex of which 6 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 6 transition count 5
Applied a total of 6 rules in 8 ms. Remains 6 /18 variables (removed 12) and now considering 5/18 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 6/18 places, 5/18 transitions.
Incomplete random walk after 10035 steps, including 82 resets, run finished after 3 ms. (steps per millisecond=3345 ) properties (out of 1) seen :0
Finished Best-First random walk after 102 steps, including 7 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 45 edges and 18 vertex of which 7 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-10 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(G(p0)))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Graph (complete) has 45 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 17 cols
[2024-05-21 19:33:09] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 19:33:09] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 19:33:09] [INFO ] Invariant cache hit.
[2024-05-21 19:33:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 19:33:09] [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.
[2024-05-21 19:33:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 19:33:09] [INFO ] Invariant cache hit.
[2024-05-21 19:33:09] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 17/18 places, 18/18 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 135 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 1 (ADD s0 s1 s2 s3 s4 s5)) (LEQ 1 (ADD s11 s12 s13 s14 s15 s16)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 238 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 60 in 0 ms.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-00 finished in 526 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)||G(p1))))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Graph (trivial) has 6 edges and 18 vertex of which 6 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Applied a total of 1 rules in 2 ms. Remains 13 /18 variables (removed 5) and now considering 13/18 (removed 5) transitions.
// Phase 1: matrix 13 rows 13 cols
[2024-05-21 19:33:09] [INFO ] Computed 1 invariants in 0 ms
[2024-05-21 19:33:09] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 19:33:09] [INFO ] Invariant cache hit.
[2024-05-21 19:33:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 19:33:09] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-21 19:33:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 19:33:09] [INFO ] Invariant cache hit.
[2024-05-21 19:33:09] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/18 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 13/18 places, 13/18 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s7 s8 s9 s10 s11 s12) (ADD s1 s2 s3 s4 s5 s6)), p1:(GT 3 (ADD s1 s2 s3 s4 s5 s6))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 200 ms.
Product exploration explored 100000 steps with 0 reset in 167 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 40 edges and 13 vertex of which 1 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Detected a total of 13/13 stabilizing places and 12/13 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 7 factoid took 447 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10030 steps, including 69 resets, run finished after 4 ms. (steps per millisecond=2507 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 696 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 19:33:10] [INFO ] Invariant cache hit.
[2024-05-21 19:33:10] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 19:33:10] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 625 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Support contains 6 out of 13 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 13/13 transitions.
Applied a total of 0 rules in 3 ms. Remains 13 /13 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2024-05-21 19:33:11] [INFO ] Invariant cache hit.
[2024-05-21 19:33:11] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 19:33:11] [INFO ] Invariant cache hit.
[2024-05-21 19:33:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 19:33:11] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-21 19:33:11] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 19:33:11] [INFO ] Invariant cache hit.
[2024-05-21 19:33:11] [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 86 ms. Remains : 13/13 places, 13/13 transitions.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 40 edges and 13 vertex of which 1 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Detected a total of 13/13 stabilizing places and 12/13 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 88 ms.
Built C files in :
/tmp/ltsmin11043828393267913720
[2024-05-21 19:33:11] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2024-05-21 19:33:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:33:11] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2024-05-21 19:33:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:33:11] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2024-05-21 19:33:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:33:11] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11043828393267913720
Running compilation step : cd /tmp/ltsmin11043828393267913720;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 158 ms.
Running link step : cd /tmp/ltsmin11043828393267913720;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11043828393267913720;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7772195064387909129.hoa' '--buchi-type=spotba'
LTSmin run took 81 ms.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-02 finished in 2738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1 U p2))))'
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2024-05-21 19:33:12] [INFO ] Computed 1 invariants in 1 ms
[2024-05-21 19:33:12] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 19:33:12] [INFO ] Invariant cache hit.
[2024-05-21 19:33:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 19:33:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-21 19:33:12] [INFO ] Invariant cache hit.
[2024-05-21 19:33:12] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 18/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p2)]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ (ADD s12 s13 s14 s15 s16 s17) (ADD s0 s1 s2 s3 s4 s5)), p0:(LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s6 s7 s8 s9 s10 s11)), p1:(AND (LEQ 3 (ADD s12 s13 s1...], 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 50000 reset in 144 ms.
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 45 edges and 18 vertex of which 7 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 15 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-03 finished in 599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Graph (complete) has 45 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 17 cols
[2024-05-21 19:33:12] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 19:33:12] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 19:33:12] [INFO ] Invariant cache hit.
[2024-05-21 19:33:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 19:33:12] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-21 19:33:12] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 19:33:12] [INFO ] Invariant cache hit.
[2024-05-21 19:33:12] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 17/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLCardinality-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}]], initial=1, aps=[p0:(LEQ (ADD s11 s12 s13 s14 s15 s16) (ADD s0 s1 s2 s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 111 ms.
Product exploration explored 100000 steps with 0 reset in 205 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-05 finished in 730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((F(p0)&&F(G(p1)))) U p2))))'
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 2 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-05-21 19:33:13] [INFO ] Invariant cache hit.
[2024-05-21 19:33:13] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 19:33:13] [INFO ] Invariant cache hit.
[2024-05-21 19:33:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 19:33:13] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-21 19:33:13] [INFO ] Invariant cache hit.
[2024-05-21 19:33:13] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 17/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GT s11 s0), p0:(LEQ s6 s15), p1:(LEQ s3 s9)], 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]]
Product exploration explored 100000 steps with 0 reset in 66 ms.
Stack based approach found an accepted trace after 56 steps with 0 reset with depth 57 and stack size 57 in 0 ms.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-09 finished in 398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X((G(p1) U (p0&&G(p1))))) U p1)))'
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 0 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-05-21 19:33:13] [INFO ] Invariant cache hit.
[2024-05-21 19:33:14] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 19:33:14] [INFO ] Invariant cache hit.
[2024-05-21 19:33:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 19:33:14] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-21 19:33:14] [INFO ] Invariant cache hit.
[2024-05-21 19:33:14] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 17/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), true, (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LEQ 2 s3), p0:(LEQ s8 s2)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 539 steps with 18 reset in 0 ms.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-11 finished in 232 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 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 0 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-05-21 19:33:14] [INFO ] Invariant cache hit.
[2024-05-21 19:33:14] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 19:33:14] [INFO ] Invariant cache hit.
[2024-05-21 19:33:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 19:33:14] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-21 19:33:14] [INFO ] Invariant cache hit.
[2024-05-21 19:33:14] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 17/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(LEQ s12 s9), p0:(LEQ s6 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Detected a total of 10/17 stabilizing places and 11/18 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-13 finished in 501 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 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Graph (complete) has 45 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-05-21 19:33:14] [INFO ] Invariant cache hit.
[2024-05-21 19:33:14] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 19:33:14] [INFO ] Invariant cache hit.
[2024-05-21 19:33:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 19:33:14] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-21 19:33:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 19:33:14] [INFO ] Invariant cache hit.
[2024-05-21 19:33:14] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 17/18 places, 18/18 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N250-LTLCardinality-15 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:(AND (GT 2 s6) (GT s14 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Stack based approach found an accepted trace after 69 steps with 1 reset with depth 45 and stack size 45 in 0 ms.
FORMULA CryptoMiner-PT-D05N250-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N250-LTLCardinality-15 finished in 222 ms.
All properties solved by simple procedures.
Total runtime 7600 ms.

BK_STOP 1716319995992

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-D05N250"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CryptoMiner-PT-D05N250, 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 r109-tall-171624208200252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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