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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K 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.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 177K 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-18-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678648449881

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-18
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:14:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 19:14:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:14:11] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-12 19:14:11] [INFO ] Transformed 717 places.
[2023-03-12 19:14:11] [INFO ] Transformed 642 transitions.
[2023-03-12 19:14:11] [INFO ] Found NUPN structural information;
[2023-03-12 19:14:11] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 33 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 52 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 12) seen :8
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 627 rows 702 cols
[2023-03-12 19:14:12] [INFO ] Computed 114 place invariants in 46 ms
[2023-03-12 19:14:13] [INFO ] After 480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 19:14:13] [INFO ] [Nat]Absence check using 73 positive place invariants in 38 ms returned sat
[2023-03-12 19:14:13] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-12 19:14:14] [INFO ] After 604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 19:14:14] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 8 ms to minimize.
[2023-03-12 19:14:14] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2023-03-12 19:14:15] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 1 ms to minimize.
[2023-03-12 19:14:15] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 1 ms to minimize.
[2023-03-12 19:14:15] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2023-03-12 19:14:15] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 1 ms to minimize.
[2023-03-12 19:14:15] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 1 ms to minimize.
[2023-03-12 19:14:15] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 1 ms to minimize.
[2023-03-12 19:14:16] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 5 ms to minimize.
[2023-03-12 19:14:16] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 0 ms to minimize.
[2023-03-12 19:14:16] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 1 ms to minimize.
[2023-03-12 19:14:16] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 1 ms to minimize.
[2023-03-12 19:14:16] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2023-03-12 19:14:17] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 1 ms to minimize.
[2023-03-12 19:14:17] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 1 ms to minimize.
[2023-03-12 19:14:17] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 0 ms to minimize.
[2023-03-12 19:14:17] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 0 ms to minimize.
[2023-03-12 19:14:17] [INFO ] Deduced a trap composed of 62 places in 139 ms of which 1 ms to minimize.
[2023-03-12 19:14:17] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 0 ms to minimize.
[2023-03-12 19:14:18] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 0 ms to minimize.
[2023-03-12 19:14:18] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 0 ms to minimize.
[2023-03-12 19:14:18] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 1 ms to minimize.
[2023-03-12 19:14:18] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 1 ms to minimize.
[2023-03-12 19:14:18] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 0 ms to minimize.
[2023-03-12 19:14:18] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4121 ms
[2023-03-12 19:14:18] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 0 ms to minimize.
[2023-03-12 19:14:19] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 0 ms to minimize.
[2023-03-12 19:14:19] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2023-03-12 19:14:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 482 ms
[2023-03-12 19:14:19] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 1 ms to minimize.
[2023-03-12 19:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 245 ms
[2023-03-12 19:14:19] [INFO ] After 5660ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-12 19:14:19] [INFO ] After 6294ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 20 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 627/627 transitions.
Graph (trivial) has 393 edges and 702 vertex of which 7 / 702 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1410 edges and 696 vertex of which 688 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 153 place count 688 transition count 467
Reduce places removed 151 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 156 rules applied. Total rules applied 309 place count 537 transition count 462
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 314 place count 532 transition count 462
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 314 place count 532 transition count 363
Deduced a syphon composed of 99 places in 3 ms
Ensure Unique test removed 22 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 534 place count 411 transition count 363
Discarding 86 places :
Symmetric choice reduction at 3 with 86 rule applications. Total rules 620 place count 325 transition count 277
Iterating global reduction 3 with 86 rules applied. Total rules applied 706 place count 325 transition count 277
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 706 place count 325 transition count 267
Deduced a syphon composed of 10 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 729 place count 312 transition count 267
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 730 place count 311 transition count 266
Iterating global reduction 3 with 1 rules applied. Total rules applied 731 place count 311 transition count 266
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 939 place count 207 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 941 place count 206 transition count 165
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 942 place count 206 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 943 place count 205 transition count 164
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 947 place count 205 transition count 164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 948 place count 204 transition count 163
Applied a total of 948 rules in 210 ms. Remains 204 /702 variables (removed 498) and now considering 163/627 (removed 464) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 204/702 places, 163/627 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :2
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 163 rows 204 cols
[2023-03-12 19:14:20] [INFO ] Computed 82 place invariants in 6 ms
[2023-03-12 19:14:20] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:14:20] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-12 19:14:20] [INFO ] [Nat]Absence check using 65 positive and 17 generalized place invariants in 14 ms returned sat
[2023-03-12 19:14:20] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:14:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 19:14:20] [INFO ] After 9ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:14:20] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-12 19:14:20] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-12 19:14:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2023-03-12 19:14:20] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-12 19:14:20] [INFO ] After 322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 9062 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/571/inv_0_ --invariant=/tmp/571/inv_1_ --invariant=/tmp/571/inv_2_ --invariant=/tmp/571/inv_3_ --invariant=/tmp/571/inv_4_ --invariant=/tmp/571/inv_5_ --invariant=/tmp/571/inv_6_ --invariant=/tmp/571/inv_7_ --invariant=/tmp/571/inv_8_ --invariant=/tmp/571/inv_9_ --invariant=/tmp/571/inv_10_ --invariant=/tmp/571/inv_11_ --invariant=/tmp/571/inv_12_ --invariant=/tmp/571/inv_13_ --invariant=/tmp/571/inv_14_ --invariant=/tmp/571/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 5803312 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16101952 kB
Could not compute solution for formula : BusinessProcesses-PT-18-ReachabilityCardinality-00
Could not compute solution for formula : BusinessProcesses-PT-18-ReachabilityCardinality-01
Could not compute solution for formula : BusinessProcesses-PT-18-ReachabilityCardinality-02
Could not compute solution for formula : BusinessProcesses-PT-18-ReachabilityCardinality-03
Could not compute solution for formula : BusinessProcesses-PT-18-ReachabilityCardinality-04
Could not compute solution for formula : BusinessProcesses-PT-18-ReachabilityCardinality-05
Could not compute solution for formula : BusinessProcesses-PT-18-ReachabilityCardinality-06
Could not compute solution for formula : BusinessProcesses-PT-18-ReachabilityCardinality-07
Could not compute solution for formula : BusinessProcesses-PT-18-ReachabilityCardinality-08
Could not compute solution for formula : BusinessProcesses-PT-18-ReachabilityCardinality-09
Could not compute solution for formula : BusinessProcesses-PT-18-ReachabilityCardinality-10
Could not compute solution for formula : BusinessProcesses-PT-18-ReachabilityCardinality-11
Could not compute solution for formula : BusinessProcesses-PT-18-ReachabilityCardinality-12
Could not compute solution for formula : BusinessProcesses-PT-18-ReachabilityCardinality-13
Could not compute solution for formula : BusinessProcesses-PT-18-ReachabilityCardinality-14
Could not compute solution for formula : BusinessProcesses-PT-18-ReachabilityCardinality-15

BK_STOP 1678652032225

--------------------
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-18-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/571/inv_0_
rfs formula name BusinessProcesses-PT-18-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/571/inv_1_
rfs formula name BusinessProcesses-PT-18-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/571/inv_2_
rfs formula name BusinessProcesses-PT-18-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/571/inv_3_
rfs formula name BusinessProcesses-PT-18-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/571/inv_4_
rfs formula name BusinessProcesses-PT-18-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/571/inv_5_
rfs formula name BusinessProcesses-PT-18-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/571/inv_6_
rfs formula name BusinessProcesses-PT-18-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/571/inv_7_
rfs formula name BusinessProcesses-PT-18-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/571/inv_8_
rfs formula name BusinessProcesses-PT-18-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/571/inv_9_
rfs formula name BusinessProcesses-PT-18-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/571/inv_10_
rfs formula name BusinessProcesses-PT-18-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/571/inv_11_
rfs formula name BusinessProcesses-PT-18-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/571/inv_12_
rfs formula name BusinessProcesses-PT-18-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/571/inv_13_
rfs formula name BusinessProcesses-PT-18-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/571/inv_14_
rfs formula name BusinessProcesses-PT-18-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/571/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 717 places, 642 transitions and 1860 arcs
pnml2lts-sym: Petri net BusinessProcesses-PT-18 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 642->642 groups
pnml2lts-sym: Regrouping took 0.230 real 0.220 user 0.000 sys
pnml2lts-sym: state vector length is 717; there are 642 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 577
Killing (9) : 577

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-18"
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-18, 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-167813694900590"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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