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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:43 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.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 16:44 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 59K 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-02-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678639666018

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-02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:47:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:47:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:47:47] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-12 16:47:47] [INFO ] Transformed 262 places.
[2023-03-12 16:47:47] [INFO ] Transformed 219 transitions.
[2023-03-12 16:47:47] [INFO ] Found NUPN structural information;
[2023-03-12 16:47:47] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 111 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 137 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 15) seen :6
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 204 rows 245 cols
[2023-03-12 16:47:48] [INFO ] Computed 43 place invariants in 12 ms
[2023-03-12 16:47:49] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 16:47:49] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-12 16:47:49] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-12 16:47:49] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2023-03-12 16:47:49] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 7 ms to minimize.
[2023-03-12 16:47:49] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-12 16:47:49] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 2 ms to minimize.
[2023-03-12 16:47:49] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2023-03-12 16:47:49] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-12 16:47:49] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2023-03-12 16:47:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 406 ms
[2023-03-12 16:47:50] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2023-03-12 16:47:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-12 16:47:50] [INFO ] After 778ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :5
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-12 16:47:50] [INFO ] After 1045ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :5
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 22 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 204/204 transitions.
Graph (complete) has 446 edges and 245 vertex of which 233 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 233 transition count 167
Reduce places removed 30 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 203 transition count 163
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 70 place count 199 transition count 163
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 70 place count 199 transition count 118
Deduced a syphon composed of 45 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 166 place count 148 transition count 118
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 193 place count 121 transition count 91
Iterating global reduction 3 with 27 rules applied. Total rules applied 220 place count 121 transition count 91
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 290 place count 85 transition count 57
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 291 place count 85 transition count 56
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 293 place count 85 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 294 place count 84 transition count 55
Applied a total of 294 rules in 90 ms. Remains 84 /245 variables (removed 161) and now considering 55/204 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 84/245 places, 55/204 transitions.
Incomplete random walk after 10000 steps, including 548 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :4
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 186 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 55 rows 84 cols
[2023-03-12 16:47:50] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-12 16:47:50] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:47:50] [INFO ] [Nat]Absence check using 25 positive place invariants in 4 ms returned sat
[2023-03-12 16:47:50] [INFO ] [Nat]Absence check using 25 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-12 16:47:50] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:47:50] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2023-03-12 16:47:50] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2023-03-12 16:47:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 45 ms
[2023-03-12 16:47:50] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-12 16:47:50] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 55/55 transitions.
Graph (trivial) has 19 edges and 84 vertex of which 2 / 84 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 83 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 81 transition count 51
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 81 transition count 45
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 18 place count 74 transition count 45
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 73 transition count 44
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 73 transition count 44
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 42 place count 62 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 61 transition count 32
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 61 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 60 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 59 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 58 transition count 30
Applied a total of 48 rules in 26 ms. Remains 58 /84 variables (removed 26) and now considering 30/55 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 58/84 places, 30/55 transitions.
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2945 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/494/inv_0_ --invariant=/tmp/494/inv_1_ --invariant=/tmp/494/inv_2_ --invariant=/tmp/494/inv_3_ --invariant=/tmp/494/inv_4_ --invariant=/tmp/494/inv_5_ --invariant=/tmp/494/inv_6_ --invariant=/tmp/494/inv_7_ --invariant=/tmp/494/inv_8_ --invariant=/tmp/494/inv_9_ --invariant=/tmp/494/inv_10_ --invariant=/tmp/494/inv_11_ --invariant=/tmp/494/inv_12_ --invariant=/tmp/494/inv_13_ --invariant=/tmp/494/inv_14_ --invariant=/tmp/494/inv_15_ --inv-par
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678639671244

--------------------
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.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-02-ReachabilityFireability-00
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_0_
rfs formula name BusinessProcesses-PT-02-ReachabilityFireability-01
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_1_
rfs formula name BusinessProcesses-PT-02-ReachabilityFireability-02
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_2_
rfs formula name BusinessProcesses-PT-02-ReachabilityFireability-03
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_3_
rfs formula name BusinessProcesses-PT-02-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_4_
rfs formula name BusinessProcesses-PT-02-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_5_
rfs formula name BusinessProcesses-PT-02-ReachabilityFireability-06
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_6_
rfs formula name BusinessProcesses-PT-02-ReachabilityFireability-07
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_7_
rfs formula name BusinessProcesses-PT-02-ReachabilityFireability-08
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_8_
rfs formula name BusinessProcesses-PT-02-ReachabilityFireability-09
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_9_
rfs formula name BusinessProcesses-PT-02-ReachabilityFireability-10
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_10_
rfs formula name BusinessProcesses-PT-02-ReachabilityFireability-11
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_11_
rfs formula name BusinessProcesses-PT-02-ReachabilityFireability-12
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_12_
rfs formula name BusinessProcesses-PT-02-ReachabilityFireability-13
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_13_
rfs formula name BusinessProcesses-PT-02-ReachabilityFireability-14
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_14_
rfs formula name BusinessProcesses-PT-02-ReachabilityFireability-15
rfs formula type EF
rfs formula formula --invariant=/tmp/494/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 262 places, 219 transitions and 576 arcs
pnml2lts-sym: Petri net BusinessProcesses-PT-02 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.010 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: 219->219 groups
pnml2lts-sym: Regrouping took 0.030 real 0.040 user 0.000 sys
pnml2lts-sym: state vector length is 262; there are 219 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/494/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/494/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/494/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/494/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/494/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/494/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/494/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/494/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/494/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/494/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/494/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 14251 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.130 real 0.490 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.020 user 0.000 sys
pnml2lts-sym: state space has 3143150756787 states, 9164 nodes
pnml2lts-sym: group_next: 1009 nodes total
pnml2lts-sym: group_explored: 536 nodes, 573 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-02"
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-02, 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-167813694700463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-02.tgz
mv BusinessProcesses-PT-02 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 ;