fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r025-smll-171620166800503
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for BART-PT-060

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9443.812 133007.00 236787.00 470.80 TTTFFTTFTTTTTTTT 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.r025-smll-171620166800503.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 greatspnxred
Input is BART-PT-060, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166800503
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 134M
-rw-r--r-- 1 mcc users 4.6M Apr 13 01:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16M Apr 13 01:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7M Apr 12 22:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 12M Apr 12 22:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.1M Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 5.5M Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2M Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.3M Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3M Apr 13 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23M Apr 13 06:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9M Apr 13 03:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32M Apr 13 03:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 15M 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 BART-PT-060-ReachabilityFireability-2024-00
FORMULA_NAME BART-PT-060-ReachabilityFireability-2024-01
FORMULA_NAME BART-PT-060-ReachabilityFireability-2024-02
FORMULA_NAME BART-PT-060-ReachabilityFireability-2024-03
FORMULA_NAME BART-PT-060-ReachabilityFireability-2024-04
FORMULA_NAME BART-PT-060-ReachabilityFireability-2024-05
FORMULA_NAME BART-PT-060-ReachabilityFireability-2024-06
FORMULA_NAME BART-PT-060-ReachabilityFireability-2024-07
FORMULA_NAME BART-PT-060-ReachabilityFireability-2024-08
FORMULA_NAME BART-PT-060-ReachabilityFireability-2024-09
FORMULA_NAME BART-PT-060-ReachabilityFireability-2024-10
FORMULA_NAME BART-PT-060-ReachabilityFireability-2024-11
FORMULA_NAME BART-PT-060-ReachabilityFireability-2024-12
FORMULA_NAME BART-PT-060-ReachabilityFireability-2024-13
FORMULA_NAME BART-PT-060-ReachabilityFireability-2024-14
FORMULA_NAME BART-PT-060-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716391174908

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-060
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 15:19:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 15:19:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 15:19:39] [INFO ] Load time of PNML (sax parser for PT used): 1605 ms
[2024-05-22 15:19:39] [INFO ] Transformed 8130 places.
[2024-05-22 15:19:39] [INFO ] Transformed 12120 transitions.
[2024-05-22 15:19:39] [INFO ] Found NUPN structural information;
[2024-05-22 15:19:39] [INFO ] Parsed PT model containing 8130 places and 12120 transitions and 97200 arcs in 1987 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 1018 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-060-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 6544 ms. (6 steps per ms) remains 8/15 properties
FORMULA BART-PT-060-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 8688 ms. (4 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8288 ms. (4 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 7/8 properties
FORMULA BART-PT-060-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 12120 rows 7920 cols
[2024-05-22 15:19:49] [INFO ] Computed 60 invariants in 219 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5900 variables, 5900/5900 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5900/20040 variables, and 5900 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5154 ms.
Refiners :[Domain max(s): 5900/7920 constraints, Positive P Invariants (semi-flows): 0/60 constraints, State Equation: 0/7920 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5900 variables, 5900/5900 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5900/20040 variables, and 5900 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5019 ms.
Refiners :[Domain max(s): 5900/7920 constraints, Positive P Invariants (semi-flows): 0/60 constraints, State Equation: 0/7920 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 17196ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5900 out of 7920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 7920 transition count 12063
Reduce places removed 57 places and 0 transitions.
Performed 471 Post agglomeration using F-continuation condition.Transition count delta: 471
Iterating post reduction 1 with 528 rules applied. Total rules applied 585 place count 7863 transition count 11592
Reduce places removed 471 places and 0 transitions.
Iterating post reduction 2 with 471 rules applied. Total rules applied 1056 place count 7392 transition count 11592
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 1056 place count 7392 transition count 11531
Deduced a syphon composed of 61 places in 9 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 1178 place count 7331 transition count 11531
Performed 827 Post agglomeration using F-continuation condition.Transition count delta: 827
Deduced a syphon composed of 827 places in 5 ms
Reduce places removed 827 places and 0 transitions.
Iterating global reduction 3 with 1654 rules applied. Total rules applied 2832 place count 6504 transition count 10704
Drop transitions (Redundant composition of simpler transitions.) removed 2157 transitions
Redundant transition composition rules discarded 2157 transitions
Iterating global reduction 3 with 2157 rules applied. Total rules applied 4989 place count 6504 transition count 8547
Applied a total of 4989 rules in 1702 ms. Remains 6504 /7920 variables (removed 1416) and now considering 8547/12120 (removed 3573) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1722 ms. Remains : 6504/7920 places, 8547/12120 transitions.
RANDOM walk for 40000 steps (8 resets) in 1979 ms. (20 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8273 ms. (4 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7695 ms. (5 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 97537 steps, run timeout after 12004 ms. (steps per millisecond=8 ) properties seen :0 out of 7
Probabilistic random walk after 97537 steps, saw 94507 distinct states, run finished after 12014 ms. (steps per millisecond=8 ) properties seen :0
// Phase 1: matrix 8547 rows 6504 cols
[2024-05-22 15:20:24] [INFO ] Computed 60 invariants in 63 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5900 variables, 5900/5900 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5900 variables, 0/5900 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 604/6504 variables, 60/5960 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6504 variables, 604/6564 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6504 variables, 0/6564 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8547/15051 variables, 6504/13068 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15051 variables, 0/13068 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/15051 variables, 0/13068 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15051/15051 variables, and 13068 constraints, problems are : Problem set: 0 solved, 7 unsolved in 26539 ms.
Refiners :[Domain max(s): 6504/6504 constraints, Positive P Invariants (semi-flows): 60/60 constraints, State Equation: 6504/6504 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5900 variables, 5900/5900 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5900 variables, 0/5900 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 604/6504 variables, 60/5960 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6504 variables, 604/6564 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6504 variables, 0/6564 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8547/15051 variables, 6504/13068 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15051 variables, 5/13073 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15051 variables, 0/13073 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/15051 variables, 0/13073 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15051/15051 variables, and 13073 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45015 ms.
Refiners :[Domain max(s): 6504/6504 constraints, Positive P Invariants (semi-flows): 60/60 constraints, State Equation: 6504/6504 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 77301ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
FORMULA BART-PT-060-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA BART-PT-060-ReachabilityFireability-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA BART-PT-060-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 4056 ms.
Support contains 63 out of 6504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6504/6504 places, 8547/8547 transitions.
Graph (trivial) has 8395 edges and 6504 vertex of which 4486 / 6504 are part of one of the 47 SCC in 16 ms
Free SCC test removed 4439 places
Drop transitions (Empty/Sink Transition effects.) removed 5821 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5822 transitions.
Graph (complete) has 2725 edges and 2065 vertex of which 2041 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.5 ms
Discarding 24 places :
Also discarding 0 output 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 1040 place count 2041 transition count 1687
Reduce places removed 1038 places and 0 transitions.
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 1095 rules applied. Total rules applied 2135 place count 1003 transition count 1630
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 24 rules applied. Total rules applied 2159 place count 987 transition count 1622
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 2169 place count 983 transition count 1616
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 4 with 28 rules applied. Total rules applied 2197 place count 981 transition count 1590
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2221 place count 957 transition count 1590
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 43 Pre rules applied. Total rules applied 2221 place count 957 transition count 1547
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 2307 place count 914 transition count 1547
Discarding 80 places :
Symmetric choice reduction at 6 with 80 rule applications. Total rules 2387 place count 834 transition count 1467
Iterating global reduction 6 with 80 rules applied. Total rules applied 2467 place count 834 transition count 1467
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 28 rules applied. Total rules applied 2495 place count 834 transition count 1439
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 12 rules applied. Total rules applied 2507 place count 823 transition count 1438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2508 place count 822 transition count 1438
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 2508 place count 822 transition count 1435
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 2514 place count 819 transition count 1435
Discarding 26 places :
Symmetric choice reduction at 9 with 26 rule applications. Total rules 2540 place count 793 transition count 1409
Iterating global reduction 9 with 26 rules applied. Total rules applied 2566 place count 793 transition count 1409
Discarding 26 places :
Symmetric choice reduction at 9 with 26 rule applications. Total rules 2592 place count 767 transition count 1383
Iterating global reduction 9 with 26 rules applied. Total rules applied 2618 place count 767 transition count 1383
Discarding 13 places :
Symmetric choice reduction at 9 with 13 rule applications. Total rules 2631 place count 754 transition count 1370
Iterating global reduction 9 with 13 rules applied. Total rules applied 2644 place count 754 transition count 1370
Performed 629 Post agglomeration using F-continuation condition with reduction of 556 identical transitions.
Deduced a syphon composed of 629 places in 0 ms
Reduce places removed 629 places and 0 transitions.
Iterating global reduction 9 with 1258 rules applied. Total rules applied 3902 place count 125 transition count 185
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 3922 place count 125 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 10 with 15 rules applied. Total rules applied 3937 place count 125 transition count 150
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 3943 place count 125 transition count 144
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3949 place count 119 transition count 144
Applied a total of 3949 rules in 1643 ms. Remains 119 /6504 variables (removed 6385) and now considering 144/8547 (removed 8403) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1643 ms. Remains : 119/6504 places, 144/8547 transitions.
RANDOM walk for 21745 steps (5 resets) in 229 ms. (94 steps per ms) remains 0/4 properties
FORMULA BART-PT-060-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 130209 ms.
ITS solved all properties within timeout

BK_STOP 1716391307915

--------------------
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.202405141337.jar
+ 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="BART-PT-060"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BART-PT-060, 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 r025-smll-171620166800503"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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