fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r161-smll-165277002800116
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for Parking-PT-208

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
250.323 10297.00 24352.00 340.60 TTTFFFFTTTTTFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r161-smll-165277002800116.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is Parking-PT-208, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r161-smll-165277002800116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.2K Apr 30 05:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 30 05:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 05:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 30 05:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 05:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 30 05:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 30 05:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 30 05:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 49K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-00
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-01
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-02
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-03
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-04
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-05
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-06
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-07
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-08
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-09
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-10
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-11
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-12
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-13
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-14
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655077559334

Running Version 0
[2022-06-12 23:46:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 23:46:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 23:46:03] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2022-06-12 23:46:03] [INFO ] Transformed 137 places.
[2022-06-12 23:46:03] [INFO ] Transformed 201 transitions.
[2022-06-12 23:46:03] [INFO ] Found NUPN structural information;
[2022-06-12 23:46:03] [INFO ] Parsed PT model containing 137 places and 201 transitions in 188 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
FORMULA Parking-PT-208-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 289 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :5
FORMULA Parking-PT-208-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 117 rows 137 cols
[2022-06-12 23:46:03] [INFO ] Computed 34 place invariants in 17 ms
[2022-06-12 23:46:03] [INFO ] [Real]Absence check using 32 positive place invariants in 29 ms returned sat
[2022-06-12 23:46:03] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-12 23:46:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:04] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2022-06-12 23:46:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:46:04] [INFO ] [Real]Absence check using 32 positive place invariants in 22 ms returned sat
[2022-06-12 23:46:04] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-12 23:46:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:04] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2022-06-12 23:46:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:46:04] [INFO ] [Real]Absence check using 32 positive place invariants in 18 ms returned sat
[2022-06-12 23:46:04] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-12 23:46:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:04] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2022-06-12 23:46:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:46:04] [INFO ] [Nat]Absence check using 32 positive place invariants in 19 ms returned sat
[2022-06-12 23:46:04] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 5 ms returned sat
[2022-06-12 23:46:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:04] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2022-06-12 23:46:04] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-12 23:46:04] [INFO ] [Nat]Added 26 Read/Feed constraints in 10 ms returned sat
[2022-06-12 23:46:05] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 9 ms to minimize.
[2022-06-12 23:46:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-06-12 23:46:05] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints (skipped 0 transitions) in 27 ms.
[2022-06-12 23:46:05] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2022-06-12 23:46:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2022-06-12 23:46:05] [INFO ] Added : 77 causal constraints over 16 iterations in 618 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-12 23:46:05] [INFO ] [Real]Absence check using 32 positive place invariants in 17 ms returned sat
[2022-06-12 23:46:05] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-12 23:46:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:06] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2022-06-12 23:46:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:46:06] [INFO ] [Nat]Absence check using 32 positive place invariants in 22 ms returned sat
[2022-06-12 23:46:06] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-12 23:46:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:06] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2022-06-12 23:46:06] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2022-06-12 23:46:06] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints (skipped 0 transitions) in 19 ms.
[2022-06-12 23:46:06] [INFO ] Added : 76 causal constraints over 16 iterations in 323 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-06-12 23:46:06] [INFO ] [Real]Absence check using 32 positive place invariants in 13 ms returned sat
[2022-06-12 23:46:06] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-12 23:46:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:06] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2022-06-12 23:46:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:46:06] [INFO ] [Real]Absence check using 32 positive place invariants in 10 ms returned sat
[2022-06-12 23:46:06] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-12 23:46:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:06] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2022-06-12 23:46:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:46:07] [INFO ] [Real]Absence check using 32 positive place invariants in 10 ms returned sat
[2022-06-12 23:46:07] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-12 23:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:07] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-06-12 23:46:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:46:07] [INFO ] [Real]Absence check using 32 positive place invariants in 15 ms returned sat
[2022-06-12 23:46:07] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 4 ms returned sat
[2022-06-12 23:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:07] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2022-06-12 23:46:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:46:07] [INFO ] [Real]Absence check using 32 positive place invariants in 17 ms returned sat
[2022-06-12 23:46:07] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-12 23:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:07] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2022-06-12 23:46:07] [INFO ] Solution in real domain found non-integer solution.
FORMULA Parking-PT-208-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-208-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-208-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-208-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-208-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-208-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-208-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 7000 steps, including 188 resets, run finished after 46 ms. (steps per millisecond=152 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 6400 steps, including 157 resets, run finished after 37 ms. (steps per millisecond=172 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 25 out of 137 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 137/137 places, 117/117 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 116
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 136 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 134 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 134 transition count 113
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 133 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 9 place count 132 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 132 transition count 112
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 130 transition count 110
Free-agglomeration rule applied 18 times.
Iterating global reduction 3 with 18 rules applied. Total rules applied 32 place count 130 transition count 92
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 50 place count 112 transition count 92
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 112 transition count 91
Applied a total of 51 rules in 108 ms. Remains 112 /137 variables (removed 25) and now considering 91/117 (removed 26) transitions.
Finished structural reductions, in 1 iterations. Remains : 112/137 places, 91/117 transitions.
[2022-06-12 23:46:08] [INFO ] Flatten gal took : 61 ms
[2022-06-12 23:46:08] [INFO ] Flatten gal took : 22 ms
[2022-06-12 23:46:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5213258803900077342.gal : 11 ms
[2022-06-12 23:46:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5342178851880260444.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality5213258803900077342.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5342178851880260444.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality5213258803900077342.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5342178851880260444.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5342178851880260444.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 15
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :15 after 17
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :17 after 37
Invariant property Parking-PT-208-ReachabilityCardinality-03 does not hold.
FORMULA Parking-PT-208-ReachabilityCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :37 after 67
Invariant property Parking-PT-208-ReachabilityCardinality-05 does not hold.
FORMULA Parking-PT-208-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5305,0.048901,4744,2,556,13,2942,6,0,509,1235,0
Total reachable state count : 5305

Verifying 2 reachability properties.
Invariant property Parking-PT-208-ReachabilityCardinality-03 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Parking-PT-208-ReachabilityCardinality-03,1,0.050609,4744,2,113,13,2942,7,0,539,1235,0
Invariant property Parking-PT-208-ReachabilityCardinality-05 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Parking-PT-208-ReachabilityCardinality-05,6,0.052424,4744,2,131,13,2942,8,0,570,1235,0
All properties solved without resorting to model-checking.

BK_STOP 1655077569631

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Parking-PT-208"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is Parking-PT-208, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r161-smll-165277002800116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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