About the Execution of LTSMin+red for ClientsAndServers-PT-N1000P0
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.r476-tall-171620506000517.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 ClientsAndServers-PT-N1000P0, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620506000517
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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 3.3K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 22:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 22:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 22:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.1K 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-00
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-01
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-02
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-03
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-04
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-05
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-06
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-07
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-08
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-09
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-10
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-11
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-12
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-13
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-14
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717207580183
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N1000P0
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:06:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 02:06:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:06:21] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2024-06-01 02:06:21] [INFO ] Transformed 25 places.
[2024-06-01 02:06:21] [INFO ] Transformed 18 transitions.
[2024-06-01 02:06:21] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 3000, 0, 4000, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 3000, 0, 4000, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 18 rows 25 cols
[2024-06-01 02:06:21] [INFO ] Computed 8 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 3000, 0, 4000, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2000, 8000, 2000, 2000, 2000, 4000, 3000, 2000, 4000, 8000, 8000, 2000, 4000, 2000, 2000, 2000]
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-08 4000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-06 3000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 16004 steps (2 resets) in 20 ms. (762 steps per ms)
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-10 8000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-01 8000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120011 steps (24 resets) in 106 ms. (1121 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[259, 477, 259, 18, 32, 105, 32, 19, 37, 16, 14, 62] Max Struct:[2000, 2000, 2000, 2000, 4000, 2000, 8000, 2000, 4000, 2000, 2000, 2000]
[2024-06-01 02:06:21] [INFO ] Invariant cache hit.
[2024-06-01 02:06:21] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 02:06:21] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 02:06:21] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 02:06:21] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 02:06:21] [INFO ] Added : 16 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 17 ms.
[2024-06-01 02:06:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:06:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 02:06:21] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 02:06:21] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 02:06:21] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 02:06:21] [INFO ] Added : 16 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 02:06:21] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 02:06:21] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 02:06:21] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 02:06:21] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 02:06:21] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 02:06:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:06:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 02:06:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 02:06:22] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 7 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 02:06:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 02:06:22] [INFO ] Added : 16 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 02:06:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:06:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 02:06:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 02:06:22] [INFO ] Added : 16 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 02:06:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 02:06:22] [INFO ] Added : 12 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 02:06:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 02:06:22] [INFO ] Added : 9 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 02:06:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:06:22] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 02:06:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:06:22] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 02:06:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 02:06:22] [INFO ] Added : 13 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 02:06:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:06:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 9 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 02:06:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:06:22] [INFO ] Added : 13 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 02:06:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 02:06:22] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 02:06:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 02:06:22] [INFO ] Added : 14 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 02:06:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:06:22] [INFO ] Added : 13 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 02:06:22] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 02:06:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:06:22] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[259, 477, 259, 18, 32, 105, 32, 19, 37, 16, 14, 62] Max Struct:[2000, 2000, 2000, 2000, 4000, 2000, 8000, 2000, 4000, 2000, 2000, 2000]
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-15 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-07 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-03 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-02 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-00 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-14 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-11 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-04 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-13 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-12 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-05 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4393] Max Struct:[8000]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 15 place count 16 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 14 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 11 transition count 7
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 11 transition count 4
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 33 place count 6 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 33 place count 6 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 5 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 2 transition count 2
Applied a total of 39 rules in 32 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 2/25 places, 2/18 transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 02:06:46] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4393] Max Struct:[8000]
RANDOM walk for 1000131 steps (2 resets) in 139 ms. (7143 steps per ms)
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-09 8000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 142 ms. (6993 steps per ms)
Current structural bounds on expressions (after 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 25626 ms.
ITS solved all properties within timeout
BK_STOP 1717207606913
--------------------
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="ClientsAndServers-PT-N1000P0"
export BK_EXAMINATION="UpperBounds"
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 ClientsAndServers-PT-N1000P0, 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 r476-tall-171620506000517"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N1000P0.tgz
mv ClientsAndServers-PT-N1000P0 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 ;