fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r223-tall-162098215900158
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ShieldIIPs-PT-010B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
645.703 43066.00 57072.00 411.70 F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r223-tall-162098215900158.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPs-PT-010B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-162098215900158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 11:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 11:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 17:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 164K May 5 16:52 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1621070755134

Running Version 0
[2021-05-15 09:25:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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, 1800]
[2021-05-15 09:25:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 09:25:56] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2021-05-15 09:25:56] [INFO ] Transformed 603 places.
[2021-05-15 09:25:56] [INFO ] Transformed 593 transitions.
[2021-05-15 09:25:56] [INFO ] Found NUPN structural information;
[2021-05-15 09:25:56] [INFO ] Parsed PT model containing 603 places and 593 transitions in 133 ms.
Structural test allowed to assert that 272 places are NOT stable. Took 11 ms.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 331) seen :330
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 593 rows 603 cols
[2021-05-15 09:25:57] [INFO ] Computed 91 place invariants in 28 ms
[2021-05-15 09:25:57] [INFO ] [Real]Absence check using 91 positive place invariants in 31 ms returned sat
[2021-05-15 09:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 09:25:57] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2021-05-15 09:25:57] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 3 ms to minimize.
[2021-05-15 09:25:57] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 1 ms to minimize.
[2021-05-15 09:25:58] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2021-05-15 09:25:58] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2021-05-15 09:25:58] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2021-05-15 09:25:58] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2021-05-15 09:25:58] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 1 ms to minimize.
[2021-05-15 09:25:58] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2021-05-15 09:25:58] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 0 ms to minimize.
[2021-05-15 09:25:58] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 0 ms to minimize.
[2021-05-15 09:25:59] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 0 ms to minimize.
[2021-05-15 09:25:59] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 0 ms to minimize.
[2021-05-15 09:25:59] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2021-05-15 09:25:59] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 0 ms to minimize.
[2021-05-15 09:25:59] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 0 ms to minimize.
[2021-05-15 09:25:59] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2021-05-15 09:25:59] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2021-05-15 09:25:59] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2021-05-15 09:25:59] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2021-05-15 09:26:00] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2021-05-15 09:26:00] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2021-05-15 09:26:00] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2021-05-15 09:26:00] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2792 ms
[2021-05-15 09:26:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 09:26:00] [INFO ] [Nat]Absence check using 91 positive place invariants in 31 ms returned sat
[2021-05-15 09:26:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 09:26:00] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2021-05-15 09:26:00] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2021-05-15 09:26:00] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2021-05-15 09:26:01] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2021-05-15 09:26:01] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 0 ms to minimize.
[2021-05-15 09:26:01] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 1 ms to minimize.
[2021-05-15 09:26:01] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2021-05-15 09:26:01] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 1 ms to minimize.
[2021-05-15 09:26:01] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2021-05-15 09:26:01] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2021-05-15 09:26:01] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 0 ms to minimize.
[2021-05-15 09:26:02] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 1 ms to minimize.
[2021-05-15 09:26:02] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 0 ms to minimize.
[2021-05-15 09:26:02] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 5 ms to minimize.
[2021-05-15 09:26:02] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 0 ms to minimize.
[2021-05-15 09:26:02] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2021-05-15 09:26:02] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 0 ms to minimize.
[2021-05-15 09:26:02] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2021-05-15 09:26:02] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2021-05-15 09:26:02] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2021-05-15 09:26:03] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2021-05-15 09:26:03] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 0 ms to minimize.
[2021-05-15 09:26:03] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2021-05-15 09:26:03] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2021-05-15 09:26:03] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 0 ms to minimize.
[2021-05-15 09:26:03] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2021-05-15 09:26:03] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2021-05-15 09:26:03] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 0 ms to minimize.
[2021-05-15 09:26:03] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2021-05-15 09:26:03] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2021-05-15 09:26:04] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2021-05-15 09:26:04] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2021-05-15 09:26:04] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2021-05-15 09:26:04] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 0 ms to minimize.
[2021-05-15 09:26:04] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 7 ms to minimize.
[2021-05-15 09:26:04] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2021-05-15 09:26:04] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2021-05-15 09:26:04] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 3974 ms
[2021-05-15 09:26:04] [INFO ] Computed and/alt/rep : 592/1243/592 causal constraints (skipped 0 transitions) in 42 ms.
[2021-05-15 09:26:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
Support contains 1 out of 603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 603/603 places, 593/593 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 603 transition count 542
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 552 transition count 542
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 552 transition count 491
Deduced a syphon composed of 51 places in 7 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 501 transition count 491
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 273 place count 432 transition count 422
Iterating global reduction 2 with 69 rules applied. Total rules applied 342 place count 432 transition count 422
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 342 place count 432 transition count 392
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 402 place count 402 transition count 392
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 702 place count 252 transition count 242
Partial Free-agglomeration rule applied 68 times.
Drop transitions removed 68 transitions
Iterating global reduction 2 with 68 rules applied. Total rules applied 770 place count 252 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 771 place count 251 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 772 place count 250 transition count 241
Applied a total of 772 rules in 156 ms. Remains 250 /603 variables (removed 353) and now considering 241/593 (removed 352) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/603 places, 241/593 transitions.
[2021-05-15 09:26:05] [INFO ] Flatten gal took : 62 ms
[2021-05-15 09:26:05] [INFO ] Flatten gal took : 25 ms
[2021-05-15 09:26:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5564293950745955779.gal : 14 ms
[2021-05-15 09:26:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3442599764685871942.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/ReachabilityCardinality5564293950745955779.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3442599764685871942.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/ReachabilityCardinality5564293950745955779.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3442599764685871942.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3442599764685871942.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 31
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :31 after 77
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :77 after 232
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :232 after 1888
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1888 after 2791
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2791 after 13165
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :13165 after 216146
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :216146 after 5.38418e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.38418e+06 after 1.29341e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.29341e+08 after 1.25331e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.25331e+10 after 2.68126e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.68126e+10 after 5.73911e+11
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :5.73911e+11 after 5.61545e+13
Detected timeout of ITS tools.
[2021-05-15 09:26:20] [INFO ] Flatten gal took : 22 ms
[2021-05-15 09:26:20] [INFO ] Applying decomposition
[2021-05-15 09:26:20] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10819158527238768126.txt, -o, /tmp/graph10819158527238768126.bin, -w, /tmp/graph10819158527238768126.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10819158527238768126.bin, -l, -1, -v, -w, /tmp/graph10819158527238768126.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 09:26:20] [INFO ] Decomposing Gal with order
[2021-05-15 09:26:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 09:26:21] [INFO ] Removed a total of 201 redundant transitions.
[2021-05-15 09:26:21] [INFO ] Flatten gal took : 61 ms
[2021-05-15 09:26:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 261 labels/synchronizations in 14 ms.
[2021-05-15 09:26:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5234625861709946468.gal : 9 ms
[2021-05-15 09:26:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16788061864413175157.prop : 0 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/ReachabilityCardinality5234625861709946468.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16788061864413175157.prop, --nowitness], 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/ReachabilityCardinality5234625861709946468.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16788061864413175157.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16788061864413175157.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 172
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :172 after 4.73746e+08
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4.73746e+08 after 6.87697e+11
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6496010463653893924
[2021-05-15 09:26:36] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6496010463653893924
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6496010463653893924]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6496010463653893924] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6496010463653893924] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Finished random walk after 183 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=61 )
Able to resolve query StableMarking after proving 332 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL

BK_STOP 1621070798200

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -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 1800 -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="ShieldIIPs-PT-010B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 itstools"
echo " Input is ShieldIIPs-PT-010B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-162098215900158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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