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

About the Execution of LTSMin+red for TokenRing-PT-020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
624.340 1449075.00 5626402.00 3674.20 FTFFFFFFFFTTTTFT 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.r489-tall-167912707100678.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 TokenRing-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707100678
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 130M
-rw-r--r-- 1 mcc users 700K Feb 25 15:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.5M Feb 25 15:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4M Feb 25 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 20M Feb 25 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 246K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 823K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3M Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3M Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 725K Feb 25 16:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Feb 25 16:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17M Feb 25 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62M Feb 25 16:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 47K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 121K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.0M Mar 5 18:23 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 TokenRing-PT-020-ReachabilityCardinality-00
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-01
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-02
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-03
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-04
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-05
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-06
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-07
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-08
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-09
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-10
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-11
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-12
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-13
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-14
FORMULA_NAME TokenRing-PT-020-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679299391274

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=TokenRing-PT-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 08:03:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 08:03:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 08:03:13] [INFO ] Load time of PNML (sax parser for PT used): 368 ms
[2023-03-20 08:03:13] [INFO ] Transformed 441 places.
[2023-03-20 08:03:13] [INFO ] Transformed 8421 transitions.
[2023-03-20 08:03:13] [INFO ] Parsed PT model containing 441 places and 8421 transitions and 33684 arcs in 520 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 174 ms.
Working with output stream class java.io.PrintStream
FORMULA TokenRing-PT-020-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 8) seen :4
FORMULA TokenRing-PT-020-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-020-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-020-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-020-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 08:03:15] [INFO ] Computed 21 place invariants in 53 ms
[2023-03-20 08:03:15] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 08:03:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2023-03-20 08:03:17] [INFO ] After 1766ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-20 08:03:17] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:03:24] [INFO ] After 6504ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-20 08:03:28] [INFO ] Deduced a trap composed of 250 places in 3093 ms of which 12 ms to minimize.
[2023-03-20 08:03:28] [INFO ] Deduced a trap composed of 255 places in 562 ms of which 1 ms to minimize.
[2023-03-20 08:03:29] [INFO ] Deduced a trap composed of 246 places in 591 ms of which 1 ms to minimize.
[2023-03-20 08:03:30] [INFO ] Deduced a trap composed of 245 places in 573 ms of which 2 ms to minimize.
[2023-03-20 08:03:31] [INFO ] Deduced a trap composed of 243 places in 522 ms of which 1 ms to minimize.
[2023-03-20 08:03:32] [INFO ] Deduced a trap composed of 246 places in 521 ms of which 0 ms to minimize.
[2023-03-20 08:03:32] [INFO ] Deduced a trap composed of 246 places in 534 ms of which 1 ms to minimize.
[2023-03-20 08:03:33] [INFO ] Deduced a trap composed of 246 places in 532 ms of which 0 ms to minimize.
[2023-03-20 08:03:34] [INFO ] Deduced a trap composed of 246 places in 569 ms of which 1 ms to minimize.
[2023-03-20 08:03:35] [INFO ] Deduced a trap composed of 245 places in 515 ms of which 0 ms to minimize.
[2023-03-20 08:03:36] [INFO ] Deduced a trap composed of 243 places in 535 ms of which 0 ms to minimize.
[2023-03-20 08:03:36] [INFO ] Deduced a trap composed of 247 places in 554 ms of which 0 ms to minimize.
[2023-03-20 08:03:37] [INFO ] Deduced a trap composed of 246 places in 513 ms of which 0 ms to minimize.
[2023-03-20 08:03:38] [INFO ] Deduced a trap composed of 247 places in 585 ms of which 0 ms to minimize.
[2023-03-20 08:03:39] [INFO ] Deduced a trap composed of 243 places in 567 ms of which 1 ms to minimize.
[2023-03-20 08:03:40] [INFO ] Deduced a trap composed of 242 places in 597 ms of which 2 ms to minimize.
[2023-03-20 08:03:41] [INFO ] Deduced a trap composed of 246 places in 546 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:03:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:03:41] [INFO ] After 25415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
FORMULA TokenRing-PT-020-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TokenRing-PT-020-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 97 ms.
Support contains 74 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 457 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 463 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 41980 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41980 steps, saw 9951 distinct states, run finished after 3002 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 08:03:45] [INFO ] Invariant cache hit.
[2023-03-20 08:03:45] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:03:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-20 08:03:46] [INFO ] After 1511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:03:46] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 08:03:51] [INFO ] After 4812ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 08:03:53] [INFO ] Deduced a trap composed of 248 places in 536 ms of which 0 ms to minimize.
[2023-03-20 08:03:54] [INFO ] Deduced a trap composed of 249 places in 532 ms of which 0 ms to minimize.
[2023-03-20 08:03:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1700 ms
[2023-03-20 08:03:54] [INFO ] After 7380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 809 ms.
[2023-03-20 08:03:55] [INFO ] After 9907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 67 ms.
Support contains 74 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 280 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 264 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 08:03:55] [INFO ] Invariant cache hit.
[2023-03-20 08:03:56] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-20 08:03:56] [INFO ] Invariant cache hit.
[2023-03-20 08:03:57] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 2160 ms to find 0 implicit places.
[2023-03-20 08:03:59] [INFO ] Redundant transitions in 1430 ms returned []
[2023-03-20 08:03:59] [INFO ] Invariant cache hit.
[2023-03-20 08:04:01] [INFO ] Dead Transitions using invariants and state equation in 2599 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6468 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 5864 edges and 441 vertex of which 351 / 441 are part of one of the 20 SCC in 10 ms
Free SCC test removed 331 places
Drop transitions removed 5852 transitions
Ensure Unique test removed 2198 transitions
Reduce isomorphic transitions removed 8050 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 110 transition count 362
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 22 place count 101 transition count 359
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 98 transition count 359
Drop transitions removed 232 transitions
Redundant transition composition rules discarded 232 transitions
Iterating global reduction 3 with 232 rules applied. Total rules applied 257 place count 98 transition count 127
Applied a total of 257 rules in 45 ms. Remains 98 /441 variables (removed 343) and now considering 127/8421 (removed 8294) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 127 rows 98 cols
[2023-03-20 08:04:02] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-20 08:04:02] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:04:02] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 08:04:02] [INFO ] After 515ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:04:02] [INFO ] After 579ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-20 08:04:02] [INFO ] After 713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 08:04:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 12 ms.
[2023-03-20 08:04:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 441 places, 8421 transitions and 33684 arcs took 48 ms.
[2023-03-20 08:04:04] [INFO ] Flatten gal took : 674 ms
Total runtime 51183 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/557/inv_0_ --invariant=/tmp/557/inv_1_ --inv-par
FORMULA TokenRing-PT-020-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA TokenRing-PT-020-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679300840349

--------------------
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//
++ perl -pe 's/.*\.//g'
++ 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 TokenRing-PT-020-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/557/inv_0_
rfs formula name TokenRing-PT-020-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/557/inv_1_
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 441 places, 8421 transitions and 33684 arcs
pnml2lts-sym: Petri net TokenRing_PT_020 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.070 real 0.070 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: 8421->8421 groups
pnml2lts-sym: Regrouping took 8.180 real 8.160 user 0.000 sys
pnml2lts-sym: state vector length is 441; there are 8421 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: Exploration took 190602449 group checks and 0 next state calls
pnml2lts-sym: reachability took 1361.800 real 5442.990 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.020 real 0.050 user 0.000 sys
pnml2lts-sym: state space has 24466267459 states, 56342 nodes
pnml2lts-sym: group_next: 13860 nodes total
pnml2lts-sym: group_explored: 65660 nodes, 43873 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="TokenRing-PT-020"
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 TokenRing-PT-020, 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 r489-tall-167912707100678"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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