Execution Chart

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

Trace from the execution

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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716283285121

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D10N100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:21:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 09:21:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:21:26] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2024-05-21 09:21:26] [INFO ] Transformed 33 places.
[2024-05-21 09:21:26] [INFO ] Transformed 33 transitions.
[2024-05-21 09:21:26] [INFO ] Parsed PT model containing 33 places and 33 transitions and 97 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Support contains 32 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 20 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2024-05-21 09:21:26] [INFO ] Computed 0 invariants in 5 ms
[2024-05-21 09:21:26] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 09:21:26] [INFO ] Invariant cache hit.
[2024-05-21 09:21:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 09:21:26] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2024-05-21 09:21:26] [INFO ] Invariant cache hit.
[2024-05-21 09:21:26] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/65 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 455 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/63 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 391 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 885ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 894ms
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1215 ms. Remains : 32/33 places, 33/33 transitions.
Support contains 32 out of 32 places after structural reductions.
[2024-05-21 09:21:28] [INFO ] Flatten gal took : 22 ms
[2024-05-21 09:21:28] [INFO ] Flatten gal took : 9 ms
[2024-05-21 09:21:28] [INFO ] Input system was already deterministic with 33 transitions.
Reduction of identical properties reduced properties to check from 51 to 45
RANDOM walk for 40153 steps (8 resets) in 270 ms. (148 steps per ms) remains 14/45 properties
BEST_FIRST walk for 40004 steps (8 resets) in 421 ms. (94 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 305 ms. (130 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 9/9 properties
[2024-05-21 09:21:29] [INFO ] Invariant cache hit.
[2024-05-21 09:21:29] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 24/44 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/56 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 7 (OVERLAPS) 9/65 variables, 6/40 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 2/42 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 42 constraints, problems are : Problem set: 3 solved, 6 unsolved in 187 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 21/39 variables, 18/18 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 6/24 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 4/28 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 9/48 variables, 4/32 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 1/33 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 2/35 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 10/58 variables, 5/40 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/58 variables, 1/41 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/58 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 4/62 variables, 3/44 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/62 variables, 1/45 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/62 variables, 0/45 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/64 variables, 1/46 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/64 variables, 1/47 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/64 variables, 0/47 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 1/65 variables, 1/48 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/65 variables, 0/48 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/65 variables, 0/48 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 48 constraints, problems are : Problem set: 3 solved, 6 unsolved in 205 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 6/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 409ms problems are : Problem set: 3 solved, 6 unsolved
Finished Parikh walk after 691 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=345 )
Parikh walk visited 6 properties in 235 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-21 09:21:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 7 ms
FORMULA CryptoMiner-PT-D10N100-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:21:29] [INFO ] Input system was already deterministic with 33 transitions.
FORMULA CryptoMiner-PT-D10N100-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 33/33 transitions.
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 9 ms
[2024-05-21 09:21:29] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 32/32 places, 33/33 transitions.
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:21:29] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 33/33 transitions.
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:21:29] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 33/33 transitions.
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:21:29] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 33/33 transitions.
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:21:29] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 32/32 places, 33/33 transitions.
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:21:29] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 32/32 places, 33/33 transitions.
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:21:29] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 33/33 transitions.
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:21:29] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 33/33 transitions.
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 1 ms
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:21:29] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 33/33 transitions.
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:21:29] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 32/32 places, 33/33 transitions.
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:21:29] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 33/33 transitions.
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:21:29] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 33/33 transitions.
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 1 ms
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:21:29] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 32/32 places, 33/33 transitions.
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:21:29] [INFO ] Input system was already deterministic with 33 transitions.
[2024-05-21 09:21:29] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:21:30] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:21:30] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-21 09:21:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 33 transitions and 96 arcs took 3 ms.
Total runtime 3663 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CryptoMiner-PT-D10N100

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 544
MODEL NAME: /home/mcc/execution/412/model
32 places, 33 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CryptoMiner-PT-D10N100-CTLFireability-2024-01 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D10N100-CTLFireability-2024-02 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D10N100-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D10N100-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D10N100-CTLFireability-2024-06 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D10N100-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D10N100-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D10N100-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D10N100-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D10N100-CTLFireability-2024-11 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D10N100-CTLFireability-2024-12 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D10N100-CTLFireability-2024-13 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D10N100-CTLFireability-2024-14 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D10N100-CTLFireability-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716285033827

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CryptoMiner-PT-D10N100, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624187700418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-PT-D10N100.tgz
mv CryptoMiner-PT-D10N100 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;