About the Execution of 2021-gold for JoinFreeModules-PT-0100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
446.327 | 56432.00 | 64774.00 | 1265.80 | TTFFFTFTFFTTFFTT | 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.r143-tall-165271830200072.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 JoinFreeModules-PT-0100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-tall-165271830200072
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 7.6K Apr 30 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 02:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 30 02:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 30 02:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 30 02:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 02:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 304K 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 JoinFreeModules-PT-0100-ReachabilityFireability-00
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityFireability-01
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityFireability-02
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityFireability-03
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityFireability-04
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityFireability-05
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityFireability-06
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityFireability-07
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityFireability-08
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityFireability-09
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityFireability-10
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityFireability-11
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityFireability-12
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityFireability-13
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityFireability-14
FORMULA_NAME JoinFreeModules-PT-0100-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1655068718087
Running Version 0
[2022-06-12 21:18:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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 21:18:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:18:39] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2022-06-12 21:18:39] [INFO ] Transformed 501 places.
[2022-06-12 21:18:39] [INFO ] Transformed 801 transitions.
[2022-06-12 21:18:39] [INFO ] Parsed PT model containing 501 places and 801 transitions in 130 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 142 ms.
Working with output stream class java.io.PrintStream
[2022-06-12 21:18:39] [INFO ] Initial state test concluded for 5 properties.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10017 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :2
FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :1
FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :1
FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :1
FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 801 rows 500 cols
[2022-06-12 21:18:40] [INFO ] Computed 100 place invariants in 23 ms
[2022-06-12 21:18:40] [INFO ] [Real]Absence check using 100 positive place invariants in 24 ms returned sat
[2022-06-12 21:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:40] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2022-06-12 21:18:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:41] [INFO ] [Nat]Absence check using 100 positive place invariants in 18 ms returned sat
[2022-06-12 21:18:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:41] [INFO ] [Nat]Absence check using state equation in 722 ms returned sat
[2022-06-12 21:18:41] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 3 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 367 ms
[2022-06-12 21:18:42] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 47 ms.
[2022-06-12 21:18:44] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 2 ms to minimize.
[2022-06-12 21:18:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2022-06-12 21:18:44] [INFO ] Added : 182 causal constraints over 37 iterations in 2141 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-12 21:18:44] [INFO ] [Real]Absence check using 100 positive place invariants in 22 ms returned sat
[2022-06-12 21:18:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:44] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2022-06-12 21:18:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:44] [INFO ] [Nat]Absence check using 100 positive place invariants in 17 ms returned sat
[2022-06-12 21:18:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:45] [INFO ] [Nat]Absence check using state equation in 813 ms returned sat
[2022-06-12 21:18:45] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 38 ms.
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-06-12 21:18:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-06-12 21:18:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 276 ms
[2022-06-12 21:18:49] [INFO ] Added : 238 causal constraints over 49 iterations in 3564 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 21:18:49] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned sat
[2022-06-12 21:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:49] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2022-06-12 21:18:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:49] [INFO ] [Nat]Absence check using 100 positive place invariants in 16 ms returned sat
[2022-06-12 21:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:50] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2022-06-12 21:18:50] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-06-12 21:18:50] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2022-06-12 21:18:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-06-12 21:18:50] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-06-12 21:18:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-06-12 21:18:50] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-06-12 21:18:50] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-06-12 21:18:50] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-06-12 21:18:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 410 ms
[2022-06-12 21:18:50] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 42 ms.
[2022-06-12 21:18:54] [INFO ] Added : 233 causal constraints over 47 iterations in 3902 ms. Result :unknown
[2022-06-12 21:18:54] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2022-06-12 21:18:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:54] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2022-06-12 21:18:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:54] [INFO ] [Nat]Absence check using 100 positive place invariants in 16 ms returned sat
[2022-06-12 21:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:55] [INFO ] [Nat]Absence check using state equation in 769 ms returned sat
[2022-06-12 21:18:55] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-06-12 21:18:55] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-06-12 21:18:55] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2022-06-12 21:18:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-06-12 21:18:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 240 ms
[2022-06-12 21:18:55] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 35 ms.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-06-12 21:18:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-06-12 21:18:59] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:18:59] [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 3
[2022-06-12 21:19:00] [INFO ] [Real]Absence check using 100 positive place invariants in 16 ms returned sat
[2022-06-12 21:19:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:00] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2022-06-12 21:19:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:00] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2022-06-12 21:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:00] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2022-06-12 21:19:00] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 42 ms.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-06-12 21:19:04] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-06-12 21:19:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2022-06-12 21:19:04] [INFO ] Added : 246 causal constraints over 50 iterations in 3287 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 21:19:04] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned sat
[2022-06-12 21:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:04] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2022-06-12 21:19:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:04] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2022-06-12 21:19:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:05] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2022-06-12 21:19:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-06-12 21:19:05] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-06-12 21:19:05] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-06-12 21:19:05] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-06-12 21:19:05] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-06-12 21:19:05] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-06-12 21:19:05] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-06-12 21:19:05] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-06-12 21:19:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 412 ms
[2022-06-12 21:19:05] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 31 ms.
[2022-06-12 21:19:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-06-12 21:19:07] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 566 ms
[2022-06-12 21:19:08] [INFO ] Added : 231 causal constraints over 47 iterations in 3041 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Incomplete Parikh walk after 597700 steps, including 100 resets, run finished after 5257 ms. (steps per millisecond=113 ) properties (out of 6) seen :3 could not realise parikh vector
FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 560000 steps, including 100 resets, run finished after 5211 ms. (steps per millisecond=107 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 546600 steps, including 100 resets, run finished after 5264 ms. (steps per millisecond=103 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 663200 steps, including 99 resets, run finished after 5932 ms. (steps per millisecond=111 ) properties (out of 1) seen :0 could not realise parikh vector
Finished Parikh walk after 4435 steps, including 0 resets, run visited all 1 properties in 54 ms. (steps per millisecond=82 )
FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
BK_STOP 1655068774519
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="JoinFreeModules-PT-0100"
export BK_EXAMINATION="ReachabilityFireability"
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 JoinFreeModules-PT-0100, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r143-tall-165271830200072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0100.tgz
mv JoinFreeModules-PT-0100 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;