fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r066-tall-177946967800635
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for CryptoMiner-PT-D03N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9727.155 1947921.00 3751640.00 24029.30 FFFFTFTTFFTFFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967800635.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is CryptoMiner-PT-D03N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967800635
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 12K Mar 6 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 6 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 6 13:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 13:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Mar 15 08:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 15 08:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 15 08:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 13:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 6 13:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 6 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Mar 6 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Mar 15 08:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 5.3K Mar 3 18:30 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-PT-D03N100-LTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779559736095

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D03N100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 18:08:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 18:08:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 18:08:57] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2026-05-23 18:08:57] [INFO ] Transformed 12 places.
[2026-05-23 18:08:57] [INFO ] Transformed 12 transitions.
[2026-05-23 18:08:57] [INFO ] Parsed PT model containing 12 places and 12 transitions and 34 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 5 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9493766428637571275.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2474347963638623395.kers'
[2026-05-23 18:08:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9493766428637571275.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2474347963638623395.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 12 cols 26 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-23 18:08:57] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2474347963638623395.kers
Total runtime 0 ms.
[2026-05-23 18:08:57] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-23 18:08:57] [INFO ] Invariant cache hit.
[2026-05-23 18:08:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:08:57] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2026-05-23 18:08:57] [INFO ] Invariant cache hit.
[2026-05-23 18:08:57] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 426ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 436ms
Finished structural reductions in LTL mode , in 1 iterations and 693 ms. Remains : 12/12 places, 12/12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2026-05-23 18:08:58] [INFO ] Invariant cache hit.
[2026-05-23 18:08:58] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-23 18:08:58] [INFO ] Invariant cache hit.
[2026-05-23 18:08:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:08:58] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places after structural reductions.
[2026-05-23 18:08:58] [INFO ] Flatten gal took : 13 ms
[2026-05-23 18:08:58] [INFO ] Flatten gal took : 4 ms
[2026-05-23 18:08:58] [INFO ] Input system was already deterministic with 12 transitions.
RANDOM walk for 40064 steps (8 resets) in 142 ms. (280 steps per ms) remains 12/33 properties
BEST_FIRST walk for 40002 steps (8 resets) in 239 ms. (166 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (12 resets) in 136 ms. (291 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (12 resets) in 188 ms. (211 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
[2026-05-23 18:08:58] [INFO ] Invariant cache hit.
[2026-05-23 18:08:58] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 4/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 3 (OVERLAPS) 12/24 variables, 12/13 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 3/16 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 5 solved, 2 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/21 variables, 10/11 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 2/13 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 1/14 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/24 variables, 2/16 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/17 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 1/18 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/24 variables, 0/18 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/24 variables, 0/18 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 18 constraints, problems are : Problem set: 5 solved, 2 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 5 solved, 2 unsolved
Finished Parikh walk after 78 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=78 )
Parikh walk visited 2 properties in 11 ms.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2026-05-23 18:08:59] [INFO ] Invariant cache hit.
[2026-05-23 18:08:59] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-23 18:08:59] [INFO ] Invariant cache hit.
[2026-05-23 18:08:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:08:59] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 12/12 places, 12/12 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-01 finished in 349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p0)))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 4 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4973386829706861574.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3766348244533176537.kers'
[2026-05-23 18:08:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4973386829706861574.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3766348244533176537.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 11 cols 25 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-23 18:08:59] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3766348244533176537.kers
Total runtime 0 ms.
[2026-05-23 18:08:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-23 18:08:59] [INFO ] Invariant cache hit.
[2026-05-23 18:08:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:08:59] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2026-05-23 18:08:59] [INFO ] Invariant cache hit.
[2026-05-23 18:08:59] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 91 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 98 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 193ms
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 11/12 places, 12/12 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p0)))))'
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 180 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 1 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-03 finished in 560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||X(p1)||F(p2))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 0 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
[2026-05-23 18:09:00] [INFO ] Invariant cache hit.
[2026-05-23 18:09:00] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-23 18:09:00] [INFO ] Invariant cache hit.
[2026-05-23 18:09:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:09:00] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 11/12 places, 12/12 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1)||F(p2))))'
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 12 ms. Proved property starting from automaton with 4 states, 4 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 16 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-04 finished in 432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((p0 U !p1)&&X(p2)))&&X(X(X(G(p3))))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4936560627298897218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5359192638144498222.kers'
[2026-05-23 18:09:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4936560627298897218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5359192638144498222.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 12 cols 26 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-23 18:09:00] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5359192638144498222.kers
Total runtime 0 ms.
[2026-05-23 18:09:00] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-23 18:09:00] [INFO ] Invariant cache hit.
[2026-05-23 18:09:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:09:00] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2026-05-23 18:09:00] [INFO ] Invariant cache hit.
[2026-05-23 18:09:00] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 306ms
Finished structural reductions in LTL mode , in 1 iterations and 411 ms. Remains : 12/12 places, 12/12 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((p0 U !p1)&&X(p2)))&&X(X(X(G(p3))))))'
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p2) (NOT p3) p1), (OR (NOT p2) p1), (NOT p3), (NOT p2), p1, (NOT p3), (NOT p3), true]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-05
Product exploration explored 100000 steps with 1 reset in 85 ms.
Product exploration explored 100000 steps with 0 reset in 239 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 17 factoid took 108 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 7080 steps (2 resets) in 8 ms. (786 steps per ms) remains 0/1 properties
Knowledge based reduction with 17 factoid took 129 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Knowledge-based reduction took 403 ms.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 8 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2026-05-23 18:09:02] [INFO ] Invariant cache hit.
[2026-05-23 18:09:02] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-23 18:09:02] [INFO ] Invariant cache hit.
[2026-05-23 18:09:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:09:02] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 12/12 places, 12/12 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 13658 steps (3 resets) in 7 ms. (1707 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 44 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Knowledge-based reduction took 306 ms.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 73 ms.
Product exploration explored 100000 steps with 0 reset in 112 ms.
Spot run failed in 71 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin908979426471605621
[2026-05-23 18:09:03] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin908979426471605621
Running compilation step : cd /tmp/ltsmin908979426471605621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 194 ms.
Running link step : cd /tmp/ltsmin908979426471605621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin908979426471605621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased16182052257039739119.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2026-05-23 18:09:18] [INFO ] Invariant cache hit.
[2026-05-23 18:09:18] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-23 18:09:18] [INFO ] Invariant cache hit.
[2026-05-23 18:09:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:09:18] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 12/12 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin8700445083423447540
[2026-05-23 18:09:18] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8700445083423447540
Running compilation step : cd /tmp/ltsmin8700445083423447540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin8700445083423447540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8700445083423447540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased6139038185250990705.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 18:09:33] [INFO ] Flatten gal took : 2 ms
[2026-05-23 18:09:33] [INFO ] Flatten gal took : 4 ms
[2026-05-23 18:09:33] [INFO ] Time to serialize gal into /tmp/LTL3790073498501882990.gal : 1 ms
[2026-05-23 18:09:33] [INFO ] Time to serialize properties into /tmp/LTL9293398392428496527.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3790073498501882990.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10677019350743814478.hoa' '-atoms' '/tmp/LTL9293398392428496527.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9293398392428496527.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10677019350743814478.hoa
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, Intersection with reachable at each step enabled. (destroyed/reverse/interse...174
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2026-05-23 18:09:48] [INFO ] Flatten gal took : 2 ms
[2026-05-23 18:09:48] [INFO ] Flatten gal took : 2 ms
[2026-05-23 18:09:48] [INFO ] Time to serialize gal into /tmp/LTL14220796907573437520.gal : 1 ms
[2026-05-23 18:09:48] [INFO ] Time to serialize properties into /tmp/LTL924985766843938294.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14220796907573437520.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL924985766843938294.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F((("(((resource_c0+resource_c1)+(resource_c2+resource_c3))>=1)")U("(((state_c0+state_c1)+(state_c2+state_c3))<=((capacity_c0+capa...393
Formula 0 simplified : G((!"(((resource_c0+resource_c1)+(resource_c2+resource_c3))>=1)" R !"(((state_c0+state_c1)+(state_c2+state_c3))<=((capacity_c0+capac...378
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, Intersection with reachable at each step enabled. (destroyed/reverse/interse...174
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2026-05-23 18:10:03] [INFO ] Flatten gal took : 2 ms
[2026-05-23 18:10:03] [INFO ] Applying decomposition
[2026-05-23 18:10:03] [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.202604301425/bin/convert-linux64' '-i' '/tmp/graph17920261500042374181.txt' '-o' '/tmp/graph17920261500042374181.bin' '-w' '/tmp/graph17920261500042374181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17920261500042374181.bin' '-l' '-1' '-v' '-w' '/tmp/graph17920261500042374181.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:10:03] [INFO ] Decomposing Gal with order
[2026-05-23 18:10:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:10:03] [INFO ] Flatten gal took : 55 ms
[2026-05-23 18:10:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-23 18:10:03] [INFO ] Time to serialize gal into /tmp/LTL5089287312710299808.gal : 1 ms
[2026-05-23 18:10:03] [INFO ] Time to serialize properties into /tmp/LTL9575958689319441181.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5089287312710299808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9575958689319441181.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F((("(((gu1.resource_c0+gu1.resource_c1)+(gu1.resource_c2+gu1.resource_c3))>=1)")U("(((gi0.gu2.state_c0+gi0.gu2.state_c1)+(gi0.gu2...553
Formula 0 simplified : G((!"(((gu1.resource_c0+gu1.resource_c1)+(gu1.resource_c2+gu1.resource_c3))>=1)" R !"(((gi0.gu2.state_c0+gi0.gu2.state_c1)+(gi0.gu2....538
Reverse transition relation is NOT exact ! Due to transitions gi0.gu2.t4, gi0.gu2.t5, gi0.gu2.t6, gi0.gu2.t7, Intersection with reachable at each step ena...206
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-05 finished in 78013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p1&&X((p1 U X(p1))))) U X(G(!p1))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 2 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9368645341760244470.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4007137591541583869.kers'
[2026-05-23 18:10:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9368645341760244470.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4007137591541583869.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 11 cols 25 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-23 18:10:18] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4007137591541583869.kers
Total runtime 0 ms.
[2026-05-23 18:10:18] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-23 18:10:18] [INFO ] Invariant cache hit.
[2026-05-23 18:10:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:10:18] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2026-05-23 18:10:18] [INFO ] Invariant cache hit.
[2026-05-23 18:10:18] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 105 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 99 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 220ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 220ms
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 271 ms. Remains : 11/12 places, 12/12 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p1&&X((p1 U X(p1))))) U X(G(!p1))))'
Stuttering acceptance computed with spot in 280 ms :[p1, false, p1, true, false, (NOT p1), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 73 ms.
Product exploration explored 100000 steps with 0 reset in 118 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 12 factoid took 59 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
RANDOM walk for 40078 steps (10 resets) in 29 ms. (1335 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40000 steps (96 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
[2026-05-23 18:10:19] [INFO ] Invariant cache hit.
[2026-05-23 18:10:19] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/23 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Int declared 8/23 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[State Equation: 0/11 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 13 factoid took 123 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[p1, false, p1, true, (NOT p1), false]
Knowledge-based reduction took 497 ms.
Stuttering acceptance computed with spot in 241 ms :[p1, false, p1, true, (NOT p1), false]
Support contains 8 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2026-05-23 18:10:20] [INFO ] Invariant cache hit.
[2026-05-23 18:10:20] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-23 18:10:20] [INFO ] Invariant cache hit.
[2026-05-23 18:10:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:10:20] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-23 18:10:20] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 14 factoid took 58 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
RANDOM walk for 40074 steps (10 resets) in 89 ms. (445 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40000 steps (96 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
[2026-05-23 18:10:20] [INFO ] Invariant cache hit.
[2026-05-23 18:10:20] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/23 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 8/23 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[State Equation: 0/11 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 15 factoid took 127 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[p1, p1, true]
Knowledge-based reduction took 379 ms.
Stuttering acceptance computed with spot in 92 ms :[p1, p1, true]
Stuttering acceptance computed with spot in 94 ms :[p1, p1, true]
Product exploration explored 100000 steps with 0 reset in 77 ms.
Product exploration explored 100000 steps with 0 reset in 97 ms.
Built C files in :
/tmp/ltsmin13244661730991423793
[2026-05-23 18:10:21] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2026-05-23 18:10:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 18:10:21] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2026-05-23 18:10:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 18:10:21] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2026-05-23 18:10:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 18:10:21] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13244661730991423793
Running compilation step : cd /tmp/ltsmin13244661730991423793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 81 ms.
Running link step : cd /tmp/ltsmin13244661730991423793;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13244661730991423793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5182684160742563055.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2026-05-23 18:10:36] [INFO ] Invariant cache hit.
[2026-05-23 18:10:36] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-23 18:10:36] [INFO ] Invariant cache hit.
[2026-05-23 18:10:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:10:36] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2026-05-23 18:10:36] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin2001898406041222214
[2026-05-23 18:10:36] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2026-05-23 18:10:36] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 18:10:36] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2026-05-23 18:10:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 18:10:36] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2026-05-23 18:10:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 18:10:36] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2001898406041222214
Running compilation step : cd /tmp/ltsmin2001898406041222214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin2001898406041222214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2001898406041222214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14220366114458696632.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 18:10:51] [INFO ] Flatten gal took : 1 ms
[2026-05-23 18:10:51] [INFO ] Flatten gal took : 1 ms
[2026-05-23 18:10:51] [INFO ] Time to serialize gal into /tmp/LTL14612879701274988736.gal : 1 ms
[2026-05-23 18:10:51] [INFO ] Time to serialize properties into /tmp/LTL4942288511048953952.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14612879701274988736.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11463942780558457805.hoa' '-atoms' '/tmp/LTL4942288511048953952.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4942288511048953952.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11463942780558457805.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t7, Intersection with reachable at each step enabled. (destroyed/reverse/int...178
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2026-05-23 18:11:06] [INFO ] Flatten gal took : 3 ms
[2026-05-23 18:11:06] [INFO ] Flatten gal took : 1 ms
[2026-05-23 18:11:06] [INFO ] Time to serialize gal into /tmp/LTL10174604642013157191.gal : 0 ms
[2026-05-23 18:11:06] [INFO ] Time to serialize properties into /tmp/LTL9466981889068039709.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10174604642013157191.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9466981889068039709.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("(((state_c0+state_c1)+(state_c2+state_c3))>=1)")||(("(((state_c0+state_c1)+(state_c2+state_c3))>((capacity_c0+capacity_c1)+(capa...505
Formula 0 simplified : (!"(((state_c0+state_c1)+(state_c2+state_c3))>=1)" & (!"(((state_c0+state_c1)+(state_c2+state_c3))>((capacity_c0+capacity_c1)+(capac...495
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t7, Intersection with reachable at each step enabled. (destroyed/reverse/int...178
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2026-05-23 18:11:21] [INFO ] Flatten gal took : 2 ms
[2026-05-23 18:11:21] [INFO ] Applying decomposition
[2026-05-23 18:11:21] [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.202604301425/bin/convert-linux64' '-i' '/tmp/graph5419148963090726093.txt' '-o' '/tmp/graph5419148963090726093.bin' '-w' '/tmp/graph5419148963090726093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5419148963090726093.bin' '-l' '-1' '-v' '-w' '/tmp/graph5419148963090726093.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:11:21] [INFO ] Decomposing Gal with order
[2026-05-23 18:11:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:11:21] [INFO ] Flatten gal took : 1 ms
[2026-05-23 18:11:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-23 18:11:21] [INFO ] Time to serialize gal into /tmp/LTL2487700658669218889.gal : 0 ms
[2026-05-23 18:11:21] [INFO ] Time to serialize properties into /tmp/LTL4671368757787261780.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2487700658669218889.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4671368757787261780.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((("(((gi0.gu2.state_c0+gi0.gu2.state_c1)+(gi0.gu2.state_c2+gi0.gu2.state_c3))>=1)")||(("(((gi0.gu2.state_c0+gi0.gu2.state_c1)+(gi0....793
Formula 0 simplified : (!"(((gi0.gu2.state_c0+gi0.gu2.state_c1)+(gi0.gu2.state_c2+gi0.gu2.state_c3))>=1)" & (!"(((gi0.gu2.state_c0+gi0.gu2.state_c1)+(gi0.g...783
Reverse transition relation is NOT exact ! Due to transitions gi0.gu2.t4, gi0.gu2.t5, gi0.gu2.t6, gi0.gu2.t7, t2, Intersection with reachable at each step...210
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-07 finished in 77593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11848526634155329097.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2800498274180688029.kers'
[2026-05-23 18:11:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11848526634155329097.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2800498274180688029.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 12 cols 26 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-23 18:11:36] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2800498274180688029.kers
Total runtime 0 ms.
[2026-05-23 18:11:36] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-23 18:11:36] [INFO ] Invariant cache hit.
[2026-05-23 18:11:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:11:36] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2026-05-23 18:11:36] [INFO ] Invariant cache hit.
[2026-05-23 18:11:36] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 244ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 245ms
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 12/12 places, 12/12 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 69 ms.
Product exploration explored 100000 steps with 0 reset in 98 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/12 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 61 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40057 steps (9 resets) in 25 ms. (1540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3677029 steps, run visited all 1 properties in 2201 ms. (steps per millisecond=1670 )
Probabilistic random walk after 3677029 steps, saw 741541 distinct states, run finished after 2203 ms. (steps per millisecond=1669 ) properties seen :1
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 4 factoid took 47 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 2354 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-08 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-08 finished in 2934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&G(p1))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17635763668133674317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9081798149545386233.kers'
[2026-05-23 18:11:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17635763668133674317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9081798149545386233.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 11 cols 25 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-23 18:11:39] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9081798149545386233.kers
Total runtime 1 ms.
[2026-05-23 18:11:39] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-23 18:11:39] [INFO ] Invariant cache hit.
[2026-05-23 18:11:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:11:39] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2026-05-23 18:11:39] [INFO ] Invariant cache hit.
[2026-05-23 18:11:39] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 80 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 86 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 168ms
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 11/12 places, 12/12 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&G(p1))))'
Stuttering acceptance computed with spot in 236 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-09 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X(p1)&&F(p2))))'
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 0 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
[2026-05-23 18:11:39] [INFO ] Invariant cache hit.
[2026-05-23 18:11:39] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-23 18:11:39] [INFO ] Invariant cache hit.
[2026-05-23 18:11:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:11:39] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 11/12 places, 12/12 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X(p1)&&F(p2))))'
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 48 ms.
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 12 ms. Proved property starting from automaton with 5 states, 10 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 13 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-10 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 7 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 10 ms. Remains 9 /12 variables (removed 3) and now considering 9/12 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7357497528865586619.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13237225082781967276.kers'
[2026-05-23 18:11:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7357497528865586619.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13237225082781967276.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 9 cols 18 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-23 18:11:40] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13237225082781967276.kers
Total runtime 0 ms.
[2026-05-23 18:11:40] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-23 18:11:40] [INFO ] Invariant cache hit.
[2026-05-23 18:11:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:11:40] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2026-05-23 18:11:40] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-23 18:11:40] [INFO ] Invariant cache hit.
[2026-05-23 18:11:40] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/17 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/17 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 147ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/12 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 9/12 places, 9/12 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-11 finished in 256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((p0||X(F((p0&&F(p1)))))) U X(X(p1))))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11334402476983866018.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5311995103426403025.kers'
[2026-05-23 18:11:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11334402476983866018.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5311995103426403025.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 11 cols 25 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-23 18:11:40] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5311995103426403025.kers
Total runtime 0 ms.
[2026-05-23 18:11:40] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-23 18:11:40] [INFO ] Invariant cache hit.
[2026-05-23 18:11:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:11:40] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2026-05-23 18:11:40] [INFO ] Invariant cache hit.
[2026-05-23 18:11:40] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 118 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 103 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 224ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 224ms
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 11/12 places, 12/12 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((p0||X(F((p0&&F(p1)))))) U X(X(p1))))))'
Stuttering acceptance computed with spot in 345 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-12
Product exploration explored 100000 steps with 5 reset in 60 ms.
Stack based approach found an accepted trace after 49 steps with 4 reset with depth 17 and stack size 17 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-12 finished in 704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U p1)) U X((p1||F(G((F(p2) U p3))))))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7104734332770649106.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5664285416522034462.kers'
[2026-05-23 18:11:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7104734332770649106.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5664285416522034462.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 12 cols 26 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-23 18:11:41] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5664285416522034462.kers
Total runtime 0 ms.
[2026-05-23 18:11:41] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-23 18:11:41] [INFO ] Invariant cache hit.
[2026-05-23 18:11:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:11:41] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2026-05-23 18:11:41] [INFO ] Invariant cache hit.
[2026-05-23 18:11:41] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 214ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 214ms
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 12/12 places, 12/12 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U p1)) U X((p1||F(G((F(p2) U p3))))))))'
Stuttering acceptance computed with spot in 649 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2) (NOT p1) p0), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1) p0), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-13
Product exploration explored 100000 steps with 7 reset in 69 ms.
Product exploration explored 100000 steps with 3 reset in 120 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/12 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 16 factoid took 161 ms. Reduced automaton from 16 states, 54 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40052 steps (8 resets) in 16 ms. (2356 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 24 ms. (1600 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 27 ms. (1428 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
[2026-05-23 18:11:42] [INFO ] Invariant cache hit.
[2026-05-23 18:11:42] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/19 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 5/24 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 4 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/19 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 5/24 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 20 constraints, problems are : Problem set: 0 solved, 4 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 183 steps, including 9 resets, run visited all 4 properties in 5 ms. (steps per millisecond=36 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 5 ms.
Knowledge based reduction with 16 factoid took 193 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
Knowledge-based reduction took 846 ms.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
Support contains 5 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2026-05-23 18:11:43] [INFO ] Invariant cache hit.
[2026-05-23 18:11:43] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-23 18:11:43] [INFO ] Invariant cache hit.
[2026-05-23 18:11:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:11:43] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 12/12 places, 12/12 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40068 steps (10 resets) in 14 ms. (2671 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 31 ms. (1250 steps per ms) remains 4/4 properties
[2026-05-23 18:11:43] [INFO ] Invariant cache hit.
[2026-05-23 18:11:43] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/19 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 5/24 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 4 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/19 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 5/24 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 20 constraints, problems are : Problem set: 0 solved, 4 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 152ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 1118 steps, including 60 resets, run visited all 4 properties in 17 ms. (steps per millisecond=65 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 17 ms.
Knowledge based reduction with 1 factoid took 203 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
Knowledge-based reduction took 827 ms.
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 6 reset in 62 ms.
Product exploration explored 100000 steps with 1 reset in 103 ms.
Spot run failed in 41 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin12946027265989176596
[2026-05-23 18:11:45] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12946027265989176596
Running compilation step : cd /tmp/ltsmin12946027265989176596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 71 ms.
Running link step : cd /tmp/ltsmin12946027265989176596;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin12946027265989176596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10265577650263770963.hoa' '--buchi-type=spotba'
LTSmin run took 1603 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-13 finished in 5758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G(p1))))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 0 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15282115262016131025.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13954493985306141079.kers'
[2026-05-23 18:11:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15282115262016131025.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13954493985306141079.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 11 cols 25 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-23 18:11:46] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13954493985306141079.kers
Total runtime 1 ms.
[2026-05-23 18:11:46] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-23 18:11:46] [INFO ] Invariant cache hit.
[2026-05-23 18:11:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:11:47] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2026-05-23 18:11:47] [INFO ] Invariant cache hit.
[2026-05-23 18:11:47] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 91 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 86 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 179ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 180ms
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 11/12 places, 12/12 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G(p1))))'
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 56 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-14 finished in 425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((F(G(p1))&&F(p2))))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (complete) has 29 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
[2026-05-23 18:11:47] [INFO ] Invariant cache hit.
[2026-05-23 18:11:47] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-23 18:11:47] [INFO ] Invariant cache hit.
[2026-05-23 18:11:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 18:11:47] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2026-05-23 18:11:47] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46 ms. Remains : 11/12 places, 12/12 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((F(G(p1))&&F(p2))))))'
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 76 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-15 finished in 264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((p0 U !p1)&&X(p2)))&&X(X(X(G(p3))))))'
Spot run failed in 43 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p1&&X((p1 U X(p1))))) U X(G(!p1))))'
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-23 18:11:47] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6520391399994713733
[2026-05-23 18:11:47] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2026-05-23 18:11:47] [INFO ] Applying decomposition
[2026-05-23 18:11:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 18:11:47] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2026-05-23 18:11:47] [INFO ] Flatten gal took : 1 ms
[2026-05-23 18:11:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 18:11:47] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2026-05-23 18:11:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 18:11:47] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6520391399994713733
Running compilation step : cd /tmp/ltsmin6520391399994713733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14908010177566600066.txt' '-o' '/tmp/graph14908010177566600066.bin' '-w' '/tmp/graph14908010177566600066.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14908010177566600066.bin' '-l' '-1' '-v' '-w' '/tmp/graph14908010177566600066.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:11:47] [INFO ] Decomposing Gal with order
[2026-05-23 18:11:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:11:47] [INFO ] Flatten gal took : 2 ms
[2026-05-23 18:11:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-23 18:11:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality4065351297068235563.gal : 0 ms
[2026-05-23 18:11:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality5487699418265253983.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4065351297068235563.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5487699418265253983.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !(((F((("(((gu1.resource_c0+gu1.resource_c1)+(gu1.resource_c2+gu1.resource_c3))>=1)")U("(((gi1.gu2.state_c0+gi1.gu2.state_c1)+(gi1.gu2...553
Formula 0 simplified : G((!"(((gu1.resource_c0+gu1.resource_c1)+(gu1.resource_c2+gu1.resource_c3))>=1)" R !"(((gi1.gu2.state_c0+gi1.gu2.state_c1)+(gi1.gu2....538
Compilation finished in 120 ms.
Running link step : cd /tmp/ltsmin6520391399994713733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6520391399994713733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>((((LTLAPp0==true) U !(LTLAPp1==true))&&X((LTLAPp2==true))))&&X(X(X([]((LTLAPp3==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi1.gu2.t4, gi1.gu2.t5, gi1.gu2.t6, gi1.gu2.t7, Intersection with reachable at each step ena...206
Computing Next relation with stutter on 8037 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin6520391399994713733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>((((LTLAPp0==true) U !(LTLAPp1==true))&&X((LTLAPp2==true))))&&X(X(X([]((LTLAPp3==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6520391399994713733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(((LTLAPp4==true)||((LTLAPp1==true)&&X(((LTLAPp1==true) U X((LTLAPp1==true)))))) U X([](!(LTLAPp1==true))))' '--buchi-type=spotba'
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
122057 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,1220.58,2220340,1,0,364,5.94134e+06,27,389,387291,7.14956e+06,603
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((("(((gi1.gu2.state_c0+gi1.gu2.state_c1)+(gi1.gu2.state_c2+gi1.gu2.state_c3))>=1)")||(("(((gi1.gu2.state_c0+gi1.gu2.state_c1)+(gi1....793
Formula 1 simplified : (!"(((gi1.gu2.state_c0+gi1.gu2.state_c1)+(gi1.gu2.state_c2+gi1.gu2.state_c3))>=1)" & (!"(((gi1.gu2.state_c0+gi1.gu2.state_c1)+(gi1.g...783
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2026-05-23 18:32:43] [INFO ] Flatten gal took : 4 ms
[2026-05-23 18:32:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality17581048418122064192.gal : 0 ms
[2026-05-23 18:32:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality18119056137167106774.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17581048418122064192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18119056137167106774.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !(((("(((state_c0+state_c1)+(state_c2+state_c3))>=1)")||(("(((state_c0+state_c1)+(state_c2+state_c3))>((capacity_c0+capacity_c1)+(capa...505
Formula 0 simplified : (!"(((state_c0+state_c1)+(state_c2+state_c3))>=1)" & (!"(((state_c0+state_c1)+(state_c2+state_c3))>((capacity_c0+capacity_c1)+(capac...495
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, Intersection with reachable at each step enabled. (destroyed/reverse/interse...174
Computing Next relation with stutter on 8037 deadlock states
10 unique states visited
0 strongly connected components in search stack
15 transitions explored
6 items max in DFS search stack
51484 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,514.863,1081524,1,0,661,3.12018e+06,69,640,22978,2.98809e+06,1666
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1946771 ms.

BK_STOP 1779561684016

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is CryptoMiner-PT-D03N100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tall-177946967800635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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