Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 17K Apr 12 12:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 12:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 12:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 36K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 226K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 29K Apr 12 12:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 200K Apr 12 12:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.6K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 15K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716283341066

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D10N100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:22:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 09:22:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:22:22] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2024-05-21 09:22:22] [INFO ] Transformed 33 places.
[2024-05-21 09:22:22] [INFO ] Transformed 33 transitions.
[2024-05-21 09:22:22] [INFO ] Parsed PT model containing 33 places and 33 transitions and 97 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 7 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2024-05-21 09:22:22] [INFO ] Computed 1 invariants in 9 ms
[2024-05-21 09:22:22] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-21 09:22:22] [INFO ] Invariant cache hit.
[2024-05-21 09:22:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 09:22:22] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2024-05-21 09:22:22] [INFO ] Invariant cache hit.
[2024-05-21 09:22:22] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 1/66 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 44 constraints, problems are : Problem set: 0 solved, 30 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 29/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 1/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 74 constraints, problems are : Problem set: 0 solved, 30 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 1348ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1358ms
Finished structural reductions in LTL mode , in 1 iterations and 1638 ms. Remains : 33/33 places, 33/33 transitions.
Support contains 33 out of 33 places after structural reductions.
[2024-05-21 09:22:24] [INFO ] Flatten gal took : 17 ms
[2024-05-21 09:22:24] [INFO ] Flatten gal took : 5 ms
[2024-05-21 09:22:24] [INFO ] Input system was already deterministic with 33 transitions.
RANDOM walk for 40172 steps (9 resets) in 131 ms. (304 steps per ms) remains 7/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 465 ms. (85 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 401 ms. (99 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 214 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
[2024-05-21 09:22:25] [INFO ] Invariant cache hit.
[2024-05-21 09:22:25] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 20/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 3 (OVERLAPS) 33/66 variables, 33/34 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 10/44 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/44 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/66 variables, 0/44 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 44 constraints, problems are : Problem set: 4 solved, 2 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/24 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/50 variables, 24/25 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 3/28 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/28 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/56 variables, 3/31 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 3/34 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/34 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/62 variables, 3/37 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 3/40 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/62 variables, 1/41 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/62 variables, 0/41 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/65 variables, 2/43 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/65 variables, 1/44 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/65 variables, 1/45 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/65 variables, 0/45 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/66 variables, 1/46 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/66 variables, 0/46 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/66 variables, 0/46 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 46 constraints, problems are : Problem set: 4 solved, 2 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 248ms problems are : Problem set: 4 solved, 2 unsolved
Finished Parikh walk after 2491 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=830 )
Parikh walk visited 2 properties in 211 ms.
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 11 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2024-05-21 09:22:25] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 09:22:25] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 09:22:25] [INFO ] Invariant cache hit.
[2024-05-21 09:22:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 09:22:25] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-21 09:22:25] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-21 09:22:25] [INFO ] Invariant cache hit.
[2024-05-21 09:22:25] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 349 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 364 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 730ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 731ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 822 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 233 ms.
Stack based approach found an accepted trace after 2660 steps with 0 reset with depth 2661 and stack size 2661 in 6 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-00 finished in 1263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (trivial) has 11 edges and 33 vertex of which 11 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 12 ms. Remains 23 /33 variables (removed 10) and now considering 23/33 (removed 10) transitions.
// Phase 1: matrix 23 rows 23 cols
[2024-05-21 09:22:27] [INFO ] Computed 1 invariants in 1 ms
[2024-05-21 09:22:27] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 09:22:27] [INFO ] Invariant cache hit.
[2024-05-21 09:22:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 09:22:27] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-21 09:22:27] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 09:22:27] [INFO ] Invariant cache hit.
[2024-05-21 09:22:27] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 22/44 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 1/45 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/45 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/46 variables, and 34 constraints, problems are : Problem set: 0 solved, 20 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 22/44 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 1/45 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/45 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/46 variables, and 54 constraints, problems are : Problem set: 0 solved, 20 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 476ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 476ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/33 places, 23/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 552 ms. Remains : 23/33 places, 23/33 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-01
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-01 finished in 602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1&&X((!p2 U X((!p2&&X(!p2)))))))))'
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2024-05-21 09:22:27] [INFO ] Computed 1 invariants in 0 ms
[2024-05-21 09:22:27] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 09:22:27] [INFO ] Invariant cache hit.
[2024-05-21 09:22:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 09:22:27] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2024-05-21 09:22:27] [INFO ] Invariant cache hit.
[2024-05-21 09:22:27] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 1/66 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 44 constraints, problems are : Problem set: 0 solved, 30 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 29/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 1/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 74 constraints, problems are : Problem set: 0 solved, 30 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 774ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 775ms
Finished structural reductions in LTL mode , in 1 iterations and 843 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 760 ms :[p2, p2, p2, p2, p2, p2, p2, p2, (OR (NOT p1) p2), (OR (NOT p1) p2), p2, p2, p2, p2, p2, p2, p2, true, (OR (NOT p1) p2)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-03
Product exploration explored 100000 steps with 20000 reset in 318 ms.
Product exploration explored 100000 steps with 20000 reset in 253 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))), (X (X (OR p1 (NOT p2)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 337 ms. Reduced automaton from 19 states, 56 edges and 3 AP (stutter sensitive) to 19 states, 55 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 690 ms :[p2, p2, p2, p2, p2, p2, p2, p2, (OR (NOT p1) p2), (OR (NOT p1) p2), p2, p2, p2, p2, p2, p2, p2, (OR (NOT p1) p2), true]
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40160 steps (10 resets) in 296 ms. (135 steps per ms) remains 12/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
[2024-05-21 09:22:31] [INFO ] Invariant cache hit.
[2024-05-21 09:22:31] [INFO ] State equation strengthened by 10 read => feed constraints.
Problem apf8 is UNSAT
Problem apf11 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem apf2 is UNSAT
Problem apf5 is UNSAT
Problem apf12 is UNSAT
Problem apf15 is UNSAT
After SMT solving in domain Real declared 66/66 variables, and 34 constraints, problems are : Problem set: 6 solved, 0 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))), (X (X (OR p1 (NOT p2)))), (X (X p0)), (G (OR p0 (NOT p1))), (G (OR p0 (NOT p1) p2)), (G (OR (NOT p0) p1 (NOT p2))), (G (OR (NOT p1) (NOT p2))), (G (OR p0 (NOT p1) (NOT p2))), (G (OR (NOT p0) (NOT p1) (NOT p2)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F p2), (F (NOT (OR p0 p2))), (F (NOT p0)), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (AND (OR p0 (NOT p1)) (OR p0 p2)))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 p1))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 23 factoid took 955 ms. Reduced automaton from 19 states, 55 edges and 3 AP (stutter sensitive) to 10 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[p2, p2, p2, p2, p2, p2, p2, true, p2, p2]
Stuttering acceptance computed with spot in 433 ms :[p2, p2, p2, p2, p2, p2, p2, true, p2, p2]
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 09:22:33] [INFO ] Invariant cache hit.
[2024-05-21 09:22:33] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 09:22:33] [INFO ] Invariant cache hit.
[2024-05-21 09:22:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 09:22:33] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2024-05-21 09:22:33] [INFO ] Invariant cache hit.
[2024-05-21 09:22:33] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 1/66 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 44 constraints, problems are : Problem set: 0 solved, 30 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 29/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 1/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 74 constraints, problems are : Problem set: 0 solved, 30 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 733ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 733ms
Finished structural reductions in LTL mode , in 1 iterations and 799 ms. Remains : 33/33 places, 33/33 transitions.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 175 ms. Reduced automaton from 10 states, 15 edges and 3 AP (stutter sensitive) to 10 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 381 ms :[p2, p2, p2, p2, p2, p2, p2, p2, p2, true]
RANDOM walk for 40136 steps (8 resets) in 15 ms. (2508 steps per ms) remains 2/7 properties
BEST_FIRST walk for 800 steps (0 resets) in 4 ms. (160 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p2) p1)]
False Knowledge obtained : [(F (NOT (AND (OR p0 p2) (OR p1 p2)))), (F (NOT (AND p0 p1 (NOT p2)))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 211 ms. Reduced automaton from 10 states, 15 edges and 3 AP (stutter sensitive) to 10 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[p2, p2, p2, p2, p2, p2, p2, p2, p2, true]
Stuttering acceptance computed with spot in 329 ms :[p2, p2, p2, p2, p2, p2, p2, p2, p2, true]
Stuttering acceptance computed with spot in 338 ms :[p2, p2, p2, p2, p2, p2, p2, p2, p2, true]
Product exploration explored 100000 steps with 20000 reset in 75 ms.
Product exploration explored 100000 steps with 20000 reset in 147 ms.
Applying partial POR strategy [true, false, false, false, false, false, false, false, false, true]
Stuttering acceptance computed with spot in 382 ms :[p2, p2, p2, p2, p2, p2, p2, p2, p2, true]
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 09:22:36] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-21 09:22:36] [INFO ] Invariant cache hit.
[2024-05-21 09:22:36] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 1/66 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 44 constraints, problems are : Problem set: 0 solved, 30 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 29/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 1/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 74 constraints, problems are : Problem set: 0 solved, 30 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 714ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 714ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 721 ms. Remains : 33/33 places, 33/33 transitions.
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 09:22:37] [INFO ] Invariant cache hit.
[2024-05-21 09:22:37] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 09:22:37] [INFO ] Invariant cache hit.
[2024-05-21 09:22:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 09:22:37] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2024-05-21 09:22:37] [INFO ] Invariant cache hit.
[2024-05-21 09:22:37] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 1/66 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 44 constraints, problems are : Problem set: 0 solved, 30 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 29/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 1/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 74 constraints, problems are : Problem set: 0 solved, 30 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 725ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 725ms
Finished structural reductions in LTL mode , in 1 iterations and 777 ms. Remains : 33/33 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-03 finished in 10509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F((p1||X(p2)))))))'
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 09:22:38] [INFO ] Invariant cache hit.
[2024-05-21 09:22:38] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 09:22:38] [INFO ] Invariant cache hit.
[2024-05-21 09:22:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 09:22:38] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2024-05-21 09:22:38] [INFO ] Invariant cache hit.
[2024-05-21 09:22:38] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 1/66 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 44 constraints, problems are : Problem set: 0 solved, 30 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 29/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 1/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 74 constraints, problems are : Problem set: 0 solved, 30 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 743ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 744ms
Finished structural reductions in LTL mode , in 1 iterations and 798 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-05
Product exploration explored 100000 steps with 25000 reset in 161 ms.
Product exploration explored 100000 steps with 25000 reset in 197 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40189 steps (12 resets) in 8 ms. (4465 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (10 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
[2024-05-21 09:22:39] [INFO ] Invariant cache hit.
[2024-05-21 09:22:39] [INFO ] State equation strengthened by 10 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 22/66 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/33 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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 p0 (NOT p1) p2), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT p2)), (F p1)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 13 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-05 finished in 1726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 09:22:39] [INFO ] Invariant cache hit.
[2024-05-21 09:22:39] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 09:22:39] [INFO ] Invariant cache hit.
[2024-05-21 09:22:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 09:22:39] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2024-05-21 09:22:39] [INFO ] Invariant cache hit.
[2024-05-21 09:22:39] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 1/66 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 44 constraints, problems are : Problem set: 0 solved, 30 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 29/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 1/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 74 constraints, problems are : Problem set: 0 solved, 30 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 729ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 731ms
Finished structural reductions in LTL mode , in 1 iterations and 794 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, p0, p0]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-07 finished in 892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U p2)))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2024-05-21 09:22:40] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 09:22:40] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 09:22:40] [INFO ] Invariant cache hit.
[2024-05-21 09:22:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 09:22:40] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-21 09:22:40] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-21 09:22:40] [INFO ] Invariant cache hit.
[2024-05-21 09:22:40] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 326 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 354 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 687ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 688ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 760 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 126 ms.
Stack based approach found an accepted trace after 12920 steps with 0 reset with depth 12921 and stack size 12920 in 36 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-08 finished in 1024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 5 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2024-05-21 09:22:41] [INFO ] Invariant cache hit.
[2024-05-21 09:22:41] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 09:22:41] [INFO ] Invariant cache hit.
[2024-05-21 09:22:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 09:22:41] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2024-05-21 09:22:41] [INFO ] Invariant cache hit.
[2024-05-21 09:22:41] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 296 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 360 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 660ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 660ms
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 724 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-10 finished in 858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p0)&&F(G(p1)))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2024-05-21 09:22:42] [INFO ] Invariant cache hit.
[2024-05-21 09:22:42] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-21 09:22:42] [INFO ] Invariant cache hit.
[2024-05-21 09:22:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 09:22:42] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-21 09:22:42] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-21 09:22:42] [INFO ] Invariant cache hit.
[2024-05-21 09:22:42] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 318 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 339 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 662ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 662ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 733 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), p0, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-11
Product exploration explored 100000 steps with 2 reset in 136 ms.
Stack based approach found an accepted trace after 1136 steps with 1 reset with depth 1124 and stack size 1124 in 2 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-11 finished in 1029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2024-05-21 09:22:43] [INFO ] Invariant cache hit.
[2024-05-21 09:22:43] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 09:22:43] [INFO ] Invariant cache hit.
[2024-05-21 09:22:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 09:22:43] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-21 09:22:43] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-21 09:22:43] [INFO ] Invariant cache hit.
[2024-05-21 09:22:43] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 319 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 324 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 649ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 649ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 711 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 97 ms.
Stack based approach found an accepted trace after 1073 steps with 0 reset with depth 1074 and stack size 1074 in 2 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-14 finished in 852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2024-05-21 09:22:44] [INFO ] Invariant cache hit.
[2024-05-21 09:22:44] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 09:22:44] [INFO ] Invariant cache hit.
[2024-05-21 09:22:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 09:22:44] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2024-05-21 09:22:44] [INFO ] Invariant cache hit.
[2024-05-21 09:22:44] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 332 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 341 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 679ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 680ms
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 746 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-15 finished in 835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1&&X((!p2 U X((!p2&&X(!p2)))))))))'
[2024-05-21 09:22:45] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:22:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-21 09:22:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 33 transitions and 97 arcs took 5 ms.
Total runtime 23254 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CryptoMiner-PT-D10N100

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 33
TRANSITIONS: 33
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.001s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1409
MODEL NAME: /home/mcc/execution/411/model
33 places, 33 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716283548898

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CryptoMiner-PT-D10N100, 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 r091-tall-171624187700419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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