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-167987246600361.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 Murphy-PT-D4N025, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246600361
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 8.3K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.7K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 19K 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 Murphy-PT-D4N025-CTLCardinality-00
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-01
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-02
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-03
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-04
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-05
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-06
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-07
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-08
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-09
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-10
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-11
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-12
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-13
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-14
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680909615157

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D4N025
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 23:20:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 23:20:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 23:20:17] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-04-07 23:20:17] [INFO ] Transformed 30 places.
[2023-04-07 23:20:17] [INFO ] Transformed 35 transitions.
[2023-04-07 23:20:17] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 92 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 23:20:17] [INFO ] Computed 6 invariants in 7 ms
[2023-04-07 23:20:17] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
[2023-04-07 23:20:17] [INFO ] Invariant cache hit.
[2023-04-07 23:20:17] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-04-07 23:20:17] [INFO ] Invariant cache hit.
[2023-04-07 23:20:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:20:17] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-04-07 23:20:17] [INFO ] Invariant cache hit.
[2023-04-07 23:20:17] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-04-07 23:20:17] [INFO ] Flatten gal took : 24 ms
[2023-04-07 23:20:17] [INFO ] Flatten gal took : 23 ms
[2023-04-07 23:20:17] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 94) seen :70
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) seen :0
Running SMT prover for 24 properties.
[2023-04-07 23:20:18] [INFO ] Invariant cache hit.
[2023-04-07 23:20:18] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 23:20:18] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 23:20:18] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-07 23:20:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 23:20:18] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 23:20:18] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-07 23:20:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:20:18] [INFO ] After 69ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-07 23:20:18] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 6 ms to minimize.
[2023-04-07 23:20:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-07 23:20:18] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2023-04-07 23:20:18] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2023-04-07 23:20:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 42 ms
[2023-04-07 23:20:19] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 2 ms to minimize.
[2023-04-07 23:20:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 23:20:19] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-04-07 23:20:19] [INFO ] After 505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 262 ms.
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:19] [INFO ] Invariant cache hit.
[2023-04-07 23:20:19] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10023 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) 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 24) 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 24) seen :0
Interrupted probabilistic random walk after 206300 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206300 steps, saw 141622 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 24 properties.
[2023-04-07 23:20:22] [INFO ] Invariant cache hit.
[2023-04-07 23:20:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 23:20:22] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 23:20:22] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-07 23:20:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2023-04-07 23:20:22] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 23:20:23] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-07 23:20:23] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:20:23] [INFO ] After 56ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-07 23:20:23] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2023-04-07 23:20:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2023-04-07 23:20:23] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 7 ms to minimize.
[2023-04-07 23:20:23] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2023-04-07 23:20:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2023-04-07 23:20:23] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2023-04-07 23:20:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-04-07 23:20:23] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-04-07 23:20:23] [INFO ] After 640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 311 ms.
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:23] [INFO ] Invariant cache hit.
[2023-04-07 23:20:23] [INFO ] Implicit Places using invariants in 34 ms returned [11, 12, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 27/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 43 ms. Remains : 27/30 places, 35/35 transitions.
Incomplete random walk after 10026 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 252132 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 252132 steps, saw 173463 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 35 rows 27 cols
[2023-04-07 23:20:26] [INFO ] Computed 3 invariants in 1 ms
[2023-04-07 23:20:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 23:20:26] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 23:20:27] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-07 23:20:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-04-07 23:20:27] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-04-07 23:20:27] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-07 23:20:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:20:27] [INFO ] After 93ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-07 23:20:27] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2023-04-07 23:20:27] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2023-04-07 23:20:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 45 ms
[2023-04-07 23:20:27] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2023-04-07 23:20:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-07 23:20:27] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
[2023-04-07 23:20:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-04-07 23:20:27] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2023-04-07 23:20:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-04-07 23:20:27] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-04-07 23:20:27] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 227 ms.
Support contains 20 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 27/27 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:27] [INFO ] Invariant cache hit.
[2023-04-07 23:20:27] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 23:20:27] [INFO ] Invariant cache hit.
[2023-04-07 23:20:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:20:27] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-04-07 23:20:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 23:20:27] [INFO ] Invariant cache hit.
[2023-04-07 23:20:28] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 27/27 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 24 properties.
[2023-04-07 23:20:28] [INFO ] Invariant cache hit.
[2023-04-07 23:20:28] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2023-04-07 23:20:28] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 23:20:28] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-07 23:20:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 23:20:28] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 23:20:28] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-07 23:20:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 23:20:28] [INFO ] After 51ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-07 23:20:28] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2023-04-07 23:20:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2023-04-07 23:20:28] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2023-04-07 23:20:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2023-04-07 23:20:28] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-04-07 23:20:28] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
[2023-04-07 23:20:28] [INFO ] Flatten gal took : 4 ms
[2023-04-07 23:20:28] [INFO ] Flatten gal took : 5 ms
[2023-04-07 23:20:28] [INFO ] Input system was already deterministic with 35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 23:20:28] [INFO ] Computed 6 invariants in 1 ms
[2023-04-07 23:20:28] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:28] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:28] [INFO ] Flatten gal took : 3 ms
[2023-04-07 23:20:28] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:28] [INFO ] Invariant cache hit.
[2023-04-07 23:20:28] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:28] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:28] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:28] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:28] [INFO ] Invariant cache hit.
[2023-04-07 23:20:28] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:28] [INFO ] Flatten gal took : 3 ms
[2023-04-07 23:20:28] [INFO ] Flatten gal took : 3 ms
[2023-04-07 23:20:28] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:28] [INFO ] Invariant cache hit.
[2023-04-07 23:20:28] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:28] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:28] [INFO ] Flatten gal took : 3 ms
[2023-04-07 23:20:28] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:28] [INFO ] Invariant cache hit.
[2023-04-07 23:20:28] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:28] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:28] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:28] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:28] [INFO ] Invariant cache hit.
[2023-04-07 23:20:29] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 139 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:29] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:29] [INFO ] Invariant cache hit.
[2023-04-07 23:20:29] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:29] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:29] [INFO ] Invariant cache hit.
[2023-04-07 23:20:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:29] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:29] [INFO ] Invariant cache hit.
[2023-04-07 23:20:29] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:29] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:29] [INFO ] Invariant cache hit.
[2023-04-07 23:20:29] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 3 ms
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:29] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:29] [INFO ] Invariant cache hit.
[2023-04-07 23:20:29] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 5 ms
[2023-04-07 23:20:29] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:29] [INFO ] Invariant cache hit.
[2023-04-07 23:20:29] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:29] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:29] [INFO ] Invariant cache hit.
[2023-04-07 23:20:29] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 1 ms
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:29] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:29] [INFO ] Invariant cache hit.
[2023-04-07 23:20:29] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 1 ms
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 2 ms
[2023-04-07 23:20:29] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:29] [INFO ] Invariant cache hit.
[2023-04-07 23:20:29] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 3 ms
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 3 ms
[2023-04-07 23:20:29] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 23:20:29] [INFO ] Invariant cache hit.
[2023-04-07 23:20:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 1 ms
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 1 ms
[2023-04-07 23:20:29] [INFO ] Input system was already deterministic with 35 transitions.
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 3 ms
[2023-04-07 23:20:29] [INFO ] Flatten gal took : 3 ms
[2023-04-07 23:20:29] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-07 23:20:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 35 transitions and 135 arcs took 0 ms.
Total runtime 12601 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/627/ctl_0_ --ctl=/tmp/627/ctl_1_ --ctl=/tmp/627/ctl_2_ --ctl=/tmp/627/ctl_3_ --ctl=/tmp/627/ctl_4_ --ctl=/tmp/627/ctl_5_ --ctl=/tmp/627/ctl_6_ --ctl=/tmp/627/ctl_7_ --ctl=/tmp/627/ctl_8_ --ctl=/tmp/627/ctl_9_ --ctl=/tmp/627/ctl_10_ --ctl=/tmp/627/ctl_11_ --ctl=/tmp/627/ctl_12_ --ctl=/tmp/627/ctl_13_ --ctl=/tmp/627/ctl_14_ --ctl=/tmp/627/ctl_15_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 220080 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100144 kB
Could not compute solution for formula : Murphy-PT-D4N025-CTLCardinality-00
FORMULA Murphy-PT-D4N025-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Murphy-PT-D4N025-CTLCardinality-02
FORMULA Murphy-PT-D4N025-CTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Murphy-PT-D4N025-CTLCardinality-04
Could not compute solution for formula : Murphy-PT-D4N025-CTLCardinality-05
Could not compute solution for formula : Murphy-PT-D4N025-CTLCardinality-06
Could not compute solution for formula : Murphy-PT-D4N025-CTLCardinality-07
Could not compute solution for formula : Murphy-PT-D4N025-CTLCardinality-08
Could not compute solution for formula : Murphy-PT-D4N025-CTLCardinality-09
Could not compute solution for formula : Murphy-PT-D4N025-CTLCardinality-10
Could not compute solution for formula : Murphy-PT-D4N025-CTLCardinality-11
Could not compute solution for formula : Murphy-PT-D4N025-CTLCardinality-12
Could not compute solution for formula : Murphy-PT-D4N025-CTLCardinality-13
FORMULA Murphy-PT-D4N025-CTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D4N025-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1680913202250

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name Murphy-PT-D4N025-CTLCardinality-00
ctl formula formula --ctl=/tmp/627/ctl_0_
ctl formula name Murphy-PT-D4N025-CTLCardinality-01
ctl formula formula --ctl=/tmp/627/ctl_1_
ctl formula name Murphy-PT-D4N025-CTLCardinality-02
ctl formula formula --ctl=/tmp/627/ctl_2_
ctl formula name Murphy-PT-D4N025-CTLCardinality-03
ctl formula formula --ctl=/tmp/627/ctl_3_
ctl formula name Murphy-PT-D4N025-CTLCardinality-04
ctl formula formula --ctl=/tmp/627/ctl_4_
ctl formula name Murphy-PT-D4N025-CTLCardinality-05
ctl formula formula --ctl=/tmp/627/ctl_5_
ctl formula name Murphy-PT-D4N025-CTLCardinality-06
ctl formula formula --ctl=/tmp/627/ctl_6_
ctl formula name Murphy-PT-D4N025-CTLCardinality-07
ctl formula formula --ctl=/tmp/627/ctl_7_
ctl formula name Murphy-PT-D4N025-CTLCardinality-08
ctl formula formula --ctl=/tmp/627/ctl_8_
ctl formula name Murphy-PT-D4N025-CTLCardinality-09
ctl formula formula --ctl=/tmp/627/ctl_9_
ctl formula name Murphy-PT-D4N025-CTLCardinality-10
ctl formula formula --ctl=/tmp/627/ctl_10_
ctl formula name Murphy-PT-D4N025-CTLCardinality-11
ctl formula formula --ctl=/tmp/627/ctl_11_
ctl formula name Murphy-PT-D4N025-CTLCardinality-12
ctl formula formula --ctl=/tmp/627/ctl_12_
ctl formula name Murphy-PT-D4N025-CTLCardinality-13
ctl formula formula --ctl=/tmp/627/ctl_13_
ctl formula name Murphy-PT-D4N025-CTLCardinality-14
ctl formula formula --ctl=/tmp/627/ctl_14_
ctl formula name Murphy-PT-D4N025-CTLCardinality-15
ctl formula formula --ctl=/tmp/627/ctl_15_
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 30 places, 35 transitions and 135 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 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: 35->15 groups
pnml2lts-sym: Regrouping took 0.000 real 0.000 user 0.010 sys
pnml2lts-sym: state vector length is 30; there are 15 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: 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: 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: Exploration took 413748 group checks and 0 next state calls
pnml2lts-sym: reachability took 2010.580 real 7185.140 user 795.910 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.160 real 0.620 user 0.000 sys
pnml2lts-sym: state space has 2.0012606308671e+16 states, 365218 nodes
pnml2lts-sym: Formula /tmp/627/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/627/ctl_3_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/627/ctl_15_ 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/627/ctl_14_ holds for the initial state
Killing (15) : 633
Killing (9) : 633

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="Murphy-PT-D4N025"
export BK_EXAMINATION="CTLCardinality"
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 Murphy-PT-D4N025, examination is CTLCardinality"
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-167987246600361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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