Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694800535.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BusinessProcesses-PT-11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800535
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 141K Mar 5 18:22 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 BusinessProcesses-PT-11-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678643500400

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:51:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:51:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:51:42] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-12 17:51:42] [INFO ] Transformed 567 places.
[2023-03-12 17:51:42] [INFO ] Transformed 508 transitions.
[2023-03-12 17:51:42] [INFO ] Found NUPN structural information;
[2023-03-12 17:51:42] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 7 transitions.
Incomplete random walk after 10000 steps, including 76 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 16) seen :4
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :1
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :1
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 501 rows 560 cols
[2023-03-12 17:51:43] [INFO ] Computed 95 place invariants in 29 ms
[2023-03-12 17:51:43] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 17:51:44] [INFO ] [Nat]Absence check using 53 positive place invariants in 15 ms returned sat
[2023-03-12 17:51:44] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2023-03-12 17:51:44] [INFO ] After 526ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :6
[2023-03-12 17:51:44] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 5 ms to minimize.
[2023-03-12 17:51:44] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2023-03-12 17:51:45] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2023-03-12 17:51:45] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2023-03-12 17:51:45] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2023-03-12 17:51:45] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 7 ms to minimize.
[2023-03-12 17:51:45] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2023-03-12 17:51:45] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2023-03-12 17:51:45] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2023-03-12 17:51:45] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2023-03-12 17:51:46] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2023-03-12 17:51:46] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2023-03-12 17:51:46] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2023-03-12 17:51:46] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2023-03-12 17:51:46] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2023-03-12 17:51:46] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 0 ms to minimize.
[2023-03-12 17:51:46] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 0 ms to minimize.
[2023-03-12 17:51:46] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2023-03-12 17:51:46] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 0 ms to minimize.
[2023-03-12 17:51:46] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2236 ms
[2023-03-12 17:51:47] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-03-12 17:51:47] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2023-03-12 17:51:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2023-03-12 17:51:47] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2023-03-12 17:51:47] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2023-03-12 17:51:47] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2023-03-12 17:51:47] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2023-03-12 17:51:47] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2023-03-12 17:51:47] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2023-03-12 17:51:48] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2023-03-12 17:51:48] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2023-03-12 17:51:48] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2023-03-12 17:51:48] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2023-03-12 17:51:48] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 3 ms to minimize.
[2023-03-12 17:51:48] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 1 ms to minimize.
[2023-03-12 17:51:48] [INFO ] Deduced a trap composed of 132 places in 140 ms of which 1 ms to minimize.
[2023-03-12 17:51:49] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 0 ms to minimize.
[2023-03-12 17:51:49] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 0 ms to minimize.
[2023-03-12 17:51:49] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 0 ms to minimize.
[2023-03-12 17:51:49] [INFO ] Deduced a trap composed of 139 places in 97 ms of which 0 ms to minimize.
[2023-03-12 17:51:49] [INFO ] Deduced a trap composed of 155 places in 106 ms of which 0 ms to minimize.
[2023-03-12 17:51:49] [INFO ] Deduced a trap composed of 122 places in 96 ms of which 2 ms to minimize.
[2023-03-12 17:51:50] [INFO ] Deduced a trap composed of 131 places in 94 ms of which 3 ms to minimize.
[2023-03-12 17:51:50] [INFO ] Deduced a trap composed of 124 places in 92 ms of which 1 ms to minimize.
[2023-03-12 17:51:50] [INFO ] Deduced a trap composed of 136 places in 142 ms of which 1 ms to minimize.
[2023-03-12 17:51:50] [INFO ] Deduced a trap composed of 127 places in 91 ms of which 0 ms to minimize.
[2023-03-12 17:51:50] [INFO ] Deduced a trap composed of 128 places in 91 ms of which 0 ms to minimize.
[2023-03-12 17:51:50] [INFO ] Deduced a trap composed of 133 places in 91 ms of which 0 ms to minimize.
[2023-03-12 17:51:51] [INFO ] Deduced a trap composed of 132 places in 97 ms of which 1 ms to minimize.
[2023-03-12 17:51:51] [INFO ] Deduced a trap composed of 132 places in 95 ms of which 1 ms to minimize.
[2023-03-12 17:51:51] [INFO ] Deduced a trap composed of 126 places in 104 ms of which 1 ms to minimize.
[2023-03-12 17:51:51] [INFO ] Deduced a trap composed of 124 places in 92 ms of which 0 ms to minimize.
[2023-03-12 17:51:51] [INFO ] Deduced a trap composed of 114 places in 106 ms of which 1 ms to minimize.
[2023-03-12 17:51:51] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 0 ms to minimize.
[2023-03-12 17:51:51] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2023-03-12 17:51:51] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4552 ms
[2023-03-12 17:51:52] [INFO ] Deduced a trap composed of 132 places in 94 ms of which 0 ms to minimize.
[2023-03-12 17:51:52] [INFO ] Deduced a trap composed of 124 places in 104 ms of which 1 ms to minimize.
[2023-03-12 17:51:52] [INFO ] Deduced a trap composed of 141 places in 89 ms of which 3 ms to minimize.
[2023-03-12 17:51:52] [INFO ] Deduced a trap composed of 129 places in 82 ms of which 1 ms to minimize.
[2023-03-12 17:51:52] [INFO ] Deduced a trap composed of 132 places in 83 ms of which 1 ms to minimize.
[2023-03-12 17:51:52] [INFO ] Deduced a trap composed of 131 places in 79 ms of which 1 ms to minimize.
[2023-03-12 17:51:52] [INFO ] Deduced a trap composed of 126 places in 79 ms of which 0 ms to minimize.
[2023-03-12 17:51:52] [INFO ] Deduced a trap composed of 129 places in 124 ms of which 0 ms to minimize.
[2023-03-12 17:51:52] [INFO ] Deduced a trap composed of 124 places in 82 ms of which 1 ms to minimize.
[2023-03-12 17:51:53] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1025 ms
[2023-03-12 17:51:53] [INFO ] After 8912ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :6
Attempting to minimize the solution found.
Minimization took 513 ms.
[2023-03-12 17:51:53] [INFO ] After 9687ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :6
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 80 ms.
Support contains 80 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 501/501 transitions.
Graph (complete) has 1140 edges and 560 vertex of which 555 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 555 transition count 446
Reduce places removed 54 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 64 rules applied. Total rules applied 119 place count 501 transition count 436
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 129 place count 491 transition count 436
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 129 place count 491 transition count 340
Deduced a syphon composed of 96 places in 4 ms
Ensure Unique test removed 12 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 333 place count 383 transition count 340
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 384 place count 332 transition count 289
Iterating global reduction 3 with 51 rules applied. Total rules applied 435 place count 332 transition count 289
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 143 rules applied. Total rules applied 578 place count 259 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 579 place count 259 transition count 218
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 581 place count 258 transition count 222
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 585 place count 258 transition count 222
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 586 place count 257 transition count 221
Applied a total of 586 rules in 128 ms. Remains 257 /560 variables (removed 303) and now considering 221/501 (removed 280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 257/560 places, 221/501 transitions.
Incomplete random walk after 10000 steps, including 212 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Finished probabilistic random walk after 110193 steps, run visited all 6 properties in 333 ms. (steps per millisecond=330 )
Probabilistic random walk after 110193 steps, saw 17439 distinct states, run finished after 334 ms. (steps per millisecond=329 ) properties seen :6
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 12675 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/656/inv_0_ --invariant=/tmp/656/inv_1_ --invariant=/tmp/656/inv_2_ --invariant=/tmp/656/inv_3_ --invariant=/tmp/656/inv_4_ --invariant=/tmp/656/inv_5_ --invariant=/tmp/656/inv_6_ --invariant=/tmp/656/inv_7_ --invariant=/tmp/656/inv_8_ --invariant=/tmp/656/inv_9_ --invariant=/tmp/656/inv_10_ --invariant=/tmp/656/inv_11_ --invariant=/tmp/656/inv_12_ --invariant=/tmp/656/inv_13_ --invariant=/tmp/656/inv_14_ --invariant=/tmp/656/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 6260548 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16101248 kB
Could not compute solution for formula : BusinessProcesses-PT-11-ReachabilityFireability-00
Could not compute solution for formula : BusinessProcesses-PT-11-ReachabilityFireability-01
Could not compute solution for formula : BusinessProcesses-PT-11-ReachabilityFireability-02
Could not compute solution for formula : BusinessProcesses-PT-11-ReachabilityFireability-03
Could not compute solution for formula : BusinessProcesses-PT-11-ReachabilityFireability-04
Could not compute solution for formula : BusinessProcesses-PT-11-ReachabilityFireability-05
Could not compute solution for formula : BusinessProcesses-PT-11-ReachabilityFireability-06
Could not compute solution for formula : BusinessProcesses-PT-11-ReachabilityFireability-07
Could not compute solution for formula : BusinessProcesses-PT-11-ReachabilityFireability-08
Could not compute solution for formula : BusinessProcesses-PT-11-ReachabilityFireability-09
Could not compute solution for formula : BusinessProcesses-PT-11-ReachabilityFireability-10
Could not compute solution for formula : BusinessProcesses-PT-11-ReachabilityFireability-11
Could not compute solution for formula : BusinessProcesses-PT-11-ReachabilityFireability-12
Could not compute solution for formula : BusinessProcesses-PT-11-ReachabilityFireability-13
Could not compute solution for formula : BusinessProcesses-PT-11-ReachabilityFireability-14
Could not compute solution for formula : BusinessProcesses-PT-11-ReachabilityFireability-15

BK_STOP 1678647086185

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name BusinessProcesses-PT-11-ReachabilityFireability-00
rfs formula type AG
rfs formula formula --invariant=/tmp/656/inv_0_
rfs formula name BusinessProcesses-PT-11-ReachabilityFireability-01
rfs formula type EF
rfs formula formula --invariant=/tmp/656/inv_1_
rfs formula name BusinessProcesses-PT-11-ReachabilityFireability-02
rfs formula type EF
rfs formula formula --invariant=/tmp/656/inv_2_
rfs formula name BusinessProcesses-PT-11-ReachabilityFireability-03
rfs formula type EF
rfs formula formula --invariant=/tmp/656/inv_3_
rfs formula name BusinessProcesses-PT-11-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/656/inv_4_
rfs formula name BusinessProcesses-PT-11-ReachabilityFireability-05
rfs formula type AG
rfs formula formula --invariant=/tmp/656/inv_5_
rfs formula name BusinessProcesses-PT-11-ReachabilityFireability-06
rfs formula type EF
rfs formula formula --invariant=/tmp/656/inv_6_
rfs formula name BusinessProcesses-PT-11-ReachabilityFireability-07
rfs formula type AG
rfs formula formula --invariant=/tmp/656/inv_7_
rfs formula name BusinessProcesses-PT-11-ReachabilityFireability-08
rfs formula type EF
rfs formula formula --invariant=/tmp/656/inv_8_
rfs formula name BusinessProcesses-PT-11-ReachabilityFireability-09
rfs formula type EF
rfs formula formula --invariant=/tmp/656/inv_9_
rfs formula name BusinessProcesses-PT-11-ReachabilityFireability-10
rfs formula type EF
rfs formula formula --invariant=/tmp/656/inv_10_
rfs formula name BusinessProcesses-PT-11-ReachabilityFireability-11
rfs formula type AG
rfs formula formula --invariant=/tmp/656/inv_11_
rfs formula name BusinessProcesses-PT-11-ReachabilityFireability-12
rfs formula type EF
rfs formula formula --invariant=/tmp/656/inv_12_
rfs formula name BusinessProcesses-PT-11-ReachabilityFireability-13
rfs formula type EF
rfs formula formula --invariant=/tmp/656/inv_13_
rfs formula name BusinessProcesses-PT-11-ReachabilityFireability-14
rfs formula type AG
rfs formula formula --invariant=/tmp/656/inv_14_
rfs formula name BusinessProcesses-PT-11-ReachabilityFireability-15
rfs formula type AG
rfs formula formula --invariant=/tmp/656/inv_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 567 places, 508 transitions and 1512 arcs
pnml2lts-sym: Petri net BusinessProcesses-PT-11 analyzed
pnml2lts-sym: There are 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: 508->508 groups
pnml2lts-sym: Regrouping took 0.140 real 0.140 user 0.000 sys
pnml2lts-sym: state vector length is 567; there are 508 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: 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) : 662
Killing (9) : 662

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="BusinessProcesses-PT-11"
export BK_EXAMINATION="ReachabilityFireability"
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 BusinessProcesses-PT-11, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694800535"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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