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

About the Execution of LTSMin+red for BridgeAndVehicles-COL-V20P20N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
359.951 10742.00 18146.00 62.40 20 20 20 20 20 20 20 1 1 1 1 1 1 1 20 20 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694200053.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BridgeAndVehicles-COL-V20P20N20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694200053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 12:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 12:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 12:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 25 12:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 25 12:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 144K Feb 25 12:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 40K Mar 5 18:22 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 BridgeAndVehicles-COL-V20P20N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678602576451

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P20N20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 06:29:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 06:29:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 06:29:38] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-12 06:29:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 06:29:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 495 ms
[2023-03-12 06:29:38] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 78 PT places and 37258.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-12 06:29:38] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2023-03-12 06:29:38] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-12 06:29:38] [INFO ] Computed 4 place invariants in 5 ms
FORMULA BridgeAndVehicles-COL-V20P20N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-12 06:29:38] [INFO ] Invariant cache hit.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-12 06:29:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:29:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-12 06:29:39] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 06:29:39] [INFO ] Added : 2 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 6 ms.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 06:29:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:29:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 06:29:39] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 06:29:39] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 2 ms.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 06:29:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:29:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 06:29:39] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-12 06:29:39] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 06:29:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:29:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-12 06:29:39] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 06:29:39] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 2 ms.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-12 06:29:39] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 06:29:39] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 06:29:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:29:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-12 06:29:39] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 06:29:39] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-12 06:29:39] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 06:29:39] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 06:29:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:29:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-12 06:29:39] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 06:29:39] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 2 ms.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-12 06:29:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:29:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 06:29:39] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 06:29:39] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-12 06:29:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:29:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-12 06:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:39] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-12 06:29:39] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 06:29:39] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [20, 20, 20, 20, 20, 20, 1, 20, 20]
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-12 06:29:39] [INFO ] Unfolded HLPN to a Petri net with 78 places and 968 transitions 7350 arcs in 52 ms.
[2023-03-12 06:29:39] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 9) seen :116
FORMULA BridgeAndVehicles-COL-V20P20N20-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N20-UpperBounds-14 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N20-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N20-UpperBounds-05 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N20-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :46
FORMULA BridgeAndVehicles-COL-V20P20N20-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P20N20-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-12 06:29:40] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2023-03-12 06:29:40] [INFO ] Computed 7 place invariants in 11 ms
[2023-03-12 06:29:40] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-12 06:29:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:40] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-12 06:29:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:29:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2023-03-12 06:29:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:29:40] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-12 06:29:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 06:29:40] [INFO ] [Nat]Added 42 Read/Feed constraints in 32 ms returned sat
[2023-03-12 06:29:40] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 107 transitions) in 90 ms.
[2023-03-12 06:29:40] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 7 ms to minimize.
[2023-03-12 06:29:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-12 06:29:40] [INFO ] Added : 3 causal constraints over 2 iterations in 332 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[6]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 968/968 transitions.
Graph (complete) has 642 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 75 transition count 967
Applied a total of 3 rules in 123 ms. Remains 75 /78 variables (removed 3) and now considering 967/968 (removed 1) transitions.
[2023-03-12 06:29:40] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2023-03-12 06:29:40] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 06:29:41] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 828 ms. Remains : 75/78 places, 967/968 transitions.
Normalized transition count is 169 out of 967 initially.
// Phase 1: matrix 169 rows 75 cols
[2023-03-12 06:29:41] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 6655 resets, run finished after 3841 ms. (steps per millisecond=260 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2448 resets, run finished after 1575 ms. (steps per millisecond=634 ) properties (out of 1) seen :20
FORMULA BridgeAndVehicles-COL-V20P20N20-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 8709 ms.
ITS solved all properties within timeout

BK_STOP 1678602587193

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="BridgeAndVehicles-COL-V20P20N20"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-COL-V20P20N20, 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 r041-tajo-167813694200053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P20N20.tgz
mv BridgeAndVehicles-COL-V20P20N20 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;