fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813597300014
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ASLink-PT-01a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
296.191 11692.00 34057.00 17.50 TFFTTTFTTTFTTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813597300014.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ASLink-PT-01a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597300014
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 201K 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 ASLink-PT-01a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678602264637

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=ASLink-PT-01a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 06:24:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 06:24:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 06:24:27] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2023-03-12 06:24:27] [INFO ] Transformed 431 places.
[2023-03-12 06:24:27] [INFO ] Transformed 735 transitions.
[2023-03-12 06:24:27] [INFO ] Found NUPN structural information;
[2023-03-12 06:24:27] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
FORMULA ASLink-PT-01a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 181 resets, run finished after 801 ms. (steps per millisecond=12 ) properties (out of 13) seen :8
FORMULA ASLink-PT-01a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :1
FORMULA ASLink-PT-01a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 728 rows 431 cols
[2023-03-12 06:24:29] [INFO ] Computed 80 place invariants in 26 ms
[2023-03-12 06:24:29] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 06:24:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-12 06:24:29] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 16 ms returned sat
[2023-03-12 06:24:30] [INFO ] After 504ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-12 06:24:30] [INFO ] Deduced a trap composed of 119 places in 212 ms of which 13 ms to minimize.
[2023-03-12 06:24:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2023-03-12 06:24:30] [INFO ] After 974ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-03-12 06:24:30] [INFO ] After 1341ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
FORMULA ASLink-PT-01a-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 29 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 426 transition count 702
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 58 place count 400 transition count 701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 399 transition count 701
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 59 place count 399 transition count 675
Deduced a syphon composed of 26 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 61 rules applied. Total rules applied 120 place count 364 transition count 675
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 124 place count 360 transition count 658
Ensure Unique test removed 1 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 129 place count 359 transition count 658
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 134 place count 358 transition count 654
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 136 place count 356 transition count 654
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 137 place count 355 transition count 646
Iterating global reduction 5 with 1 rules applied. Total rules applied 138 place count 355 transition count 646
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 139 place count 354 transition count 638
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 354 transition count 638
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 141 place count 353 transition count 630
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 353 transition count 630
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 154 place count 347 transition count 624
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 347 transition count 623
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 156 place count 346 transition count 623
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 158 place count 346 transition count 621
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 160 place count 344 transition count 621
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 161 place count 343 transition count 620
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 162 place count 342 transition count 620
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 162 place count 342 transition count 619
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 164 place count 341 transition count 619
Applied a total of 164 rules in 245 ms. Remains 341 /431 variables (removed 90) and now considering 619/728 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 341/431 places, 619/728 transitions.
Incomplete random walk after 10000 steps, including 187 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 59406 steps, run visited all 1 properties in 356 ms. (steps per millisecond=166 )
Probabilistic random walk after 59406 steps, saw 26381 distinct states, run finished after 356 ms. (steps per millisecond=166 ) properties seen :1
FORMULA ASLink-PT-01a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 4257 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/475/inv_0_ --invariant=/tmp/475/inv_1_ --invariant=/tmp/475/inv_2_ --invariant=/tmp/475/inv_3_ --invariant=/tmp/475/inv_4_ --invariant=/tmp/475/inv_5_ --invariant=/tmp/475/inv_6_ --invariant=/tmp/475/inv_7_ --invariant=/tmp/475/inv_8_ --invariant=/tmp/475/inv_9_ --invariant=/tmp/475/inv_10_ --invariant=/tmp/475/inv_11_ --invariant=/tmp/475/inv_12_ --invariant=/tmp/475/inv_13_ --invariant=/tmp/475/inv_14_ --invariant=/tmp/475/inv_15_ --inv-par
FORMULA ASLink-PT-01a-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-01a-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-01a-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-01a-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-01a-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-01a-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-01a-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-01a-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-01a-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-01a-ReachabilityCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-01a-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-01a-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-01a-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-01a-ReachabilityCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-01a-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-01a-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678602276329

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name ASLink-PT-01a-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_0_
rfs formula name ASLink-PT-01a-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_1_
rfs formula name ASLink-PT-01a-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_2_
rfs formula name ASLink-PT-01a-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_3_
rfs formula name ASLink-PT-01a-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_4_
rfs formula name ASLink-PT-01a-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_5_
rfs formula name ASLink-PT-01a-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_6_
rfs formula name ASLink-PT-01a-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_7_
rfs formula name ASLink-PT-01a-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_8_
rfs formula name ASLink-PT-01a-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_9_
rfs formula name ASLink-PT-01a-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_10_
rfs formula name ASLink-PT-01a-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_11_
rfs formula name ASLink-PT-01a-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_12_
rfs formula name ASLink-PT-01a-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/475/inv_13_
rfs formula name ASLink-PT-01a-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/475/inv_14_
rfs formula name ASLink-PT-01a-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/475/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 431 places, 735 transitions and 2801 arcs
pnml2lts-sym: Petri net ASLink-PT-01a analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.010 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: 735->728 groups
pnml2lts-sym: Regrouping took 0.200 real 0.200 user 0.000 sys
pnml2lts-sym: state vector length is 431; there are 728 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/475/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/475/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 366470 group checks and 0 next state calls
pnml2lts-sym: reachability took 3.370 real 13.370 user 0.040 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.040 user 0.000 sys
pnml2lts-sym: state space has 189402887 states, 59180 nodes
pnml2lts-sym: group_next: 2451 nodes total
pnml2lts-sym: group_explored: 3189 nodes, 2272 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="ASLink-PT-01a"
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 ASLink-PT-01a, 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 r009-oct2-167813597300014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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