Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028700555.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CryptoMiner-COL-D03N010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028700555
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 13K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748614837811

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D03N010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-05-30 14:20:39] [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]
[2025-05-30 14:20:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 14:20:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-05-30 14:20:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-30 14:20:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 506 ms
[2025-05-30 14:20:39] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 12 PT places and 20.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2025-05-30 14:20:39] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 4 ms.
[2025-05-30 14:20:39] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 3 stabilizing places and 3 stable transitions
RANDOM walk for 40018 steps (5303 resets) in 428 ms. (93 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40004 steps (972 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (2233 resets) in 244 ms. (163 steps per ms) remains 2/2 properties
[2025-05-30 14:20:40] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2025-05-30 14:20:40] [INFO ] Computed 0 invariants in 2 ms
[2025-05-30 14:20:40] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp12 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 4/7 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 121 ms.
Refiners :[State Equation: 2/3 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 173ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 14:20:40] [INFO ] Flatten gal took : 12 ms
[2025-05-30 14:20:40] [INFO ] Flatten gal took : 2 ms
Arc [0:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2025-05-30 14:20:40] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 34 arcs in 12 ms.
[2025-05-30 14:20:40] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 4 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2025-05-30 14:20:40] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:40] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-05-30 14:20:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:20:40] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:20:40] [INFO ] Invariant cache hit.
[2025-05-30 14:20:40] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 402ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 402ms
Finished structural reductions in LTL mode , in 1 iterations and 657 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places after structural reductions.
[2025-05-30 14:20:41] [INFO ] Flatten gal took : 2 ms
[2025-05-30 14:20:41] [INFO ] Flatten gal took : 3 ms
[2025-05-30 14:20:41] [INFO ] Input system was already deterministic with 12 transitions.
RANDOM walk for 40013 steps (8 resets) in 241 ms. (165 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40003 steps (8 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 2/2 properties
[2025-05-30 14:20:41] [INFO ] Invariant cache hit.
[2025-05-30 14:20:41] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp11 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 24/24 variables, and 13 constraints, problems are : Problem set: 2 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:20:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:41] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-05-30 14:20:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:20:41] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:20:41] [INFO ] Redundant transitions in 1 ms returned []
Running 9 sub problems to find dead transitions.
[2025-05-30 14:20:41] [INFO ] Invariant cache hit.
[2025-05-30 14:20:41] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 227ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 278 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 225 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-00 finished in 908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(!(X((X(p0)||p1))||p2)) U p0)))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:20:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:42] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-05-30 14:20:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:20:42] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:20:42] [INFO ] Invariant cache hit.
[2025-05-30 14:20:42] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 267ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 267ms
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), true, true, (OR p1 p0), p0]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-01
Product exploration explored 100000 steps with 1 reset in 113 ms.
Entered a terminal (fully accepting) state of product in 9 steps with 1 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-01 finished in 681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(X(X(p1)))))||G((F((p0&&X(X(X(p1)))))||G(!p1)))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:20:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:43] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-05-30 14:20:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:20:43] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:20:43] [INFO ] Invariant cache hit.
[2025-05-30 14:20:43] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 218ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 219ms
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 677 ms :[(NOT p1), (NOT p1), false, false, false, false, false, (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), false, false, (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 111 ms.
Product exploration explored 100000 steps with 0 reset in 112 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 137 ms. Reduced automaton from 16 states, 40 edges and 2 AP (stutter sensitive) to 16 states, 40 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 603 ms :[(NOT p1), (NOT p1), false, false, false, (AND p1 (NOT p0)), false, false, (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), false, false]
RANDOM walk for 40024 steps (12 resets) in 68 ms. (580 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 167 ms. (238 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
[2025-05-30 14:20:45] [INFO ] Invariant cache hit.
[2025-05-30 14:20:45] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/24 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 24/24 variables, and 13 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 131 ms. Reduced automaton from 16 states, 40 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-02 finished in 2271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(F(p1) U X(p2)))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:20:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 14:20:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:20:45] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:20:45] [INFO ] Invariant cache hit.
[2025-05-30 14:20:45] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 232ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 233ms
Finished structural reductions in LTL mode , in 1 iterations and 282 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 67 ms.
Product exploration explored 100000 steps with 33333 reset in 77 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 18 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-04 finished in 742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(!p0)&&F(G((p1||X(!p0))))) U X(!p0))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:20:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:46] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-05-30 14:20:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:20:46] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:20:46] [INFO ] Invariant cache hit.
[2025-05-30 14:20:46] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 239ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 240ms
Finished structural reductions in LTL mode , in 1 iterations and 303 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 178 ms :[p0, (AND (NOT p1) p0), p0, (AND (NOT p1) p0)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-06
Product exploration explored 100000 steps with 454 reset in 51 ms.
Product exploration explored 100000 steps with 36977 reset in 71 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 159 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[p0, (AND (NOT p1) p0), p0, (AND (NOT p1) p0)]
RANDOM walk for 40020 steps (12 resets) in 35 ms. (1111 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
[2025-05-30 14:20:47] [INFO ] Invariant cache hit.
[2025-05-30 14:20:47] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
After SMT solving in domain Real declared 8/24 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/12 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 242 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 4 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:20:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:48] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-05-30 14:20:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:20:48] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:20:48] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2025-05-30 14:20:48] [INFO ] Invariant cache hit.
[2025-05-30 14:20:48] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 208ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 209ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 269 ms. Remains : 12/12 places, 12/12 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (OR (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 242 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40009 steps (10 resets) in 33 ms. (1176 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
[2025-05-30 14:20:48] [INFO ] Invariant cache hit.
[2025-05-30 14:20:48] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
After SMT solving in domain Real declared 8/24 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/12 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (OR (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (G (OR (NOT p0) p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 423 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 166 ms :[p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 84 ms.
Product exploration explored 100000 steps with 0 reset in 80 ms.
Built C files in :
/tmp/ltsmin992247721047605469
[2025-05-30 14:20:49] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2025-05-30 14:20:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 14:20:49] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2025-05-30 14:20:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 14:20:49] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2025-05-30 14:20:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 14:20:49] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin992247721047605469
Running compilation step : cd /tmp/ltsmin992247721047605469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 196 ms.
Running link step : cd /tmp/ltsmin992247721047605469;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin992247721047605469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11025472547850885100.hoa' '--buchi-type=spotba'
LTSmin run took 113 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-06 finished in 3903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 4 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 11 ms. Remains 9 /12 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 9 cols
[2025-05-30 14:20:50] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:50] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-05-30 14:20:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:20:50] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:20:50] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-05-30 14:20:50] [INFO ] Invariant cache hit.
[2025-05-30 14:20:50] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/17 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/17 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 142ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/12 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 9/12 places, 9/12 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-08 finished in 256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&G((p1||G(p2))))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2025-05-30 14:20:50] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:50] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-05-30 14:20:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:20:50] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:20:50] [INFO ] Invariant cache hit.
[2025-05-30 14:20:50] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 223ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 223ms
Finished structural reductions in LTL mode , in 1 iterations and 273 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 138 ms.
Product exploration explored 100000 steps with 0 reset in 458 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (X (OR p1 p2)), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2))))]
Knowledge based reduction with 20 factoid took 496 ms. Reduced automaton from 6 states, 27 edges and 3 AP (stutter sensitive) to 6 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40014 steps (12 resets) in 58 ms. (678 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
[2025-05-30 14:20:52] [INFO ] Invariant cache hit.
[2025-05-30 14:20:52] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem apf11 is UNSAT
Problem apf12 is UNSAT
After SMT solving in domain Real declared 24/24 variables, and 13 constraints, problems are : Problem set: 3 solved, 0 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (X (OR p1 p2)), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p2 p1)), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (F (NOT (OR p2 (NOT p1)))), (F p0), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p1))), (F (NOT (AND p2 p1))), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT p1))]
Knowledge based reduction with 23 factoid took 874 ms. Reduced automaton from 6 states, 27 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2025-05-30 14:20:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (X (OR p1 p2)), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p2 p1)), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (F (NOT (OR p2 (NOT p1)))), (F p0), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p1))), (F (NOT (AND p2 p1))), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT p1)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 23 factoid took 892 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-09 finished in 4270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0)&&F(G(p1))) U X(p0)))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:54] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-05-30 14:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:20:54] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:20:54] [INFO ] Invariant cache hit.
[2025-05-30 14:20:54] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 225ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 226ms
Finished structural reductions in LTL mode , in 1 iterations and 279 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-10 finished in 561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:20:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:55] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-05-30 14:20:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:20:55] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:20:55] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2025-05-30 14:20:55] [INFO ] Invariant cache hit.
[2025-05-30 14:20:55] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 203ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 204ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 85 ms.
Product exploration explored 100000 steps with 0 reset in 105 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 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 91 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 23395 steps (6 resets) in 13 ms. (1671 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:20:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:56] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 14:20:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:20:56] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:20:56] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2025-05-30 14:20:56] [INFO ] Invariant cache hit.
[2025-05-30 14:20:56] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 213ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 269 ms. Remains : 12/12 places, 12/12 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 26714 steps (6 resets) in 24 ms. (1068 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 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 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 65 ms.
Product exploration explored 100000 steps with 0 reset in 75 ms.
Built C files in :
/tmp/ltsmin13817898614699210778
[2025-05-30 14:20:57] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2025-05-30 14:20:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 14:20:57] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2025-05-30 14:20:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 14:20:57] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2025-05-30 14:20:57] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 14:20:57] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13817898614699210778
Running compilation step : cd /tmp/ltsmin13817898614699210778;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 90 ms.
Running link step : cd /tmp/ltsmin13817898614699210778;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13817898614699210778;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4230001411848637228.hoa' '--buchi-type=spotba'
LTSmin run took 47 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-11 finished in 2258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(p1 U (G(p1)||(p1&&G(!p0))))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:20:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:57] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-05-30 14:20:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:20:57] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:20:57] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2025-05-30 14:20:57] [INFO ] Invariant cache hit.
[2025-05-30 14:20:57] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 201ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 201ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (AND (NOT p1) p0), p0]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 150 ms.
Product exploration explored 100000 steps with 0 reset in 141 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 10 factoid took 334 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (AND (NOT p1) p0), p0]
RANDOM walk for 40026 steps (10 resets) in 58 ms. (678 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
[2025-05-30 14:20:58] [INFO ] Invariant cache hit.
[2025-05-30 14:20:58] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 24/24 variables, and 13 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 539 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:20:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:59] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-05-30 14:20:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:20:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:20:59] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:20:59] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2025-05-30 14:20:59] [INFO ] Invariant cache hit.
[2025-05-30 14:20:59] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 225ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 225ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 270 ms. Remains : 12/12 places, 12/12 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 10 factoid took 335 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 40018 steps (10 resets) in 43 ms. (909 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
[2025-05-30 14:21:00] [INFO ] Invariant cache hit.
[2025-05-30 14:21:00] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 24/24 variables, and 13 constraints, problems are : Problem set: 1 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 555 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 102 ms.
Product exploration explored 100000 steps with 0 reset in 145 ms.
Built C files in :
/tmp/ltsmin1832033900851864279
[2025-05-30 14:21:01] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2025-05-30 14:21:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 14:21:01] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2025-05-30 14:21:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 14:21:01] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2025-05-30 14:21:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 14:21:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1832033900851864279
Running compilation step : cd /tmp/ltsmin1832033900851864279;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 75 ms.
Running link step : cd /tmp/ltsmin1832033900851864279;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1832033900851864279;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17996326669241089370.hoa' '--buchi-type=spotba'
LTSmin run took 141 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-12 finished in 4397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(p1))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:21:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:21:02] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-05-30 14:21:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:21:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:21:02] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:21:02] [INFO ] Invariant cache hit.
[2025-05-30 14:21:02] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 196ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 196ms
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 2958 steps with 988 reset in 3 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-13 finished in 391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(p1)))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-05-30 14:21:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:21:02] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 14:21:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:21:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 14:21:02] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-30 14:21:02] [INFO ] Invariant cache hit.
[2025-05-30 14:21:02] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 227ms
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 361 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 124 ms.
Product exploration explored 100000 steps with 1 reset in 88 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
RANDOM walk for 40008 steps (9 resets) in 55 ms. (714 steps per ms) remains 1/4 properties
BEST_FIRST walk for 10184 steps (3 resets) in 27 ms. (363 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 254 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 295 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
[2025-05-30 14:21:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 2 factoid took 284 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-14 finished in 2509 ms.
All properties solved by simple procedures.
Total runtime 25873 ms.

BK_STOP 1748614865061

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-COL-D03N010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is CryptoMiner-COL-D03N010, 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 r044-tall-174854028700555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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