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-167813694800486.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-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:45 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.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 85K 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-05-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678640213521

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:56:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:56:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:56:55] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-12 16:56:55] [INFO ] Transformed 368 places.
[2023-03-12 16:56:55] [INFO ] Transformed 319 transitions.
[2023-03-12 16:56:55] [INFO ] Found NUPN structural information;
[2023-03-12 16:56:55] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 93 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 13) seen :4
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :1
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 318 rows 367 cols
[2023-03-12 16:56:56] [INFO ] Computed 57 place invariants in 15 ms
[2023-03-12 16:56:56] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 16:56:56] [INFO ] [Nat]Absence check using 41 positive place invariants in 13 ms returned sat
[2023-03-12 16:56:56] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-12 16:56:57] [INFO ] After 452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 16:56:57] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 6 ms to minimize.
[2023-03-12 16:56:57] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 1 ms to minimize.
[2023-03-12 16:56:57] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2023-03-12 16:56:58] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2023-03-12 16:56:58] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 3 ms to minimize.
[2023-03-12 16:56:58] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2023-03-12 16:56:58] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2023-03-12 16:56:58] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2023-03-12 16:56:58] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2023-03-12 16:56:58] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2023-03-12 16:56:58] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 0 ms to minimize.
[2023-03-12 16:56:58] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 0 ms to minimize.
[2023-03-12 16:56:58] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 0 ms to minimize.
[2023-03-12 16:56:58] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2023-03-12 16:56:58] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1506 ms
[2023-03-12 16:56:59] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2023-03-12 16:56:59] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 0 ms to minimize.
[2023-03-12 16:56:59] [INFO ] Deduced a trap composed of 100 places in 85 ms of which 0 ms to minimize.
[2023-03-12 16:56:59] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 0 ms to minimize.
[2023-03-12 16:56:59] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2023-03-12 16:57:00] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 1 ms to minimize.
[2023-03-12 16:57:00] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2023-03-12 16:57:00] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2023-03-12 16:57:00] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2023-03-12 16:57:00] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2023-03-12 16:57:00] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2023-03-12 16:57:00] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 0 ms to minimize.
[2023-03-12 16:57:00] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1607 ms
[2023-03-12 16:57:00] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 0 ms to minimize.
[2023-03-12 16:57:01] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 1 ms to minimize.
[2023-03-12 16:57:01] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 1 ms to minimize.
[2023-03-12 16:57:01] [INFO ] Deduced a trap composed of 94 places in 85 ms of which 1 ms to minimize.
[2023-03-12 16:57:01] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 1 ms to minimize.
[2023-03-12 16:57:01] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 1 ms to minimize.
[2023-03-12 16:57:01] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 0 ms to minimize.
[2023-03-12 16:57:01] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 1 ms to minimize.
[2023-03-12 16:57:01] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 4 ms to minimize.
[2023-03-12 16:57:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1056 ms
[2023-03-12 16:57:02] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-12 16:57:02] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
[2023-03-12 16:57:02] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2023-03-12 16:57:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 469 ms
[2023-03-12 16:57:02] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2023-03-12 16:57:02] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2023-03-12 16:57:02] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 0 ms to minimize.
[2023-03-12 16:57:02] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2023-03-12 16:57:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 408 ms
[2023-03-12 16:57:02] [INFO ] After 5945ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 488 ms.
[2023-03-12 16:57:03] [INFO ] After 6647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 129 ms.
Support contains 16 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 318/318 transitions.
Graph (trivial) has 215 edges and 367 vertex of which 8 / 367 are part of one of the 1 SCC in 7 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 700 edges and 360 vertex of which 357 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 357 transition count 226
Reduce places removed 80 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 277 transition count 223
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 169 place count 274 transition count 223
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 169 place count 274 transition count 179
Deduced a syphon composed of 44 places in 3 ms
Ensure Unique test removed 10 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 267 place count 220 transition count 179
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 319 place count 168 transition count 127
Iterating global reduction 3 with 52 rules applied. Total rules applied 371 place count 168 transition count 127
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 371 place count 168 transition count 124
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 378 place count 164 transition count 124
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 486 place count 110 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 487 place count 109 transition count 69
Applied a total of 487 rules in 102 ms. Remains 109 /367 variables (removed 258) and now considering 69/318 (removed 249) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 109/367 places, 69/318 transitions.
Incomplete random walk after 10000 steps, including 254 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :4
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 127 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=63 )
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 8431 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/599/inv_0_ --invariant=/tmp/599/inv_1_ --invariant=/tmp/599/inv_2_ --invariant=/tmp/599/inv_3_ --invariant=/tmp/599/inv_4_ --invariant=/tmp/599/inv_5_ --invariant=/tmp/599/inv_6_ --invariant=/tmp/599/inv_7_ --invariant=/tmp/599/inv_8_ --invariant=/tmp/599/inv_9_ --invariant=/tmp/599/inv_10_ --invariant=/tmp/599/inv_11_ --invariant=/tmp/599/inv_12_ --invariant=/tmp/599/inv_13_ --invariant=/tmp/599/inv_14_ --invariant=/tmp/599/inv_15_ --inv-par
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678640232742

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name BusinessProcesses-PT-05-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/599/inv_0_
rfs formula name BusinessProcesses-PT-05-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/599/inv_1_
rfs formula name BusinessProcesses-PT-05-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/599/inv_2_
rfs formula name BusinessProcesses-PT-05-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/599/inv_3_
rfs formula name BusinessProcesses-PT-05-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/599/inv_4_
rfs formula name BusinessProcesses-PT-05-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/599/inv_5_
rfs formula name BusinessProcesses-PT-05-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/599/inv_6_
rfs formula name BusinessProcesses-PT-05-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/599/inv_7_
rfs formula name BusinessProcesses-PT-05-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/599/inv_8_
rfs formula name BusinessProcesses-PT-05-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/599/inv_9_
rfs formula name BusinessProcesses-PT-05-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/599/inv_10_
rfs formula name BusinessProcesses-PT-05-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/599/inv_11_
rfs formula name BusinessProcesses-PT-05-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/599/inv_12_
rfs formula name BusinessProcesses-PT-05-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/599/inv_13_
rfs formula name BusinessProcesses-PT-05-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/599/inv_14_
rfs formula name BusinessProcesses-PT-05-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/599/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 368 places, 319 transitions and 854 arcs
pnml2lts-sym: Petri net BusinessProcesses-PT-05 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 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: 319->319 groups
pnml2lts-sym: Regrouping took 0.070 real 0.070 user 0.000 sys
pnml2lts-sym: state vector length is 368; there are 319 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:
pnml2lts-sym: Invariant violation (/tmp/599/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/599/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/599/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/599/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/599/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/599/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/599/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/599/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/599/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/599/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/599/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/599/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/599/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 509018 group checks and 0 next state calls
pnml2lts-sym: reachability took 8.090 real 32.160 user 0.150 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.150 real 0.600 user 0.000 sys
pnml2lts-sym: state space has 2.38391315598362e+17 states, 362733 nodes
pnml2lts-sym: group_next: 1576 nodes total
pnml2lts-sym: group_explored: 822 nodes, 865 short vectors total
pnml2lts-sym: max token count: 1

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-05"
export BK_EXAMINATION="ReachabilityCardinality"
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-05, examination is ReachabilityCardinality"
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-167813694800486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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