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.r480-tall-171624189100355.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 ltsminxred
Input is CryptoMiner-COL-D20N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189100355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.9K Apr 12 12:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 12:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 12 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K 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-COL-D20N100-LTLCardinality-00
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-01
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-02
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-03
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-04
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-05
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-06
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-07
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-08
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-09
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-10
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-11
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-12
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-13
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-14
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717188250870

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D20N100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:44:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:44:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:44:12] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 20:44:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 20:44:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 578 ms
[2024-05-31 20:44:12] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 63 PT places and 105.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 20:44:13] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 4 ms.
[2024-05-31 20:44:13] [INFO ] Skeletonized 16 HLPN properties in 7 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 3 stabilizing places and 3 stable transitions
RANDOM walk for 40295 steps (752 resets) in 199 ms. (201 steps per ms) remains 3/18 properties
BEST_FIRST walk for 40004 steps (96 resets) in 320 ms. (124 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (96 resets) in 264 ms. (150 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (96 resets) in 271 ms. (147 steps per ms) remains 3/3 properties
[2024-05-31 20:44:13] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2024-05-31 20:44:13] [INFO ] Computed 0 invariants in 6 ms
[2024-05-31 20:44:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 4/7 variables, and 2 constraints, problems are : Problem set: 3 solved, 0 unsolved in 170 ms.
Refiners :[State Equation: 2/3 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 218ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:44:13] [INFO ] Flatten gal took : 12 ms
[2024-05-31 20:44:13] [INFO ] Flatten gal took : 2 ms
Arc [0:1*[(MOD (ADD $x 1) 21)]] contains successor/predecessor on variables of sort CD
[2024-05-31 20:44:13] [INFO ] Unfolded HLPN to a Petri net with 63 places and 63 transitions 187 arcs in 14 ms.
[2024-05-31 20:44:13] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2024-05-31 20:44:13] [INFO ] Computed 1 invariants in 6 ms
[2024-05-31 20:44:13] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 20:44:14] [INFO ] Invariant cache hit.
[2024-05-31 20:44:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:44:14] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-31 20:44:14] [INFO ] Invariant cache hit.
[2024-05-31 20:44:14] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1410 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1776 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3206ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3209ms
Finished structural reductions in LTL mode , in 1 iterations and 3355 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places after structural reductions.
[2024-05-31 20:44:17] [INFO ] Flatten gal took : 9 ms
[2024-05-31 20:44:17] [INFO ] Flatten gal took : 8 ms
[2024-05-31 20:44:17] [INFO ] Input system was already deterministic with 63 transitions.
RANDOM walk for 40184 steps (11 resets) in 88 ms. (451 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 605 ms. (66 steps per ms) remains 2/2 properties
[2024-05-31 20:44:17] [INFO ] Invariant cache hit.
[2024-05-31 20:44:17] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Real declared 126/126 variables, and 64 constraints, problems are : Problem set: 2 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 50ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 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' '!(G((F(p0)&&F((G(p2)&&p1)))))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (complete) has 165 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-31 20:44:18] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 20:44:18] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 20:44:18] [INFO ] Invariant cache hit.
[2024-05-31 20:44:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:44:18] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-31 20:44:18] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-31 20:44:18] [INFO ] Invariant cache hit.
[2024-05-31 20:44:18] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1303 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1697 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3013ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3014ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3148 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 422 ms.
Product exploration explored 100000 steps with 0 reset in 408 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 123 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 7198 steps (2 resets) in 10 ms. (654 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 240 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
[2024-05-31 20:44:23] [INFO ] Invariant cache hit.
[2024-05-31 20:44:23] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:44:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:44:23] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 20:44:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:44:23] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:44:23] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 20:44:23] [INFO ] Added : 19 causal constraints over 4 iterations in 36 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-31 20:44:23] [INFO ] Invariant cache hit.
Proved EG (NOT p2)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p0)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 11 factoid took 242 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-01 finished in 5770 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((p0||G(p1)||G(!p1))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2024-05-31 20:44:23] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 20:44:23] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-31 20:44:23] [INFO ] Invariant cache hit.
[2024-05-31 20:44:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:44:23] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-31 20:44:23] [INFO ] Invariant cache hit.
[2024-05-31 20:44:23] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1251 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1672 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2934ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2935ms
Finished structural reductions in LTL mode , in 1 iterations and 3014 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, false, false, (NOT p1), p1]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-03 finished in 3591 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 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-31 20:44:27] [INFO ] Invariant cache hit.
[2024-05-31 20:44:27] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-31 20:44:27] [INFO ] Invariant cache hit.
[2024-05-31 20:44:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:44:27] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-31 20:44:27] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-31 20:44:27] [INFO ] Invariant cache hit.
[2024-05-31 20:44:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1301 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1800 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3118ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3119ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3204 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 34 ms :[p0]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 207 ms.
Product exploration explored 100000 steps with 0 reset in 264 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
RANDOM walk for 17077 steps (4 resets) in 15 ms. (1067 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[p0]
Stuttering acceptance computed with spot in 36 ms :[p0]
[2024-05-31 20:44:31] [INFO ] Invariant cache hit.
Proved EG p0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-04 finished in 4135 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(X(X(F(p0))))))'
Support contains 21 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 8 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-31 20:44:31] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 20:44:31] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-31 20:44:31] [INFO ] Invariant cache hit.
[2024-05-31 20:44:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:44:31] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-31 20:44:31] [INFO ] Invariant cache hit.
[2024-05-31 20:44:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1309 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1706 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3031ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3032ms
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3123 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 193 ms.
Product exploration explored 100000 steps with 0 reset in 236 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 23685 steps (5 resets) in 11 ms. (1973 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 20:44:35] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-05 finished in 4653 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(((p0||X(p0)) U (G((p0||X(p0)))||((p0||X(p0))&&(!p0 U p1))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2024-05-31 20:44:36] [INFO ] Computed 1 invariants in 2 ms
[2024-05-31 20:44:36] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-31 20:44:36] [INFO ] Invariant cache hit.
[2024-05-31 20:44:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:44:36] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-31 20:44:36] [INFO ] Invariant cache hit.
[2024-05-31 20:44:36] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1344 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1768 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3121ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3121ms
Finished structural reductions in LTL mode , in 1 iterations and 3199 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 457 ms.
Product exploration explored 100000 steps with 0 reset in 464 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 126 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 37058 steps (8 resets) in 20 ms. (1764 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 220 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-31 20:44:41] [INFO ] Invariant cache hit.
[2024-05-31 20:44:41] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-31 20:44:41] [INFO ] Invariant cache hit.
[2024-05-31 20:44:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:44:41] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-31 20:44:41] [INFO ] Invariant cache hit.
[2024-05-31 20:44:41] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1186 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1811 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3004ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3005ms
Finished structural reductions in LTL mode , in 1 iterations and 3081 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 275 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40300 steps (10 resets) in 12 ms. (3100 steps per ms) remains 1/5 properties
BEST_FIRST walk for 800 steps (0 resets) in 7 ms. (100 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 247 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 383 ms.
Product exploration explored 100000 steps with 0 reset in 439 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-31 20:44:46] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-31 20:44:46] [INFO ] Invariant cache hit.
[2024-05-31 20:44:46] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1354 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1697 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3058ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3059ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3066 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-31 20:44:49] [INFO ] Invariant cache hit.
[2024-05-31 20:44:49] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-31 20:44:49] [INFO ] Invariant cache hit.
[2024-05-31 20:44:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:44:49] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-31 20:44:49] [INFO ] Invariant cache hit.
[2024-05-31 20:44:49] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1225 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1700 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2932ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2932ms
Finished structural reductions in LTL mode , in 1 iterations and 3005 ms. Remains : 63/63 places, 63/63 transitions.
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-06 finished in 16776 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(F((p0&&X(F(p1)))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-31 20:44:52] [INFO ] Invariant cache hit.
[2024-05-31 20:44:52] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 20:44:52] [INFO ] Invariant cache hit.
[2024-05-31 20:44:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:44:52] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-31 20:44:52] [INFO ] Invariant cache hit.
[2024-05-31 20:44:52] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1225 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1715 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2948ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2948ms
Finished structural reductions in LTL mode , in 1 iterations and 3014 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 251 ms.
Product exploration explored 100000 steps with 0 reset in 386 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.5 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 17079 steps (4 resets) in 8 ms. (1897 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-31 20:44:57] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
[2024-05-31 20:44:57] [INFO ] Invariant cache hit.
[2024-05-31 20:44:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:44:57] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (G (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-07 finished in 4769 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(F(p0))&&G(p1)))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-31 20:44:57] [INFO ] Invariant cache hit.
[2024-05-31 20:44:57] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-31 20:44:57] [INFO ] Invariant cache hit.
[2024-05-31 20:44:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:44:57] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-31 20:44:57] [INFO ] Invariant cache hit.
[2024-05-31 20:44:57] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1284 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1698 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2990ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2991ms
Finished structural reductions in LTL mode , in 1 iterations and 3065 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 362 ms.
Product exploration explored 100000 steps with 0 reset in 402 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1)]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(X (X (NOT p1)))
Knowledge based reduction with 2 factoid took 332 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-08 finished in 4305 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))&&F(p1)))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-31 20:45:01] [INFO ] Invariant cache hit.
[2024-05-31 20:45:01] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-31 20:45:01] [INFO ] Invariant cache hit.
[2024-05-31 20:45:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:45:02] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-31 20:45:02] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-31 20:45:02] [INFO ] Invariant cache hit.
[2024-05-31 20:45:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1355 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1796 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3158ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3159ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3231 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 367 ms.
Product exploration explored 100000 steps with 0 reset in 418 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 22253 steps (5 resets) in 13 ms. (1589 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-31 20:45:06] [INFO ] Invariant cache hit.
[2024-05-31 20:45:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-10 finished in 4769 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(p0) U !p1)||F((p2&&F(p3)))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-31 20:45:06] [INFO ] Invariant cache hit.
[2024-05-31 20:45:06] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-31 20:45:06] [INFO ] Invariant cache hit.
[2024-05-31 20:45:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:45:06] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-31 20:45:06] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-31 20:45:06] [INFO ] Invariant cache hit.
[2024-05-31 20:45:06] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1267 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1703 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2977ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2978ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3059 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND p1 (NOT p3))]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 424 ms.
Product exploration explored 100000 steps with 0 reset in 470 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p1 p0 p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p0 p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND p1 p0 (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 23 factoid took 1169 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 6 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 248 ms :[(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND p1 (NOT p3))]
RANDOM walk for 40091 steps (14 resets) in 38 ms. (1027 steps per ms) remains 9/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
[2024-05-31 20:45:12] [INFO ] Invariant cache hit.
[2024-05-31 20:45:12] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf3 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
Problem apf16 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf10 is UNSAT
Problem apf12 is UNSAT
After SMT solving in domain Real declared 126/126 variables, and 64 constraints, problems are : Problem set: 9 solved, 0 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 9 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p1 p0 p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p0 p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (OR p0 p3 (NOT p1))), (G (OR p0 (NOT p1) p2)), (G (OR p0 p3)), (G (OR p0 p3 (NOT p1) (NOT p2))), (G (OR p3 (NOT p2))), (G (OR p0 p3 (NOT p2))), (G (OR (NOT p0) p3 (NOT p2))), (G (OR p0 p2)), (G (OR (NOT p0) p3 (NOT p1) (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND p1 p0 (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (AND p0 (NOT p3) p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 (NOT p2)))), (F (NOT (AND p0 (NOT p3)))), (F p2), (F p3), (F (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 32 factoid took 1322 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 35 ms :[(AND p1 (NOT p2))]
[2024-05-31 20:45:14] [INFO ] Invariant cache hit.
Proved EG (AND p1 (NOT p2))
Knowledge obtained : [(AND p1 p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p1 p0 p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p0 p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (OR p0 p3 (NOT p1))), (G (OR p0 (NOT p1) p2)), (G (OR p0 p3)), (G (OR p0 p3 (NOT p1) (NOT p2))), (G (OR p3 (NOT p2))), (G (OR p0 p3 (NOT p2))), (G (OR (NOT p0) p3 (NOT p2))), (G (OR p0 p2)), (G (OR (NOT p0) p3 (NOT p1) (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND p1 p0 (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (AND p0 (NOT p3) p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 (NOT p2)))), (F (NOT (AND p0 (NOT p3)))), (F p2), (F p3), (F (NOT (AND p0 p1 (NOT p2)))), (G (AND p1 (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND p1 (NOT p2)))
Knowledge based reduction with 32 factoid took 1361 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-11 finished in 8876 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||X((X((G(!p1)||(!p1&&F(!p0)))) U (p0&&X((G(!p1)||(!p1&&F(!p0)))))))))))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-31 20:45:15] [INFO ] Invariant cache hit.
[2024-05-31 20:45:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-31 20:45:15] [INFO ] Invariant cache hit.
[2024-05-31 20:45:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:45:15] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-31 20:45:15] [INFO ] Invariant cache hit.
[2024-05-31 20:45:15] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1227 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1673 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2908ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2909ms
Finished structural reductions in LTL mode , in 1 iterations and 2981 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 210 ms.
Product exploration explored 100000 steps with 0 reset in 265 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 17179 steps (5 resets) in 21 ms. (780 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-31 20:45:19] [INFO ] Invariant cache hit.
[2024-05-31 20:45:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-31 20:45:20] [INFO ] Invariant cache hit.
[2024-05-31 20:45:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:45:20] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-31 20:45:20] [INFO ] Invariant cache hit.
[2024-05-31 20:45:20] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1279 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1720 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3008ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3010ms
Finished structural reductions in LTL mode , in 1 iterations and 3083 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 23685 steps (5 resets) in 18 ms. (1246 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 206 ms.
Product exploration explored 100000 steps with 0 reset in 251 ms.
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-31 20:45:24] [INFO ] Invariant cache hit.
[2024-05-31 20:45:24] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-31 20:45:24] [INFO ] Invariant cache hit.
[2024-05-31 20:45:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:45:24] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-31 20:45:24] [INFO ] Invariant cache hit.
[2024-05-31 20:45:24] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1260 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1710 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2977ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2978ms
Finished structural reductions in LTL mode , in 1 iterations and 3046 ms. Remains : 63/63 places, 63/63 transitions.
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-13 finished in 11944 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)))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-31 20:45:27] [INFO ] Invariant cache hit.
[2024-05-31 20:45:27] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-31 20:45:27] [INFO ] Invariant cache hit.
[2024-05-31 20:45:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:45:27] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-31 20:45:27] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-31 20:45:27] [INFO ] Invariant cache hit.
[2024-05-31 20:45:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1760 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3045ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3047ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3115 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 221 ms.
Product exploration explored 100000 steps with 0 reset in 244 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 13824 steps (4 resets) in 8 ms. (1536 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-31 20:45:31] [INFO ] Invariant cache hit.
[2024-05-31 20:45:31] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-31 20:45:31] [INFO ] Invariant cache hit.
[2024-05-31 20:45:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:45:31] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-31 20:45:31] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-31 20:45:31] [INFO ] Invariant cache hit.
[2024-05-31 20:45:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1314 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1805 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3127ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3128ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3206 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40244 steps (8 resets) in 13 ms. (2874 steps per ms) remains 1/1 properties
BEST_FIRST walk for 816 steps (0 resets) in 5 ms. (136 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 206 ms.
Product exploration explored 100000 steps with 0 reset in 247 ms.
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-31 20:45:35] [INFO ] Invariant cache hit.
[2024-05-31 20:45:35] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-31 20:45:35] [INFO ] Invariant cache hit.
[2024-05-31 20:45:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:45:35] [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-31 20:45:35] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-31 20:45:35] [INFO ] Invariant cache hit.
[2024-05-31 20:45:35] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1297 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1752 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3069ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3070ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3155 ms. Remains : 63/63 places, 63/63 transitions.
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-15 finished in 11374 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(((p0||X(p0)) U (G((p0||X(p0)))||((p0||X(p0))&&(!p0 U p1))))))'
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||X((X((G(!p1)||(!p1&&F(!p0)))) U (p0&&X((G(!p1)||(!p1&&F(!p0)))))))))))'
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)))'
[2024-05-31 20:45:39] [INFO ] Flatten gal took : 10 ms
[2024-05-31 20:45:39] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 20:45:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 63 places, 63 transitions and 187 arcs took 3 ms.
Total runtime 87113 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717188339705

--------------------
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
mcc2024
ltl formula name CryptoMiner-COL-D20N100-LTLCardinality-06
ltl formula formula --ltl=/tmp/2068/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 63 places, 63 transitions and 187 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2068/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2068/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2068/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2068/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 64 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 64, there are 71 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~122!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 313
pnml2lts-mc( 0/ 4): unique transitions count: 1137
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 325
pnml2lts-mc( 0/ 4): - cum. max stack depth: 325
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 325 states 1186 transitions, fanout: 3.649
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 32500, Transitions per second: 118600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 33.3 B/state, compr.: 12.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 63 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name CryptoMiner-COL-D20N100-LTLCardinality-13
ltl formula formula --ltl=/tmp/2068/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 63 places, 63 transitions and 187 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2068/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2068/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2068/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2068/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 63 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 64, there are 69 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~124!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 379
pnml2lts-mc( 0/ 4): unique transitions count: 1354
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 585
pnml2lts-mc( 0/ 4): - cum. max stack depth: 585
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 585 states 2170 transitions, fanout: 3.709
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 58500, Transitions per second: 217000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 35.4 B/state, compr.: 13.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 63 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name CryptoMiner-COL-D20N100-LTLCardinality-15
ltl formula formula --ltl=/tmp/2068/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 63 places, 63 transitions and 187 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2068/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2068/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2068/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2068/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 64 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 64, there are 66 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~122!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 384
pnml2lts-mc( 0/ 4): unique transitions count: 1290
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 480
pnml2lts-mc( 0/ 4): - cum. max stack depth: 480
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 480 states 1585 transitions, fanout: 3.302
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 48000, Transitions per second: 158500
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 33.5 B/state, compr.: 13.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 63 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CryptoMiner-COL-D20N100, 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 r480-tall-171624189100355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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