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

About the Execution of ITS-Tools for AutoFlight-PT-03b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
404.628 31695.00 61940.00 108.00 TFTFTTFFTTTFTFFF 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.r006-tajo-165245689300414.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 itstools
Input is AutoFlight-PT-03b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689300414
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.4K Apr 30 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 30 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 01:28 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.6K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 30 01:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 30 01:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 30 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 30 01:29 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 70K 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-03b-ReachabilityCardinality-00
FORMULA_NAME AutoFlight-PT-03b-ReachabilityCardinality-01
FORMULA_NAME AutoFlight-PT-03b-ReachabilityCardinality-02
FORMULA_NAME AutoFlight-PT-03b-ReachabilityCardinality-03
FORMULA_NAME AutoFlight-PT-03b-ReachabilityCardinality-04
FORMULA_NAME AutoFlight-PT-03b-ReachabilityCardinality-05
FORMULA_NAME AutoFlight-PT-03b-ReachabilityCardinality-06
FORMULA_NAME AutoFlight-PT-03b-ReachabilityCardinality-07
FORMULA_NAME AutoFlight-PT-03b-ReachabilityCardinality-08
FORMULA_NAME AutoFlight-PT-03b-ReachabilityCardinality-09
FORMULA_NAME AutoFlight-PT-03b-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-03b-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-03b-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-03b-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-03b-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-03b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654266886852

Running Version 202205111006
[2022-06-03 14:34:48] [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-03 14:34:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 14:34:48] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2022-06-03 14:34:48] [INFO ] Transformed 298 places.
[2022-06-03 14:34:48] [INFO ] Transformed 296 transitions.
[2022-06-03 14:34:48] [INFO ] Found NUPN structural information;
[2022-06-03 14:34:48] [INFO ] Parsed PT model containing 298 places and 296 transitions in 229 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-03b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 62 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 13) seen :5
FORMULA AutoFlight-PT-03b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 296 rows 298 cols
[2022-06-03 14:34:49] [INFO ] Computed 22 place invariants in 17 ms
[2022-06-03 14:34:50] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-03 14:34:50] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2022-06-03 14:34:50] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-03 14:34:50] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2022-06-03 14:34:50] [INFO ] Deduced a trap composed of 62 places in 159 ms of which 36 ms to minimize.
[2022-06-03 14:34:50] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2022-06-03 14:34:51] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2022-06-03 14:34:51] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2022-06-03 14:34:51] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2022-06-03 14:34:51] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 1 ms to minimize.
[2022-06-03 14:34:51] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 0 ms to minimize.
[2022-06-03 14:34:51] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 1 ms to minimize.
[2022-06-03 14:34:51] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2022-06-03 14:34:52] [INFO ] Deduced a trap composed of 50 places in 422 ms of which 1 ms to minimize.
[2022-06-03 14:34:52] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2022-06-03 14:34:52] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 0 ms to minimize.
[2022-06-03 14:34:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1587 ms
[2022-06-03 14:34:52] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2022-06-03 14:34:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2022-06-03 14:34:52] [INFO ] After 1954ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :3
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-06-03 14:34:52] [INFO ] After 2218ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :3
FORMULA AutoFlight-PT-03b-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-03b-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-03b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-03b-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-03b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1293 ms.
Support contains 44 out of 298 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 298/298 places, 296/296 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 298 transition count 229
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 77 rules applied. Total rules applied 144 place count 231 transition count 219
Reduce places removed 2 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 15 rules applied. Total rules applied 159 place count 229 transition count 206
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 172 place count 216 transition count 206
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 31 Pre rules applied. Total rules applied 172 place count 216 transition count 175
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 234 place count 185 transition count 175
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 250 place count 169 transition count 159
Iterating global reduction 4 with 16 rules applied. Total rules applied 266 place count 169 transition count 159
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 266 place count 169 transition count 156
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 272 place count 166 transition count 156
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 330 place count 137 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 332 place count 136 transition count 127
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 338 place count 136 transition count 121
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 342 place count 134 transition count 119
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 346 place count 134 transition count 115
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 350 place count 130 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 351 place count 129 transition count 114
Applied a total of 351 rules in 101 ms. Remains 129 /298 variables (removed 169) and now considering 114/296 (removed 182) transitions.
Finished structural reductions, in 1 iterations. Remains : 129/298 places, 114/296 transitions.
Incomplete random walk after 1000000 steps, including 16440 resets, run finished after 13415 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2246 resets, run finished after 2481 ms. (steps per millisecond=403 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1837 resets, run finished after 2751 ms. (steps per millisecond=363 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1858 resets, run finished after 2836 ms. (steps per millisecond=352 ) properties (out of 3) seen :1
FORMULA AutoFlight-PT-03b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 114 rows 129 cols
[2022-06-03 14:35:15] [INFO ] Computed 22 place invariants in 8 ms
[2022-06-03 14:35:15] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2022-06-03 14:35:15] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 9 ms returned sat
[2022-06-03 14:35:15] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 14:35:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2022-06-03 14:35:15] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-03 14:35:15] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 14:35:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-03 14:35:15] [INFO ] After 17ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 14:35:15] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2022-06-03 14:35:15] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2022-06-03 14:35:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2022-06-03 14:35:15] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2022-06-03 14:35:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2022-06-03 14:35:15] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-03 14:35:15] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA AutoFlight-PT-03b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 46 ms.
Support contains 14 out of 129 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 129/129 places, 114/114 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 129 transition count 98
Reduce places removed 16 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 113 transition count 95
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 38 place count 110 transition count 95
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 38 place count 110 transition count 87
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 54 place count 102 transition count 87
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 57 place count 99 transition count 84
Iterating global reduction 3 with 3 rules applied. Total rules applied 60 place count 99 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 99 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 98 transition count 83
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 86 place count 86 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 86 transition count 69
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 91 place count 86 transition count 66
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 94 place count 83 transition count 66
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 97 place count 83 transition count 66
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 100 place count 80 transition count 63
Iterating global reduction 5 with 3 rules applied. Total rules applied 103 place count 80 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 104 place count 79 transition count 62
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 5 with 16 rules applied. Total rules applied 120 place count 70 transition count 55
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 127 place count 63 transition count 55
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 127 place count 63 transition count 49
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 139 place count 57 transition count 49
Applied a total of 139 rules in 35 ms. Remains 57 /129 variables (removed 72) and now considering 49/114 (removed 65) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/129 places, 49/114 transitions.
Incomplete random walk after 1000000 steps, including 41779 resets, run finished after 1572 ms. (steps per millisecond=636 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6573 resets, run finished after 739 ms. (steps per millisecond=1353 ) properties (out of 1) seen :0
Finished probabilistic random walk after 196547 steps, run visited all 1 properties in 210 ms. (steps per millisecond=935 )
Probabilistic random walk after 196547 steps, saw 34998 distinct states, run finished after 210 ms. (steps per millisecond=935 ) properties seen :1
FORMULA AutoFlight-PT-03b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 30087 ms.

BK_STOP 1654266918547

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-03b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is AutoFlight-PT-03b, 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 r006-tajo-165245689300414"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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