fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r010-tajo-165245701700167
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for AutoFlight-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
273.855 18490.00 36101.00 100.90 TFFTFTTFTFTFTTFT 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/mcc2022-input.r010-tajo-165245701700167.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 gold2021
Input is AutoFlight-PT-05b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701700167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.6K Apr 30 01:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 30 01:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 01:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 30 01:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 30 01:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 30 01:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 30 01:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 30 01:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 113K May 10 09:33 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 AutoFlight-PT-05b-ReachabilityCardinality-00
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-01
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-02
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-03
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-04
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-05
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-06
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-07
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-08
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-09
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655069608326

Running Version 0
[2022-06-12 21:33:31] [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 21:33:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:33:32] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2022-06-12 21:33:32] [INFO ] Transformed 482 places.
[2022-06-12 21:33:32] [INFO ] Transformed 480 transitions.
[2022-06-12 21:33:32] [INFO ] Found NUPN structural information;
[2022-06-12 21:33:32] [INFO ] Parsed PT model containing 482 places and 480 transitions in 176 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 40 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 15) seen :10
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :1
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 480 rows 482 cols
[2022-06-12 21:33:32] [INFO ] Computed 34 place invariants in 40 ms
[2022-06-12 21:33:33] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2022-06-12 21:33:33] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:33] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2022-06-12 21:33:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:33] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2022-06-12 21:33:33] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-12 21:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:34] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2022-06-12 21:33:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 50 ms returned sat
[2022-06-12 21:33:34] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-12 21:33:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:35] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2022-06-12 21:33:35] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 3 ms to minimize.
[2022-06-12 21:33:35] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 2 ms to minimize.
[2022-06-12 21:33:35] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2022-06-12 21:33:36] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2022-06-12 21:33:36] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 1 ms to minimize.
[2022-06-12 21:33:37] [INFO ] Deduced a trap composed of 33 places in 645 ms of which 1 ms to minimize.
[2022-06-12 21:33:37] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 1 ms to minimize.
[2022-06-12 21:33:37] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2022-06-12 21:33:37] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 0 ms to minimize.
[2022-06-12 21:33:37] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 1 ms to minimize.
[2022-06-12 21:33:37] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 0 ms to minimize.
[2022-06-12 21:33:37] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 1 ms to minimize.
[2022-06-12 21:33:38] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:33:38] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 1 ms to minimize.
[2022-06-12 21:33:38] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 1 ms to minimize.
[2022-06-12 21:33:38] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3094 ms
[2022-06-12 21:33:38] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 35 ms.
[2022-06-12 21:33:39] [INFO ] Added : 160 causal constraints over 32 iterations in 1115 ms. Result :unknown
[2022-06-12 21:33:39] [INFO ] [Real]Absence check using 33 positive place invariants in 48 ms returned sat
[2022-06-12 21:33:39] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:40] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2022-06-12 21:33:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:40] [INFO ] [Real]Absence check using 33 positive place invariants in 47 ms returned sat
[2022-06-12 21:33:40] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:40] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2022-06-12 21:33:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2022-06-12 21:33:40] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:33:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:40] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2022-06-12 21:33:41] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 1 ms to minimize.
[2022-06-12 21:33:41] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:33:41] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:33:41] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:33:41] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 0 ms to minimize.
[2022-06-12 21:33:41] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 0 ms to minimize.
[2022-06-12 21:33:41] [INFO ] Deduced a trap composed of 73 places in 162 ms of which 1 ms to minimize.
[2022-06-12 21:33:42] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 1 ms to minimize.
[2022-06-12 21:33:42] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:33:42] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:33:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1404 ms
[2022-06-12 21:33:42] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 48 ms.
[2022-06-12 21:33:45] [INFO ] Added : 430 causal constraints over 86 iterations in 3297 ms. Result :unknown
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 46400 steps, including 272 resets, run finished after 146 ms. (steps per millisecond=317 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 59400 steps, including 234 resets, run finished after 157 ms. (steps per millisecond=378 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 13 out of 482 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 482/482 places, 480/480 transitions.
Drop transitions removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 0 with 178 rules applied. Total rules applied 178 place count 482 transition count 302
Reduce places removed 178 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 209 rules applied. Total rules applied 387 place count 304 transition count 271
Reduce places removed 9 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 14 rules applied. Total rules applied 401 place count 295 transition count 266
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 408 place count 290 transition count 264
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 62 Pre rules applied. Total rules applied 408 place count 290 transition count 202
Deduced a syphon composed of 62 places in 2 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 532 place count 228 transition count 202
Discarding 45 places :
Symmetric choice reduction at 4 with 45 rule applications. Total rules 577 place count 183 transition count 157
Iterating global reduction 4 with 45 rules applied. Total rules applied 622 place count 183 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 623 place count 183 transition count 156
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 623 place count 183 transition count 142
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 651 place count 169 transition count 142
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 725 place count 132 transition count 105
Free-agglomeration rule applied 19 times.
Iterating global reduction 5 with 19 rules applied. Total rules applied 744 place count 132 transition count 86
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 763 place count 113 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 764 place count 112 transition count 85
Reduce places removed 7 places and 0 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 6 with 8 rules applied. Total rules applied 772 place count 105 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 773 place count 104 transition count 84
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 773 place count 104 transition count 76
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 789 place count 96 transition count 76
Applied a total of 789 rules in 133 ms. Remains 96 /482 variables (removed 386) and now considering 76/480 (removed 404) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/482 places, 76/480 transitions.
[2022-06-12 21:33:46] [INFO ] Flatten gal took : 43 ms
[2022-06-12 21:33:46] [INFO ] Flatten gal took : 21 ms
[2022-06-12 21:33:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11221607596533870717.gal : 8 ms
[2022-06-12 21:33:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality621360625240131764.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/ReachabilityCardinality11221607596533870717.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality621360625240131764.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/ReachabilityCardinality11221607596533870717.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality621360625240131764.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality621360625240131764.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 30
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :30 after 288
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :288 after 438
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :438 after 958
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :958 after 5196
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5196 after 26124
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,384732,0.067466,6032,2,1212,14,9134,7,0,459,8480,0
Total reachable state count : 384732

Verifying 1 reachability properties.
Invariant property AutoFlight-PT-05b-ReachabilityCardinality-11 does not hold.
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-05b-ReachabilityCardinality-11,7032,0.07126,6296,2,554,14,9134,7,0,477,8480,0
All properties solved without resorting to model-checking.

BK_STOP 1655069626816

--------------------
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="AutoFlight-PT-05b"
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 AutoFlight-PT-05b, 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 r010-tajo-165245701700167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-05b.tgz
mv AutoFlight-PT-05b 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 ;