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

About the Execution of LTSMin+red for CANInsertWithFailure-PT-005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
362.020 24504.00 72333.00 94.10 FFTTTTFTTFFTTFTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 8.7K Feb 26 00:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 00:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 00:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 00:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 00:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 00:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 00:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 00:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 202K 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 CANInsertWithFailure-PT-005-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678658554877

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=CANInsertWithFailure-PT-005
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 22:02:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 22:02:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:02:38] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-12 22:02:38] [INFO ] Transformed 114 places.
[2023-03-12 22:02:38] [INFO ] Transformed 180 transitions.
[2023-03-12 22:02:38] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 100 resets, run finished after 728 ms. (steps per millisecond=13 ) properties (out of 15) seen :4
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :1
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 180 rows 114 cols
[2023-03-12 22:02:40] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-12 22:02:40] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 22:02:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-12 22:02:40] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-12 22:02:41] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :6
[2023-03-12 22:02:41] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 22:02:41] [INFO ] After 208ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :4 sat :6
[2023-03-12 22:02:41] [INFO ] After 425ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :6
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-12 22:02:41] [INFO ] After 1126ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :6
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 6 different solutions.
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 40 ms.
Support contains 53 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 180/180 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 114 transition count 174
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 108 transition count 171
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 18 place count 105 transition count 171
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 105 transition count 169
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 103 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 101 transition count 167
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 101 transition count 165
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 101 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 30 place count 100 transition count 164
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 4 with 23 rules applied. Total rules applied 53 place count 100 transition count 164
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 66 place count 100 transition count 164
Applied a total of 66 rules in 93 ms. Remains 100 /114 variables (removed 14) and now considering 164/180 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 100/114 places, 164/180 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Probably explored full state space saw : 94958 states, properties seen :1
Probabilistic random walk after 516903 steps, saw 94958 distinct states, run finished after 2801 ms. (steps per millisecond=184 ) properties seen :1
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Explored full state space saw : 94960 states, properties seen :0
Exhaustive walk after 516910 steps, saw 94960 distinct states, run finished after 2691 ms. (steps per millisecond=192 ) properties seen :0
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 9761 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/474/inv_0_ --invariant=/tmp/474/inv_1_ --invariant=/tmp/474/inv_2_ --invariant=/tmp/474/inv_3_ --invariant=/tmp/474/inv_4_ --invariant=/tmp/474/inv_5_ --invariant=/tmp/474/inv_6_ --invariant=/tmp/474/inv_7_ --invariant=/tmp/474/inv_8_ --invariant=/tmp/474/inv_9_ --invariant=/tmp/474/inv_10_ --invariant=/tmp/474/inv_11_ --invariant=/tmp/474/inv_12_ --invariant=/tmp/474/inv_13_ --invariant=/tmp/474/inv_14_ --invariant=/tmp/474/inv_15_ --inv-par
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678658579381

--------------------
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 CANInsertWithFailure-PT-005-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_0_
rfs formula name CANInsertWithFailure-PT-005-ReachabilityCardinality-01
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_1_
rfs formula name CANInsertWithFailure-PT-005-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/474/inv_2_
rfs formula name CANInsertWithFailure-PT-005-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/474/inv_3_
rfs formula name CANInsertWithFailure-PT-005-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_4_
rfs formula name CANInsertWithFailure-PT-005-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/474/inv_5_
rfs formula name CANInsertWithFailure-PT-005-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_6_
rfs formula name CANInsertWithFailure-PT-005-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/474/inv_7_
rfs formula name CANInsertWithFailure-PT-005-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_8_
rfs formula name CANInsertWithFailure-PT-005-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/474/inv_9_
rfs formula name CANInsertWithFailure-PT-005-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/474/inv_10_
rfs formula name CANInsertWithFailure-PT-005-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_11_
rfs formula name CANInsertWithFailure-PT-005-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_12_
rfs formula name CANInsertWithFailure-PT-005-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/474/inv_13_
rfs formula name CANInsertWithFailure-PT-005-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_14_
rfs formula name CANInsertWithFailure-PT-005-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/474/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 114 places, 180 transitions and 500 arcs
pnml2lts-sym: Petri net gen analyzed
pnml2lts-sym: There are no 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: 180->180 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 114; there are 180 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/474/inv_13_) found at depth 0!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 40945 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.930 real 3.710 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: state space has 200157 states, 10942 nodes
pnml2lts-sym: group_next: 1270 nodes total
pnml2lts-sym: group_explored: 1514 nodes, 1112 short vectors total
pnml2lts-sym: max token count: 5

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="CANInsertWithFailure-PT-005"
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 CANInsertWithFailure-PT-005, 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-167813695000702"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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