Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 13K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748625724038

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D10N100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-05-30 17:22:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 17:22:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 17:22:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-05-30 17:22:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-30 17:22:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 499 ms
[2025-05-30 17:22:05] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 33 PT places and 55.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2025-05-30 17:22:05] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 5 ms.
[2025-05-30 17:22:06] [INFO ] Skeletonized 7 HLPN properties in 1 ms. Removed 9 properties that had guard overlaps.
Computed a total of 3 stabilizing places and 3 stable transitions
Remains 2 properties that can be checked using skeleton over-approximation.
FORMULA CryptoMiner-COL-D10N100-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D10N100-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2025-05-30 17:22:06] [INFO ] Flatten gal took : 17 ms
[2025-05-30 17:22:06] [INFO ] Flatten gal took : 1 ms
Arc [0:1*[(MOD (ADD $x 1) 11)]] contains successor/predecessor on variables of sort CD
[2025-05-30 17:22:06] [INFO ] Unfolded HLPN to a Petri net with 33 places and 33 transitions 97 arcs in 16 ms.
[2025-05-30 17:22:06] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-COL-D10N100-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D10N100-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 9 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2025-05-30 17:22:06] [INFO ] Computed 0 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:06] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-05-30 17:22:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:22:06] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2025-05-30 17:22:06] [INFO ] Invariant cache hit.
[2025-05-30 17:22:06] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 641 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 679 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1348ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1359ms
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1701 ms. Remains : 32/33 places, 33/33 transitions.
Support contains 22 out of 32 places after structural reductions.
[2025-05-30 17:22:07] [INFO ] Flatten gal took : 6 ms
[2025-05-30 17:22:07] [INFO ] Flatten gal took : 6 ms
[2025-05-30 17:22:07] [INFO ] Input system was already deterministic with 33 transitions.
Reduction of identical properties reduced properties to check from 8 to 4
RANDOM walk for 13707 steps (3 resets) in 23 ms. (571 steps per ms) remains 0/4 properties
FORMULA CryptoMiner-COL-D10N100-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((X(F(p0)) U (p0 U p1)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2025-05-30 17:22:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:08] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-30 17:22:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:22:08] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2025-05-30 17:22:08] [INFO ] Invariant cache hit.
[2025-05-30 17:22:08] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 480 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 612 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1101ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1102ms
Finished structural reductions in LTL mode , in 1 iterations and 1176 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLFireability-00
Product exploration explored 100000 steps with 6220 reset in 213 ms.
Stack based approach found an accepted trace after 8760 steps with 535 reset with depth 29 and stack size 29 in 13 ms.
FORMULA CryptoMiner-COL-D10N100-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D10N100-LTLFireability-00 finished in 1856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U G(p1))) U (X(p0)&&G(!p2))))'
Support contains 12 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2025-05-30 17:22:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:10] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-05-30 17:22:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:22:10] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2025-05-30 17:22:10] [INFO ] Invariant cache hit.
[2025-05-30 17:22:10] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 443 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 552 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1005ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1006ms
Finished structural reductions in LTL mode , in 1 iterations and 1076 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) p2), (NOT p1), (NOT p0), p2, (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLFireability-01
Product exploration explored 100000 steps with 2021 reset in 86 ms.
Stack based approach found an accepted trace after 7944 steps with 164 reset with depth 19 and stack size 19 in 14 ms.
FORMULA CryptoMiner-COL-D10N100-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D10N100-LTLFireability-01 finished in 1445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(!p1)||(!p2 U (G(!p2)||(!p2&&(!p0 U (G(!p0)||(!p0&&G(!p1))))))))))'
Support contains 12 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2025-05-30 17:22:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:11] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-05-30 17:22:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:22:11] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 17:22:11] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2025-05-30 17:22:11] [INFO ] Invariant cache hit.
[2025-05-30 17:22:11] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 436 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 562 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1003ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1004ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1079 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (AND p1 p2)), (NOT p0), p1, (AND p1 p2), (AND p1 p2 p0), (AND p1 p0)]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLFireability-02
Product exploration explored 100000 steps with 2009 reset in 84 ms.
Stack based approach found an accepted trace after 12888 steps with 268 reset with depth 49 and stack size 49 in 26 ms.
FORMULA CryptoMiner-COL-D10N100-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D10N100-LTLFireability-02 finished in 1464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (trivial) has 20 edges and 32 vertex of which 11 / 32 are part of one of the 1 SCC in 2 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 12 ms. Remains 22 /32 variables (removed 10) and now considering 23/33 (removed 10) transitions.
// Phase 1: matrix 23 rows 22 cols
[2025-05-30 17:22:13] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-05-30 17:22:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:22:13] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 17:22:13] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2025-05-30 17:22:13] [INFO ] Invariant cache hit.
[2025-05-30 17:22:13] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/43 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/44 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/45 variables, and 32 constraints, problems are : Problem set: 0 solved, 20 unsolved in 268 ms.
Refiners :[State Equation: 22/22 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/43 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/44 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/45 variables, and 52 constraints, problems are : Problem set: 0 solved, 20 unsolved in 310 ms.
Refiners :[State Equation: 22/22 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 583ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 584ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 23/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 660 ms. Remains : 22/32 places, 23/33 transitions.
Stuttering acceptance computed with spot in 37 ms :[p0]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLFireability-03
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D10N100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D10N100-LTLFireability-03 finished in 719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0)) U (p1||X((X(G(p1)) U (X(G(p1))&&p2)))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2025-05-30 17:22:13] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:13] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-05-30 17:22:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:22:13] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2025-05-30 17:22:13] [INFO ] Invariant cache hit.
[2025-05-30 17:22:13] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 442 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 570 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1018ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1018ms
Finished structural reductions in LTL mode , in 1 iterations and 1093 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 414 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLFireability-04
Product exploration explored 100000 steps with 2052 reset in 129 ms.
Stack based approach found an accepted trace after 8244 steps with 159 reset with depth 59 and stack size 59 in 10 ms.
FORMULA CryptoMiner-COL-D10N100-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D10N100-LTLFireability-04 finished in 1670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 11 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2025-05-30 17:22:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:15] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-30 17:22:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:22:15] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2025-05-30 17:22:15] [INFO ] Invariant cache hit.
[2025-05-30 17:22:15] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 427 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 560 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 992ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 993ms
Finished structural reductions in LTL mode , in 1 iterations and 1071 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 117 ms.
Product exploration explored 100000 steps with 33333 reset in 99 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D10N100-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D10N100-LTLFireability-05 finished in 1447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (trivial) has 20 edges and 32 vertex of which 11 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 2 ms. Remains 22 /32 variables (removed 10) and now considering 23/33 (removed 10) transitions.
// Phase 1: matrix 23 rows 22 cols
[2025-05-30 17:22:16] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:16] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-05-30 17:22:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:22:16] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 17:22:16] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-05-30 17:22:16] [INFO ] Invariant cache hit.
[2025-05-30 17:22:16] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/43 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/44 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/45 variables, and 32 constraints, problems are : Problem set: 0 solved, 20 unsolved in 217 ms.
Refiners :[State Equation: 22/22 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/43 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/44 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/45 variables, and 52 constraints, problems are : Problem set: 0 solved, 20 unsolved in 267 ms.
Refiners :[State Equation: 22/22 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 488ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 488ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 23/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 541 ms. Remains : 22/32 places, 23/33 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D10N100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D10N100-LTLFireability-06 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&X(X(p0)))))'
Support contains 12 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2025-05-30 17:22:17] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:17] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-05-30 17:22:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:22:17] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2025-05-30 17:22:17] [INFO ] Invariant cache hit.
[2025-05-30 17:22:17] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 440 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 550 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 996ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 996ms
Finished structural reductions in LTL mode , in 1 iterations and 1073 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D10N100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D10N100-LTLFireability-07 finished in 1319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (X(X(X(F((!p2&&X((!p2 U (!p3||G(!p2)))))))))||p1))))'
Support contains 13 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2025-05-30 17:22:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:18] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-30 17:22:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:22:18] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2025-05-30 17:22:18] [INFO ] Invariant cache hit.
[2025-05-30 17:22:18] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 435 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 568 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1007ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1007ms
Finished structural reductions in LTL mode , in 1 iterations and 1079 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 436 ms :[(AND (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, (AND p2 p3), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2 p3)]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 191 ms.
Product exploration explored 100000 steps with 0 reset in 269 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 226 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 9 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, (AND p2 p3), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2 p3)]
Reduction of identical properties reduced properties to check from 16 to 12
RANDOM walk for 40155 steps (8 resets) in 92 ms. (431 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40000 steps (96 resets) in 352 ms. (113 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (96 resets) in 249 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (96 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 179 ms. (222 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (11 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
[2025-05-30 17:22:21] [INFO ] Invariant cache hit.
[2025-05-30 17:22:21] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
Problem apf12 is UNSAT
After SMT solving in domain Real declared 13/65 variables, and 0 constraints, problems are : Problem set: 5 solved, 0 unsolved in 17 ms.
Refiners :[State Equation: 0/32 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) p1 p2 (NOT p3))), (G (OR (NOT p0) p1 (NOT p2) (NOT p3))), (G (OR p0 p1 p2 (NOT p3))), (G (OR (NOT p0) p1 p2)), (G (OR (NOT p0) p1 (NOT p2))), (G (OR p0 p1 (NOT p2) (NOT p3))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F p2), (F (NOT p3)), (F (NOT (AND (NOT p2) p3))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 15 factoid took 587 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) p2), p2, p2, p2, (AND p2 p3)]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) p2), p2, p2, p2, (AND p2 p3)]
Support contains 12 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2025-05-30 17:22:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:22] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-05-30 17:22:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:22:22] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2025-05-30 17:22:22] [INFO ] Invariant cache hit.
[2025-05-30 17:22:22] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 460 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 565 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1029ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1030ms
Finished structural reductions in LTL mode , in 1 iterations and 1096 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p3), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) p2), p2, p2, p2, (AND p2 p3)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 24447 steps (6 resets) in 26 ms. (905 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p2) p3), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p2) p3))), (F p2), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT p3))]
Knowledge based reduction with 2 factoid took 250 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p1) p2), p2, p2, p2, (AND p2 p3)]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) p2), p2, p2, p2, (AND p2 p3)]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p1) p2), p2, p2, p2, (AND p2 p3)]
Product exploration explored 100000 steps with 0 reset in 87 ms.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Built C files in :
/tmp/ltsmin1670089478660758424
[2025-05-30 17:22:25] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1670089478660758424
Running compilation step : cd /tmp/ltsmin1670089478660758424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 234 ms.
Running link step : cd /tmp/ltsmin1670089478660758424;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin1670089478660758424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased43839997111026427.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2025-05-30 17:22:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:40] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-05-30 17:22:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:22:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:22:40] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2025-05-30 17:22:40] [INFO ] Invariant cache hit.
[2025-05-30 17:22:40] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 431 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 565 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1001ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1001ms
Finished structural reductions in LTL mode , in 1 iterations and 1086 ms. Remains : 32/32 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin5348965060040580148
[2025-05-30 17:22:41] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5348965060040580148
Running compilation step : cd /tmp/ltsmin5348965060040580148;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 109 ms.
Running link step : cd /tmp/ltsmin5348965060040580148;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5348965060040580148;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15497699647243641379.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 17:22:57] [INFO ] Flatten gal took : 3 ms
[2025-05-30 17:22:57] [INFO ] Flatten gal took : 3 ms
[2025-05-30 17:22:57] [INFO ] Time to serialize gal into /tmp/LTL11600708286739949167.gal : 1 ms
[2025-05-30 17:22:57] [INFO ] Time to serialize properties into /tmp/LTL18032127793802152539.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11600708286739949167.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13510373622158932369.hoa' '-atoms' '/tmp/LTL18032127793802152539.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL18032127793802152539.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13510373622158932369.hoa
Reverse transition relation is NOT exact ! Due to transitions t20, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, Intersection with reachable at e...220
Computing Next relation with stutter on 1.07187e+07 deadlock states
Detected timeout of ITS tools.
[2025-05-30 17:23:12] [INFO ] Flatten gal took : 3 ms
[2025-05-30 17:23:12] [INFO ] Flatten gal took : 3 ms
[2025-05-30 17:23:12] [INFO ] Time to serialize gal into /tmp/LTL4807187375166631952.gal : 1 ms
[2025-05-30 17:23:12] [INFO ] Time to serialize properties into /tmp/LTL18339244539478020527.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4807187375166631952.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18339244539478020527.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("((capacity_0>=1)&&(state_0>=1))")U(("((((capacity_0>=1)||(capacity_1>=1))||((capacity_2>=1)||(capacity_3>=1)))||(((capacity_4>=...577
Formula 0 simplified : F(!"((capacity_0>=1)&&(state_0>=1))" R (!"((((capacity_0>=1)||(capacity_1>=1))||((capacity_2>=1)||(capacity_3>=1)))||(((capacity_4>=...534
Reverse transition relation is NOT exact ! Due to transitions t20, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, Intersection with reachable at e...220
Computing Next relation with stutter on 1.07187e+07 deadlock states
Detected timeout of ITS tools.
[2025-05-30 17:23:27] [INFO ] Flatten gal took : 3 ms
[2025-05-30 17:23:27] [INFO ] Applying decomposition
[2025-05-30 17:23:27] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4361657593514219200.txt' '-o' '/tmp/graph4361657593514219200.bin' '-w' '/tmp/graph4361657593514219200.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4361657593514219200.bin' '-l' '-1' '-v' '-w' '/tmp/graph4361657593514219200.weights' '-q' '0' '-e' '0.001'
[2025-05-30 17:23:27] [INFO ] Decomposing Gal with order
[2025-05-30 17:23:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 17:23:27] [INFO ] Removed a total of 4 redundant transitions.
[2025-05-30 17:23:27] [INFO ] Flatten gal took : 15 ms
[2025-05-30 17:23:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-30 17:23:27] [INFO ] Time to serialize gal into /tmp/LTL3285555259216436311.gal : 1 ms
[2025-05-30 17:23:27] [INFO ] Time to serialize properties into /tmp/LTL17965807995354316917.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3285555259216436311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17965807995354316917.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("((i1.u3.capacity_0>=1)&&(i3.u4.state_0>=1))")U(("((((i1.u3.capacity_0>=1)||(i1.u0.capacity_1>=1))||((i1.u0.capacity_2>=1)||(i0....739
Formula 0 simplified : F(!"((i1.u3.capacity_0>=1)&&(i3.u4.state_0>=1))" R (!"((((i1.u3.capacity_0>=1)||(i1.u0.capacity_1>=1))||((i1.u0.capacity_2>=1)||(i0....690
Detected timeout of ITS tools.
Treatment of property CryptoMiner-COL-D10N100-LTLFireability-10 finished in 83447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p1)||p0))))'
Support contains 11 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2025-05-30 17:23:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:23:42] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-05-30 17:23:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:23:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:23:42] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 17:23:42] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2025-05-30 17:23:42] [INFO ] Invariant cache hit.
[2025-05-30 17:23:42] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 452 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 553 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1009ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1010ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1075 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLFireability-11
Product exploration explored 100000 steps with 1 reset in 115 ms.
Product exploration explored 100000 steps with 6 reset in 178 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 373 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40150 steps (8 resets) in 13 ms. (2867 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
[2025-05-30 17:23:44] [INFO ] Invariant cache hit.
[2025-05-30 17:23:44] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf0 is UNSAT
After SMT solving in domain Real declared 11/65 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[State Equation: 0/32 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 425 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
[2025-05-30 17:23:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 17:23:44] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-05-30 17:23:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 17:23:44] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-05-30 17:23:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:23:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2025-05-30 17:23:44] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-30 17:23:44] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2025-05-30 17:23:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:23:44] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-05-30 17:23:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:23:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:23:44] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 17:23:44] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2025-05-30 17:23:44] [INFO ] Invariant cache hit.
[2025-05-30 17:23:44] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 503 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 540 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1047ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1047ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1110 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 180 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 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 104 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 169 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2025-05-30 17:23:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 17:23:46] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-05-30 17:23:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 17:23:46] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-05-30 17:23:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:23:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2025-05-30 17:23:46] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-30 17:23:46] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 94 ms.
Product exploration explored 100000 steps with 0 reset in 123 ms.
Built C files in :
/tmp/ltsmin13338200239133787257
[2025-05-30 17:23:46] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2025-05-30 17:23:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 17:23:46] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2025-05-30 17:23:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 17:23:46] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2025-05-30 17:23:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 17:23:46] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13338200239133787257
Running compilation step : cd /tmp/ltsmin13338200239133787257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 102 ms.
Running link step : cd /tmp/ltsmin13338200239133787257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13338200239133787257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16451712983793492058.hoa' '--buchi-type=spotba'
LTSmin run took 289 ms.
FORMULA CryptoMiner-COL-D10N100-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D10N100-LTLFireability-11 finished in 5169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 21 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2025-05-30 17:23:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:23:47] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-30 17:23:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:23:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:23:47] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 17:23:47] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2025-05-30 17:23:47] [INFO ] Invariant cache hit.
[2025-05-30 17:23:47] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 440 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 536 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 980ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 980ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1048 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 113 ms.
Stack based approach found an accepted trace after 646 steps with 0 reset with depth 647 and stack size 647 in 0 ms.
FORMULA CryptoMiner-COL-D10N100-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D10N100-LTLFireability-14 finished in 1273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (X(X(X(F((!p2&&X((!p2 U (!p3||G(!p2)))))))))||p1))))'
Found a Shortening insensitive property : CryptoMiner-COL-D10N100-LTLFireability-10
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, (AND p2 p3), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2 p3)]
Support contains 13 out of 32 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2025-05-30 17:23:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:23:49] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-05-30 17:23:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:23:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:23:49] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2025-05-30 17:23:49] [INFO ] Invariant cache hit.
[2025-05-30 17:23:49] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 437 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 564 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1005ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1008ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 1062 ms. Remains : 32/32 places, 33/33 transitions.
Running random walk in product with property : CryptoMiner-COL-D10N100-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 99 ms.
Product exploration explored 100000 steps with 0 reset in 137 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 255 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 9 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(AND (NOT p1) p2), p2, (AND (NOT p1) p2), p2, p2, (AND p2 p3), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2 p3)]
Reduction of identical properties reduced properties to check from 16 to 12
RANDOM walk for 40184 steps (12 resets) in 18 ms. (2114 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40000 steps (96 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (96 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (96 resets) in 35 ms. (1111 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
[2025-05-30 17:23:51] [INFO ] Invariant cache hit.
[2025-05-30 17:23:51] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
Problem apf12 is UNSAT
After SMT solving in domain Real declared 13/65 variables, and 0 constraints, problems are : Problem set: 5 solved, 0 unsolved in 16 ms.
Refiners :[State Equation: 0/32 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) p1 p2 (NOT p3))), (G (OR (NOT p0) p1 (NOT p2) (NOT p3))), (G (OR p0 p1 p2 (NOT p3))), (G (OR (NOT p0) p1 p2)), (G (OR (NOT p0) p1 (NOT p2))), (G (OR p0 p1 (NOT p2) (NOT p3))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F p2), (F (NOT p3)), (F (NOT (AND (NOT p2) p3))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 15 factoid took 546 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) p2), p2, p2, p2, (AND p2 p3)]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) p2), p2, p2, p2, (AND p2 p3)]
Support contains 12 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2025-05-30 17:23:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:23:52] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-30 17:23:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:23:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:23:52] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2025-05-30 17:23:52] [INFO ] Invariant cache hit.
[2025-05-30 17:23:52] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 471 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 560 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1035ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1035ms
Finished structural reductions in LTL mode , in 1 iterations and 1100 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p3), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) p2), p2, p2, p2, (AND p2 p3)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 16258 steps (5 resets) in 8 ms. (1806 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p2) p3), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p2) p3))), (F p2), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT p3))]
Knowledge based reduction with 2 factoid took 220 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) p2), p2, p2, p2, (AND p2 p3)]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) p2), p2, p2, p2, (AND p2 p3)]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) p2), p2, p2, p2, (AND p2 p3)]
Product exploration explored 100000 steps with 0 reset in 99 ms.
Product exploration explored 100000 steps with 0 reset in 142 ms.
Built C files in :
/tmp/ltsmin15764012724359593365
[2025-05-30 17:23:54] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15764012724359593365
Running compilation step : cd /tmp/ltsmin15764012724359593365;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 101 ms.
Running link step : cd /tmp/ltsmin15764012724359593365;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15764012724359593365;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6458004407709703292.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2025-05-30 17:24:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:24:09] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-05-30 17:24:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:24:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:24:09] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2025-05-30 17:24:09] [INFO ] Invariant cache hit.
[2025-05-30 17:24:09] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 419 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 558 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 980ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 980ms
Finished structural reductions in LTL mode , in 1 iterations and 1046 ms. Remains : 32/32 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin5356854520654130711
[2025-05-30 17:24:10] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5356854520654130711
Running compilation step : cd /tmp/ltsmin5356854520654130711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 102 ms.
Running link step : cd /tmp/ltsmin5356854520654130711;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5356854520654130711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7388928950185771582.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 17:24:26] [INFO ] Flatten gal took : 3 ms
[2025-05-30 17:24:26] [INFO ] Flatten gal took : 2 ms
[2025-05-30 17:24:26] [INFO ] Time to serialize gal into /tmp/LTL4004068349818808736.gal : 1 ms
[2025-05-30 17:24:26] [INFO ] Time to serialize properties into /tmp/LTL2037277010554606437.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4004068349818808736.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4143222151500909439.hoa' '-atoms' '/tmp/LTL2037277010554606437.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2037277010554606437.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4143222151500909439.hoa
Reverse transition relation is NOT exact ! Due to transitions t20, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, Intersection with reachable at e...220
Computing Next relation with stutter on 1.07187e+07 deadlock states
Detected timeout of ITS tools.
[2025-05-30 17:24:41] [INFO ] Flatten gal took : 3 ms
[2025-05-30 17:24:41] [INFO ] Flatten gal took : 2 ms
[2025-05-30 17:24:41] [INFO ] Time to serialize gal into /tmp/LTL3349886586218629863.gal : 1 ms
[2025-05-30 17:24:41] [INFO ] Time to serialize properties into /tmp/LTL7571765040331714087.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3349886586218629863.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7571765040331714087.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("((capacity_0>=1)&&(state_0>=1))")U(("((((capacity_0>=1)||(capacity_1>=1))||((capacity_2>=1)||(capacity_3>=1)))||(((capacity_4>=...577
Formula 0 simplified : F(!"((capacity_0>=1)&&(state_0>=1))" R (!"((((capacity_0>=1)||(capacity_1>=1))||((capacity_2>=1)||(capacity_3>=1)))||(((capacity_4>=...534
Reverse transition relation is NOT exact ! Due to transitions t20, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, Intersection with reachable at e...220
Computing Next relation with stutter on 1.07187e+07 deadlock states
Detected timeout of ITS tools.
[2025-05-30 17:24:56] [INFO ] Flatten gal took : 2 ms
[2025-05-30 17:24:56] [INFO ] Applying decomposition
[2025-05-30 17:24:56] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4748087100229492348.txt' '-o' '/tmp/graph4748087100229492348.bin' '-w' '/tmp/graph4748087100229492348.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4748087100229492348.bin' '-l' '-1' '-v' '-w' '/tmp/graph4748087100229492348.weights' '-q' '0' '-e' '0.001'
[2025-05-30 17:24:56] [INFO ] Decomposing Gal with order
[2025-05-30 17:24:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 17:24:56] [INFO ] Removed a total of 3 redundant transitions.
[2025-05-30 17:24:56] [INFO ] Flatten gal took : 4 ms
[2025-05-30 17:24:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-30 17:24:56] [INFO ] Time to serialize gal into /tmp/LTL3746555390506231753.gal : 1 ms
[2025-05-30 17:24:56] [INFO ] Time to serialize properties into /tmp/LTL8236574618789192608.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3746555390506231753.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8236574618789192608.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("((i4.u3.capacity_0>=1)&&(i2.u4.state_0>=1))")U(("((((i4.u3.capacity_0>=1)||(i4.u0.capacity_1>=1))||((i4.u0.capacity_2>=1)||(i4....739
Formula 0 simplified : F(!"((i4.u3.capacity_0>=1)&&(i2.u4.state_0>=1))" R (!"((((i4.u3.capacity_0>=1)||(i4.u0.capacity_1>=1))||((i4.u0.capacity_2>=1)||(i4....690
Detected timeout of ITS tools.
Treatment of property CryptoMiner-COL-D10N100-LTLFireability-10 finished in 82583 ms.
[2025-05-30 17:25:11] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4197217906891391700
[2025-05-30 17:25:11] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2025-05-30 17:25:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 17:25:11] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2025-05-30 17:25:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 17:25:11] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2025-05-30 17:25:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 17:25:11] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4197217906891391700
Running compilation step : cd /tmp/ltsmin4197217906891391700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 17:25:11] [INFO ] Applying decomposition
[2025-05-30 17:25:11] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11877126944555470225.txt' '-o' '/tmp/graph11877126944555470225.bin' '-w' '/tmp/graph11877126944555470225.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11877126944555470225.bin' '-l' '-1' '-v' '-w' '/tmp/graph11877126944555470225.weights' '-q' '0' '-e' '0.001'
[2025-05-30 17:25:11] [INFO ] Decomposing Gal with order
[2025-05-30 17:25:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 17:25:11] [INFO ] Removed a total of 4 redundant transitions.
[2025-05-30 17:25:11] [INFO ] Flatten gal took : 3 ms
[2025-05-30 17:25:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-30 17:25:11] [INFO ] Time to serialize gal into /tmp/LTLFireability15437979501184772271.gal : 1 ms
[2025-05-30 17:25:11] [INFO ] Time to serialize properties into /tmp/LTLFireability16599924137976763956.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15437979501184772271.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16599924137976763956.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(("((u3.capacity_0>=1)&&(i2.u4.state_0>=1))")U(("((((u3.capacity_0>=1)||(i0.u0.capacity_1>=1))||((i0.u0.capacity_2>=1)||(i0.u0.cap...718
Formula 0 simplified : F(!"((u3.capacity_0>=1)&&(i2.u4.state_0>=1))" R (!"((((u3.capacity_0>=1)||(i0.u0.capacity_1>=1))||((i0.u0.capacity_2>=1)||(i0.u0.cap...669
Compilation finished in 104 ms.
Running link step : cd /tmp/ltsmin4197217906891391700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin4197217906891391700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U (X(X(X(<>((!(LTLAPp2==true)&&X((!(LTLAPp2==true) U (!(LTLAPp3==true)||[](!(LTLAPp2==true))))))))))||(LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: LTL layer: formula: [](((LTLAPp0==true) U (X(X(X(<>((!(LTLAPp2==true)&&X((!(LTLAPp2==true) U (!(LTLAPp3==true)||[](!(LTLAPp2==true))))))))))||(LTLAPp1==true))))
pins2lts-mc-linux64( 4/ 8), 0.001: "[](((LTLAPp0==true) U (X(X(X(<>((!(LTLAPp2==true)&&X((!(LTLAPp2==true) U (!(LTLAPp3==true)||[](!(LTLAPp2==true))))))))))||(LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.046: There are 38 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.046: State length is 33, there are 60 groups
pins2lts-mc-linux64( 0/ 8), 0.046: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.046: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.046: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.046: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.130: [Blue] ~120 levels ~960 states ~2928 transitions
pins2lts-mc-linux64( 3/ 8), 0.185: [Blue] ~240 levels ~1920 states ~5720 transitions
pins2lts-mc-linux64( 3/ 8), 0.291: [Blue] ~480 levels ~3840 states ~11096 transitions
pins2lts-mc-linux64( 7/ 8), 0.448: [Blue] ~883 levels ~7680 states ~28568 transitions
pins2lts-mc-linux64( 1/ 8), 0.632: [Blue] ~1909 levels ~15360 states ~49184 transitions
pins2lts-mc-linux64( 0/ 8), 0.999: [Blue] ~3815 levels ~30720 states ~108296 transitions
pins2lts-mc-linux64( 0/ 8), 1.648: [Blue] ~7633 levels ~61440 states ~227000 transitions
pins2lts-mc-linux64( 4/ 8), 2.582: [Blue] ~15050 levels ~122880 states ~539480 transitions
pins2lts-mc-linux64( 4/ 8), 4.069: [Blue] ~30184 levels ~245760 states ~1171544 transitions
pins2lts-mc-linux64( 4/ 8), 5.797: [Blue] ~60619 levels ~491520 states ~2528280 transitions
pins2lts-mc-linux64( 4/ 8), 7.426: [Blue] ~121425 levels ~983040 states ~4686880 transitions
pins2lts-mc-linux64( 4/ 8), 9.411: [Blue] ~243688 levels ~1966080 states ~10296600 transitions
pins2lts-mc-linux64( 4/ 8), 13.878: [Blue] ~488713 levels ~3932160 states ~22112024 transitions
pins2lts-mc-linux64( 6/ 8), 23.319: [Blue] ~981614 levels ~7864320 states ~45958800 transitions
pins2lts-mc-linux64( 6/ 8), 40.740: [Blue] ~1964309 levels ~15728640 states ~97996248 transitions
pins2lts-mc-linux64( 4/ 8), 62.376: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 62.414:
pins2lts-mc-linux64( 0/ 8), 62.414: Explored 22296159 states 145456408 transitions, fanout: 6.524
pins2lts-mc-linux64( 0/ 8), 62.414: Total exploration time 62.350 sec (62.310 sec minimum, 62.325 sec on average)
pins2lts-mc-linux64( 0/ 8), 62.414: States per second: 357597, Transitions per second: 2332902
pins2lts-mc-linux64( 0/ 8), 62.414:
pins2lts-mc-linux64( 0/ 8), 62.414: State space has 34318547 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 62.414: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 62.414: blue states: 22296159 (64.97%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 62.414: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 62.414: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 62.414:
pins2lts-mc-linux64( 0/ 8), 62.414: Total memory used for local state coloring: 301.1MB
pins2lts-mc-linux64( 0/ 8), 62.414:
pins2lts-mc-linux64( 0/ 8), 62.414: Queue width: 8B, total height: 19734711, memory: 150.56MB
pins2lts-mc-linux64( 0/ 8), 62.414: Tree memory: 517.8MB, 15.8 B/state, compr.: 11.8%
pins2lts-mc-linux64( 0/ 8), 62.414: Tree fill ratio (roots/leafs): 25.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 62.414: Stored 33 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 62.414: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 62.414: Est. total memory use: 668.4MB (~1174.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4197217906891391700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U (X(X(X(<>((!(LTLAPp2==true)&&X((!(LTLAPp2==true) U (!(LTLAPp3==true)||[](!(LTLAPp2==true))))))))))||(LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4197217906891391700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U (X(X(X(<>((!(LTLAPp2==true)&&X((!(LTLAPp2==true) U (!(LTLAPp3==true)||[](!(LTLAPp2==true))))))))))||(LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-05-30 17:46:13] [INFO ] Applying decomposition
[2025-05-30 17:46:13] [INFO ] Flatten gal took : 2 ms
[2025-05-30 17:46:13] [INFO ] Decomposing Gal with order
[2025-05-30 17:46:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 17:46:13] [INFO ] Flatten gal took : 5 ms
[2025-05-30 17:46:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-30 17:46:13] [INFO ] Time to serialize gal into /tmp/LTLFireability16751778025339796007.gal : 1 ms
[2025-05-30 17:46:13] [INFO ] Time to serialize properties into /tmp/LTLFireability5704683618247946585.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16751778025339796007.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5704683618247946585.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("((CD0.capacity_0>=1)&&(CD0.state_0>=1))")U(("((((CD0.capacity_0>=1)||(CD1.capacity_1>=1))||((CD2.capacity_2>=1)||(CD3.capacity_...690
Formula 0 simplified : F(!"((CD0.capacity_0>=1)&&(CD0.state_0>=1))" R (!"((((CD0.capacity_0>=1)||(CD1.capacity_1>=1))||((CD2.capacity_2>=1)||(CD3.capacity_...642
Reverse transition relation is NOT exact ! Due to transitions t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, CD10.t20, CD10.t32, Intersection with reac...230
Computing Next relation with stutter on 1.07187e+07 deadlock states
Detected timeout of ITS tools.
[2025-05-30 18:07:15] [INFO ] Flatten gal took : 6 ms
[2025-05-30 18:07:15] [INFO ] Input system was already deterministic with 33 transitions.
[2025-05-30 18:07:15] [INFO ] Transformed 32 places.
[2025-05-30 18:07:15] [INFO ] Transformed 33 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-30 18:07:15] [INFO ] Time to serialize gal into /tmp/LTLFireability13593131082940392224.gal : 0 ms
[2025-05-30 18:07:15] [INFO ] Time to serialize properties into /tmp/LTLFireability8599540597078618871.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13593131082940392224.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8599540597078618871.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("((capacity_0>=1)&&(state_0>=1))")U(("((((capacity_0>=1)||(capacity_1>=1))||((capacity_2>=1)||(capacity_3>=1)))||(((capacity_4>=...577
Formula 0 simplified : F(!"((capacity_0>=1)&&(state_0>=1))" R (!"((((capacity_0>=1)||(capacity_1>=1))||((capacity_2>=1)||(capacity_3>=1)))||(((capacity_4>=...534
Reverse transition relation is NOT exact ! Due to transitions t20, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, Intersection with reachable at e...220
Computing Next relation with stutter on 1.07187e+07 deadlock states
7 unique states visited
0 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
6637 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,66.3846,747468,1,0,90,3.93067e+06,121,49,2400,3.94743e+06,122
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CryptoMiner-COL-D10N100-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 2781096 ms.

BK_STOP 1748628506374

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CryptoMiner-COL-D10N100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854028800604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-COL-D10N100.tgz
mv CryptoMiner-COL-D10N100 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;