fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r521-tall-167987246300202
Last Updated
May 14, 2023

About the Execution of LTSMin+red for CryptoMiner-PT-D10N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15876.287 3582928.00 14282658.00 378.70 FT?TTFFTFFFFF??F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r521-tall-167987246300202.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r521-tall-167987246300202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 13K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 32K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 30K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 214K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 15K Mar 31 16:48 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-00
FORMULA_NAME CryptoMiner-PT-D10N100-CTLFireability-01
FORMULA_NAME CryptoMiner-PT-D10N100-CTLFireability-02
FORMULA_NAME CryptoMiner-PT-D10N100-CTLFireability-03
FORMULA_NAME CryptoMiner-PT-D10N100-CTLFireability-04
FORMULA_NAME CryptoMiner-PT-D10N100-CTLFireability-05
FORMULA_NAME CryptoMiner-PT-D10N100-CTLFireability-06
FORMULA_NAME CryptoMiner-PT-D10N100-CTLFireability-07
FORMULA_NAME CryptoMiner-PT-D10N100-CTLFireability-08
FORMULA_NAME CryptoMiner-PT-D10N100-CTLFireability-09
FORMULA_NAME CryptoMiner-PT-D10N100-CTLFireability-10
FORMULA_NAME CryptoMiner-PT-D10N100-CTLFireability-11
FORMULA_NAME CryptoMiner-PT-D10N100-CTLFireability-12
FORMULA_NAME CryptoMiner-PT-D10N100-CTLFireability-13
FORMULA_NAME CryptoMiner-PT-D10N100-CTLFireability-14
FORMULA_NAME CryptoMiner-PT-D10N100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680891209472

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D10N100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 18:13:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 18:13:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:13:32] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-04-07 18:13:32] [INFO ] Transformed 33 places.
[2023-04-07 18:13:32] [INFO ] Transformed 33 transitions.
[2023-04-07 18:13:32] [INFO ] Parsed PT model containing 33 places and 33 transitions and 97 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 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 16 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 18:13:33] [INFO ] Computed 0 invariants in 5 ms
[2023-04-07 18:13:33] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-04-07 18:13:33] [INFO ] Invariant cache hit.
[2023-04-07 18:13:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:13:33] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-04-07 18:13:33] [INFO ] Invariant cache hit.
[2023-04-07 18:13:33] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 32/33 places, 33/33 transitions.
Support contains 32 out of 32 places after structural reductions.
[2023-04-07 18:13:33] [INFO ] Flatten gal took : 18 ms
[2023-04-07 18:13:33] [INFO ] Flatten gal took : 8 ms
[2023-04-07 18:13:33] [INFO ] Input system was already deterministic with 33 transitions.
Incomplete random walk after 10034 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 34) seen :19
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-04-07 18:13:33] [INFO ] Invariant cache hit.
[2023-04-07 18:13:34] [INFO ] After 83ms SMT Verify possible using state equation in real domain returned unsat :4 sat :6 real:3
[2023-04-07 18:13:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:13:34] [INFO ] After 20ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :4 sat :4 real:5
[2023-04-07 18:13:34] [INFO ] After 158ms SMT Verify possible using trap constraints in real domain returned unsat :4 sat :3 real:6
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-07 18:13:34] [INFO ] After 411ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :3 real:6
[2023-04-07 18:13:34] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :8
[2023-04-07 18:13:34] [INFO ] After 76ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :5 sat :8
[2023-04-07 18:13:34] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :8
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-07 18:13:35] [INFO ] After 606ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :8
Fused 13 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 143 ms.
Support contains 20 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (complete) has 50 edges and 32 vertex of which 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 28 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 27 transition count 28
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 27 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 26 transition count 27
Applied a total of 7 rules in 25 ms. Remains 26 /32 variables (removed 6) and now considering 27/33 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 26/32 places, 27/33 transitions.
Incomplete random walk after 10038 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=590 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 601135 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 601135 steps, saw 282899 distinct states, run finished after 3002 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 27 rows 26 cols
[2023-04-07 18:13:38] [INFO ] Computed 0 invariants in 3 ms
[2023-04-07 18:13:38] [INFO ] After 29ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:3
[2023-04-07 18:13:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:13:38] [INFO ] After 24ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 18:13:38] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 18:13:38] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 18:13:38] [INFO ] After 18ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:13:38] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-07 18:13:39] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 29 ms.
Support contains 20 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 26/26 places, 27/27 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-04-07 18:13:39] [INFO ] Invariant cache hit.
[2023-04-07 18:13:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-04-07 18:13:39] [INFO ] Invariant cache hit.
[2023-04-07 18:13:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:13:39] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-04-07 18:13:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:13:39] [INFO ] Invariant cache hit.
[2023-04-07 18:13:39] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 26/26 places, 27/27 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 25 transition count 26
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 25 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 24 transition count 25
Applied a total of 4 rules in 6 ms. Remains 24 /26 variables (removed 2) and now considering 25/27 (removed 2) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 25 rows 24 cols
[2023-04-07 18:13:39] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:13:39] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:2
[2023-04-07 18:13:39] [INFO ] After 70ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :6 real:2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-07 18:13:39] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :6 real:2
[2023-04-07 18:13:39] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 18:13:39] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-04-07 18:13:39] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA CryptoMiner-PT-D10N100-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 17 ms
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:13:39] [INFO ] Input system was already deterministic with 33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.14 ms
Starting structural reductions in SI_CTL 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 SI_CTL mode , in 1 iterations and 1 ms. Remains : 32/32 places, 33/33 transitions.
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [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.
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [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.
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [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.
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [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.
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [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 13 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 13 ms. Remains : 32/32 places, 33/33 transitions.
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [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.
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [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.
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [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.
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [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 1 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 1 ms. Remains : 32/32 places, 33/33 transitions.
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [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.
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:13:39] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (trivial) has 19 edges and 32 vertex of which 11 / 32 are part of one of the 1 SCC in 3 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 4 ms. Remains 22 /32 variables (removed 10) and now considering 23/33 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 22/32 places, 23/33 transitions.
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:13:39] [INFO ] Input system was already deterministic with 23 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.
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:13:39] [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.
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:13:39] [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.
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:13:39] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:13:40] [INFO ] Input system was already deterministic with 33 transitions.
[2023-04-07 18:13:40] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:13:40] [INFO ] Flatten gal took : 19 ms
[2023-04-07 18:13:40] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-04-07 18:13:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 33 transitions and 96 arcs took 1 ms.
Total runtime 7358 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/499/ctl_0_ --ctl=/tmp/499/ctl_1_ --ctl=/tmp/499/ctl_2_ --ctl=/tmp/499/ctl_3_ --ctl=/tmp/499/ctl_4_ --ctl=/tmp/499/ctl_5_ --ctl=/tmp/499/ctl_6_ --ctl=/tmp/499/ctl_7_ --ctl=/tmp/499/ctl_8_ --ctl=/tmp/499/ctl_9_ --ctl=/tmp/499/ctl_10_ --ctl=/tmp/499/ctl_11_ --ctl=/tmp/499/ctl_12_ --ctl=/tmp/499/ctl_13_ --ctl=/tmp/499/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 281176 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098148 kB
FORMULA CryptoMiner-PT-D10N100-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D10N100-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CryptoMiner-PT-D10N100-CTLFireability-02
FORMULA CryptoMiner-PT-D10N100-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D10N100-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D10N100-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D10N100-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D10N100-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D10N100-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D10N100-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D10N100-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D10N100-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D10N100-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CryptoMiner-PT-D10N100-CTLFireability-13
Could not compute solution for formula : CryptoMiner-PT-D10N100-CTLFireability-14

BK_STOP 1680894792400

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name CryptoMiner-PT-D10N100-CTLFireability-00
ctl formula formula --ctl=/tmp/499/ctl_0_
ctl formula name CryptoMiner-PT-D10N100-CTLFireability-01
ctl formula formula --ctl=/tmp/499/ctl_1_
ctl formula name CryptoMiner-PT-D10N100-CTLFireability-02
ctl formula formula --ctl=/tmp/499/ctl_2_
ctl formula name CryptoMiner-PT-D10N100-CTLFireability-03
ctl formula formula --ctl=/tmp/499/ctl_3_
ctl formula name CryptoMiner-PT-D10N100-CTLFireability-04
ctl formula formula --ctl=/tmp/499/ctl_4_
ctl formula name CryptoMiner-PT-D10N100-CTLFireability-05
ctl formula formula --ctl=/tmp/499/ctl_5_
ctl formula name CryptoMiner-PT-D10N100-CTLFireability-06
ctl formula formula --ctl=/tmp/499/ctl_6_
ctl formula name CryptoMiner-PT-D10N100-CTLFireability-07
ctl formula formula --ctl=/tmp/499/ctl_7_
ctl formula name CryptoMiner-PT-D10N100-CTLFireability-08
ctl formula formula --ctl=/tmp/499/ctl_8_
ctl formula name CryptoMiner-PT-D10N100-CTLFireability-09
ctl formula formula --ctl=/tmp/499/ctl_9_
ctl formula name CryptoMiner-PT-D10N100-CTLFireability-10
ctl formula formula --ctl=/tmp/499/ctl_10_
ctl formula name CryptoMiner-PT-D10N100-CTLFireability-11
ctl formula formula --ctl=/tmp/499/ctl_11_
ctl formula name CryptoMiner-PT-D10N100-CTLFireability-12
ctl formula formula --ctl=/tmp/499/ctl_12_
ctl formula name CryptoMiner-PT-D10N100-CTLFireability-13
ctl formula formula --ctl=/tmp/499/ctl_13_
ctl formula name CryptoMiner-PT-D10N100-CTLFireability-14
ctl formula formula --ctl=/tmp/499/ctl_14_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 32 places, 33 transitions and 96 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 33->32 groups
pnml2lts-sym: Regrouping took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 32; there are 32 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 85757 group checks and 0 next state calls
pnml2lts-sym: reachability took 106.560 real 376.710 user 48.430 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.070 real 0.260 user 0.010 sys
pnml2lts-sym: state space has 1.36828177015871e+18 states, 180374 nodes
pnml2lts-sym: Formula /tmp/499/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_0_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/499/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_5_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/499/ctl_3_ holds for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_7_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/499/ctl_6_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_10_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_11_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/499/ctl_12_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/499/ctl_8_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 505
Killing (9) : 505

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
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 r521-tall-167987246300202"
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 ;