About the Execution of GreatSPN+red for RobotManipulation-PT-05000
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.r333-tall-171679078000245.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 RobotManipulation-PT-05000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078000245
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 18:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 11 18:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 18:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 18:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME RobotManipulation-PT-05000-UpperBounds-00
FORMULA_NAME RobotManipulation-PT-05000-UpperBounds-01
FORMULA_NAME RobotManipulation-PT-05000-UpperBounds-02
FORMULA_NAME RobotManipulation-PT-05000-UpperBounds-03
FORMULA_NAME RobotManipulation-PT-05000-UpperBounds-04
FORMULA_NAME RobotManipulation-PT-05000-UpperBounds-05
FORMULA_NAME RobotManipulation-PT-05000-UpperBounds-06
FORMULA_NAME RobotManipulation-PT-05000-UpperBounds-07
FORMULA_NAME RobotManipulation-PT-05000-UpperBounds-08
FORMULA_NAME RobotManipulation-PT-05000-UpperBounds-09
FORMULA_NAME RobotManipulation-PT-05000-UpperBounds-10
FORMULA_NAME RobotManipulation-PT-05000-UpperBounds-11
FORMULA_NAME RobotManipulation-PT-05000-UpperBounds-12
FORMULA_NAME RobotManipulation-PT-05000-UpperBounds-13
FORMULA_NAME RobotManipulation-PT-05000-UpperBounds-14
FORMULA_NAME RobotManipulation-PT-05000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716834927043
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-05000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 18:35:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 18:35:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 18:35:28] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2024-05-27 18:35:28] [INFO ] Transformed 15 places.
[2024-05-27 18:35:28] [INFO ] Transformed 11 transitions.
[2024-05-27 18:35:28] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 9
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 10000, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 10000, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 11 rows 15 cols
[2024-05-27 18:35:28] [INFO ] Computed 6 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 10000, 0, 0, 0] Max Struct:[10001, 10001, 10001, 10001, 10001, 10000, 10000, 10001, 10001]
FORMULA RobotManipulation-PT-05000-UpperBounds-07 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10002 steps (0 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 80006 steps (16 resets) in 86 ms. (919 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[56, 36, 155, 39, 1112, 477, 56, 477] Max Struct:[10001, 10001, 10001, 10001, 10001, 10000, 10001, 10001]
[2024-05-27 18:35:28] [INFO ] Invariant cache hit.
[2024-05-27 18:35:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-27 18:35:28] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-27 18:35:28] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-27 18:35:28] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 18:35:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 18:35:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-27 18:35:28] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 18:35:28] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-27 18:35:28] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 18:35:28] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2024-05-27 18:35:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 18:35:28] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 18:35:28] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-27 18:35:28] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 18:35:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 18:35:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-27 18:35:28] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 18:35:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 18:35:28] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 18:35:28] [INFO ] Added : 8 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 3 ms.
[2024-05-27 18:35:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 18:35:28] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 18:35:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-27 18:35:28] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 18:35:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 18:35:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 18:35:28] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 18:35:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-27 18:35:28] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 18:35:28] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2024-05-27 18:35:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 18:35:28] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-27 18:35:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-27 18:35:29] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 18:35:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 18:35:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 18:35:29] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 18:35:29] [INFO ] Added : 8 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2024-05-27 18:35:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-27 18:35:29] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 18:35:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 18:35:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 18:35:29] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 18:35:29] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-27 18:35:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-27 18:35:29] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 18:35:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 18:35:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 18:35:29] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 18:35:29] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-05-27 18:35:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-27 18:35:29] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 18:35:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 18:35:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-27 18:35:29] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 18:35:29] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-27 18:35:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-27 18:35:29] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 18:35:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 18:35:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 18:35:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-27 18:35:29] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 18:35:29] [INFO ] Added : 8 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[56, 36, 155, 39, 1112, 477, 56, 477] Max Struct:[10001, 10001, 10001, 10001, 10001, 10000, 10001, 10001]
FORMULA RobotManipulation-PT-05000-UpperBounds-12 10000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RobotManipulation-PT-05000-UpperBounds-15 10000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RobotManipulation-PT-05000-UpperBounds-08 10000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RobotManipulation-PT-05000-UpperBounds-06 10001 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10000, 10000, 10000, 10000, 10000, 10000] Max Struct:[10001, 10001, 10001, 10001, 10001, 10001]
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 14 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 13 transition count 10
Applied a total of 3 rules in 32 ms. Remains 13 /15 variables (removed 2) and now considering 10/11 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 13/15 places, 10/11 transitions.
// Phase 1: matrix 10 rows 13 cols
[2024-05-27 18:35:48] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10000, 10000, 10000, 10000, 10000, 10000] Max Struct:[10001, 10001, 10001, 10001, 10001, 10001]
RANDOM walk for 1000106 steps (2 resets) in 159 ms. (6250 steps per ms)
BEST_FIRST walk for 6000005 steps (12 resets) in 1537 ms. (3901 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10000, 10000, 10000, 10000, 10000, 10000] Max Struct:[10001, 10001, 10001, 10001, 10001, 10001]
[2024-05-27 18:35:50] [INFO ] Invariant cache hit.
[2024-05-27 18:35:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-27 18:35:50] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2024-05-27 18:35:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 18:35:50] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2024-05-27 18:35:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 18:35:50] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2024-05-27 18:35:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 18:35:50] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 5 ms returned unsat
[2024-05-27 18:35:50] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-27 18:35:50] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned unsat
[2024-05-27 18:35:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 18:35:50] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[10000, 10000, 10000, 10000, 10000, 10000] Max Struct:[10000, 10000, 10000, 10000, 10000, 10000]
FORMULA RobotManipulation-PT-05000-UpperBounds-13 10000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-05000-UpperBounds-10 10000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-05000-UpperBounds-11 10000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-05000-UpperBounds-09 10000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-05000-UpperBounds-03 10000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-05000-UpperBounds-02 10000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-05000-UpperBounds-01 10000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-05000-UpperBounds-04 10000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-05000-UpperBounds-05 10000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-05000-UpperBounds-14 10000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-05000-UpperBounds-00 10000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 22384 ms.
ITS solved all properties within timeout
BK_STOP 1716834950596
--------------------
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 UpperBounds -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="RobotManipulation-PT-05000"
export BK_EXAMINATION="UpperBounds"
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 RobotManipulation-PT-05000, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r333-tall-171679078000245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-05000.tgz
mv RobotManipulation-PT-05000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;