fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r496-tall-171640602800159
Last Updated
July 7, 2024

About the Execution of LTSMin+red for FlexibleBarrier-PT-22b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
791.023 30377.00 54623.00 64.90 TTTTFFTFTTTTFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640602800159.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FlexibleBarrier-PT-22b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602800159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 13 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 13 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 08:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Apr 13 08:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:42 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 FlexibleBarrier-PT-22b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717187019095

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-22b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:23:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:23:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:23:40] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2024-05-31 20:23:40] [INFO ] Transformed 6478 places.
[2024-05-31 20:23:40] [INFO ] Transformed 7469 transitions.
[2024-05-31 20:23:40] [INFO ] Found NUPN structural information;
[2024-05-31 20:23:40] [INFO ] Parsed PT model containing 6478 places and 7469 transitions and 18797 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (272 resets) in 2457 ms. (16 steps per ms) remains 13/16 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (16 resets) in 227 ms. (175 steps per ms) remains 12/13 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (19 resets) in 171 ms. (232 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (17 resets) in 579 ms. (68 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (17 resets) in 196 ms. (203 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (16 resets) in 70 ms. (563 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (19 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (18 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (18 resets) in 107 ms. (370 steps per ms) remains 11/12 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (19 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (10 resets) in 118 ms. (336 steps per ms) remains 10/11 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 7469 rows 6478 cols
[2024-05-31 20:23:42] [INFO ] Computed 24 invariants in 277 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem FlexibleBarrier-PT-22b-ReachabilityFireability-2024-05 is UNSAT
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 6290/6478 variables, 24/212 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6478 variables, 6290/6502 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6478 variables, 0/6502 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13947/13947 variables, and 12980 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5058 ms.
Refiners :[Domain max(s): 6478/6478 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 6478/6478 constraints, PredecessorRefiner: 10/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 180/180 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem FlexibleBarrier-PT-22b-ReachabilityFireability-2024-00 is UNSAT
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 6298/6478 variables, 24/204 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6478 variables, 6298/6502 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-31 20:23:55] [INFO ] Deduced a trap composed of 2255 places in 5549 ms of which 241 ms to minimize.
SMT process timed out in 12734ms, After SMT, problems are : Problem set: 2 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 158 out of 6478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Graph (trivial) has 4913 edges and 6478 vertex of which 74 / 6478 are part of one of the 12 SCC in 23 ms
Free SCC test removed 62 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1038 transitions
Trivial Post-agglo rules discarded 1038 transitions
Performed 1038 trivial Post agglomeration. Transition count delta: 1038
Iterating post reduction 0 with 1038 rules applied. Total rules applied 1039 place count 6416 transition count 6356
Reduce places removed 1038 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 1056 rules applied. Total rules applied 2095 place count 5378 transition count 6338
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 2113 place count 5360 transition count 6338
Performed 897 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 897 Pre rules applied. Total rules applied 2113 place count 5360 transition count 5441
Deduced a syphon composed of 897 places in 17 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 3 with 1794 rules applied. Total rules applied 3907 place count 4463 transition count 5441
Discarding 2615 places :
Symmetric choice reduction at 3 with 2615 rule applications. Total rules 6522 place count 1848 transition count 2826
Iterating global reduction 3 with 2615 rules applied. Total rules applied 9137 place count 1848 transition count 2826
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 9137 place count 1848 transition count 2814
Deduced a syphon composed of 12 places in 6 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 9161 place count 1836 transition count 2814
Discarding 388 places :
Symmetric choice reduction at 3 with 388 rule applications. Total rules 9549 place count 1448 transition count 2426
Iterating global reduction 3 with 388 rules applied. Total rules applied 9937 place count 1448 transition count 2426
Ensure Unique test removed 366 transitions
Reduce isomorphic transitions removed 366 transitions.
Iterating post reduction 3 with 366 rules applied. Total rules applied 10303 place count 1448 transition count 2060
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 4 with 288 rules applied. Total rules applied 10591 place count 1304 transition count 1916
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 10607 place count 1296 transition count 1916
Free-agglomeration rule applied 314 times.
Iterating global reduction 4 with 314 rules applied. Total rules applied 10921 place count 1296 transition count 1602
Reduce places removed 314 places and 0 transitions.
Iterating post reduction 4 with 314 rules applied. Total rules applied 11235 place count 982 transition count 1602
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 11242 place count 975 transition count 1595
Iterating global reduction 5 with 7 rules applied. Total rules applied 11249 place count 975 transition count 1595
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 11256 place count 975 transition count 1588
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 11275 place count 975 transition count 1569
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 11286 place count 975 transition count 1569
Applied a total of 11286 rules in 2006 ms. Remains 975 /6478 variables (removed 5503) and now considering 1569/7469 (removed 5900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2016 ms. Remains : 975/6478 places, 1569/7469 transitions.
RANDOM walk for 40000 steps (612 resets) in 1705 ms. (23 steps per ms) remains 7/8 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (27 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (24 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (27 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (26 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (26 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (23 resets) in 127 ms. (312 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (26 resets) in 45 ms. (869 steps per ms) remains 7/7 properties
[2024-05-31 20:23:58] [INFO ] Flow matrix only has 1539 transitions (discarded 30 similar events)
// Phase 1: matrix 1539 rows 975 cols
[2024-05-31 20:23:58] [INFO ] Computed 24 invariants in 49 ms
[2024-05-31 20:23:58] [INFO ] State equation strengthened by 296 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 866/955 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/955 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 20/975 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/975 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1539/2514 variables, 975/999 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2514 variables, 296/1295 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2514 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/2514 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2514/2514 variables, and 1295 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1289 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 975/975 constraints, ReadFeed: 296/296 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 866/955 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:23:59] [INFO ] Deduced a trap composed of 8 places in 336 ms of which 5 ms to minimize.
[2024-05-31 20:24:00] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 4 ms to minimize.
[2024-05-31 20:24:00] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 3 ms to minimize.
[2024-05-31 20:24:00] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/955 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/955 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 20/975 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/975 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1539/2514 variables, 975/1003 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2514 variables, 296/1299 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2514 variables, 7/1306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:24:04] [INFO ] Deduced a trap composed of 487 places in 345 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2514 variables, 1/1307 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:24:06] [INFO ] Deduced a trap composed of 487 places in 364 ms of which 5 ms to minimize.
[2024-05-31 20:24:06] [INFO ] Deduced a trap composed of 485 places in 331 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2514 variables, 2/1309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2514 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/2514 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2514/2514 variables, and 1309 constraints, problems are : Problem set: 0 solved, 7 unsolved in 9254 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 975/975 constraints, ReadFeed: 296/296 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 7/7 constraints]
After SMT, in 10686ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 7076 steps, including 156 resets, run visited all 1 properties in 38 ms. (steps per millisecond=186 )
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 669 ms.
All properties solved without resorting to model-checking.
Total runtime 29153 ms.
ITS solved all properties within timeout

BK_STOP 1717187049472

--------------------
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.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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="FlexibleBarrier-PT-22b"
export BK_EXAMINATION="ReachabilityFireability"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-22b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640602800159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-22b.tgz
mv FlexibleBarrier-PT-22b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;