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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:46 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.3K 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 17K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:47 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 47K 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-01-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678639587831

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-01
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:46:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:46:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:46:30] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-12 16:46:30] [INFO ] Transformed 200 places.
[2023-03-12 16:46:30] [INFO ] Transformed 178 transitions.
[2023-03-12 16:46:30] [INFO ] Found NUPN structural information;
[2023-03-12 16:46:30] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 113 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 12) seen :9
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 177 rows 199 cols
[2023-03-12 16:46:31] [INFO ] Computed 30 place invariants in 9 ms
[2023-03-12 16:46:32] [INFO ] After 408ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:46:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 103 ms returned sat
[2023-03-12 16:46:32] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 8 ms returned sat
[2023-03-12 16:46:32] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:46:32] [INFO ] Deduced a trap composed of 8 places in 372 ms of which 99 ms to minimize.
[2023-03-12 16:46:33] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 1 ms to minimize.
[2023-03-12 16:46:33] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 1 ms to minimize.
[2023-03-12 16:46:33] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 2 ms to minimize.
[2023-03-12 16:46:33] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 2 ms to minimize.
[2023-03-12 16:46:33] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 1 ms to minimize.
[2023-03-12 16:46:33] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2023-03-12 16:46:33] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 2 ms to minimize.
[2023-03-12 16:46:33] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 1 ms to minimize.
[2023-03-12 16:46:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1302 ms
[2023-03-12 16:46:33] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-12 16:46:34] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2023-03-12 16:46:34] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2023-03-12 16:46:34] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 0 ms to minimize.
[2023-03-12 16:46:35] [INFO ] Deduced a trap composed of 14 places in 719 ms of which 1 ms to minimize.
[2023-03-12 16:46:35] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2023-03-12 16:46:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1336 ms
[2023-03-12 16:46:35] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2023-03-12 16:46:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-12 16:46:35] [INFO ] After 2959ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-12 16:46:35] [INFO ] After 3508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 51 ms.
Support contains 10 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 177/177 transitions.
Graph (trivial) has 112 edges and 199 vertex of which 8 / 199 are part of one of the 1 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 372 edges and 192 vertex of which 189 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 189 transition count 129
Reduce places removed 37 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 42 rules applied. Total rules applied 81 place count 152 transition count 124
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 147 transition count 124
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 86 place count 147 transition count 103
Deduced a syphon composed of 21 places in 8 ms
Ensure Unique test removed 4 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 132 place count 122 transition count 103
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 154 place count 100 transition count 81
Iterating global reduction 3 with 22 rules applied. Total rules applied 176 place count 100 transition count 81
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 176 place count 100 transition count 78
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 182 place count 97 transition count 78
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 238 place count 69 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 240 place count 68 transition count 53
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 241 place count 68 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 242 place count 67 transition count 52
Applied a total of 242 rules in 124 ms. Remains 67 /199 variables (removed 132) and now considering 52/177 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 67/199 places, 52/177 transitions.
Incomplete random walk after 10000 steps, including 528 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 194 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 171 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 52 rows 67 cols
[2023-03-12 16:46:35] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-12 16:46:35] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:46:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-12 16:46:36] [INFO ] [Nat]Absence check using 18 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-12 16:46:36] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:46:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 16:46:36] [INFO ] After 4ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:46:36] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2023-03-12 16:46:36] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 26 ms to minimize.
[2023-03-12 16:46:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
[2023-03-12 16:46:36] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 16:46:36] [INFO ] After 368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 52/52 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 66 transition count 51
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 63 transition count 48
Applied a total of 8 rules in 8 ms. Remains 63 /67 variables (removed 4) and now considering 48/52 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 63/67 places, 48/52 transitions.
Incomplete random walk after 10000 steps, including 602 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 242 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10072 steps, run visited all 1 properties in 44 ms. (steps per millisecond=228 )
Probabilistic random walk after 10072 steps, saw 2733 distinct states, run finished after 44 ms. (steps per millisecond=228 ) properties seen :1
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 6026 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/531/inv_0_ --invariant=/tmp/531/inv_1_ --invariant=/tmp/531/inv_2_ --invariant=/tmp/531/inv_3_ --invariant=/tmp/531/inv_4_ --invariant=/tmp/531/inv_5_ --invariant=/tmp/531/inv_6_ --invariant=/tmp/531/inv_7_ --invariant=/tmp/531/inv_8_ --invariant=/tmp/531/inv_9_ --invariant=/tmp/531/inv_10_ --invariant=/tmp/531/inv_11_ --invariant=/tmp/531/inv_12_ --invariant=/tmp/531/inv_13_ --invariant=/tmp/531/inv_14_ --invariant=/tmp/531/inv_15_ --inv-par
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678639600318

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name BusinessProcesses-PT-01-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/531/inv_0_
rfs formula name BusinessProcesses-PT-01-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/531/inv_1_
rfs formula name BusinessProcesses-PT-01-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/531/inv_2_
rfs formula name BusinessProcesses-PT-01-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/531/inv_3_
rfs formula name BusinessProcesses-PT-01-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/531/inv_4_
rfs formula name BusinessProcesses-PT-01-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/531/inv_5_
rfs formula name BusinessProcesses-PT-01-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/531/inv_6_
rfs formula name BusinessProcesses-PT-01-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/531/inv_7_
rfs formula name BusinessProcesses-PT-01-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/531/inv_8_
rfs formula name BusinessProcesses-PT-01-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/531/inv_9_
rfs formula name BusinessProcesses-PT-01-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/531/inv_10_
rfs formula name BusinessProcesses-PT-01-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/531/inv_11_
rfs formula name BusinessProcesses-PT-01-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/531/inv_12_
rfs formula name BusinessProcesses-PT-01-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/531/inv_13_
rfs formula name BusinessProcesses-PT-01-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/531/inv_14_
rfs formula name BusinessProcesses-PT-01-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/531/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 200 places, 178 transitions and 487 arcs
pnml2lts-sym: Petri net BusinessProcesses-PT-01 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.010 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: 178->178 groups
pnml2lts-sym: Regrouping took 0.030 real 0.030 user 0.000 sys
pnml2lts-sym: state vector length is 200; there are 178 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/531/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/531/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/531/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/531/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/531/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/531/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/531/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/531/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/531/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/531/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/531/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/531/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 35976 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.960 real 3.780 user 0.020 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.080 user 0.000 sys
pnml2lts-sym: state space has 24160976859 states, 16750 nodes
pnml2lts-sym: group_next: 855 nodes total
pnml2lts-sym: group_explored: 477 nodes, 497 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-01"
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-01, 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-167813694700454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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