fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r245-tall-174915599400648
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ViralEpidemic-PT-S16D2C4A03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 207144.00 0.00 0.00 F normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r245-tall-174915599400648.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is ViralEpidemic-PT-S16D2C4A03, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-174915599400648
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 55M
-rw-r--r-- 1 mcc users 8.6K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 189K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 11 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 54M May 29 14: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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1749166746475

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ViralEpidemic-PT-S16D2C4A03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2025-06-05 23:39:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-06-05 23:39:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 23:39:09] [INFO ] Load time of PNML (sax parser for PT used): 1791 ms
[2025-06-05 23:39:09] [INFO ] Transformed 78643 places.
[2025-06-05 23:39:10] [INFO ] Transformed 144177 transitions.
[2025-06-05 23:39:10] [INFO ] Parsed PT model containing 78643 places and 144177 transitions and 353889 arcs in 2282 ms.
Structural test allowed to assert that 69905 places are NOT stable. Took 269 ms.
[2025-06-05 23:39:21] [INFO ] Flatten gal took : 8020 ms
[2025-06-05 23:39:27] [INFO ] Flatten gal took : 5917 ms
[2025-06-05 23:39:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1152630296481600412.gal : 800 ms
[2025-06-05 23:39:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9876272238220701627.prop : 45 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1152630296481600412.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9876272238220701627.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (8 resets) in 88424 ms. (0 steps per ms) remains 2164/8738 properties
BEST_FIRST walk for 124 steps (0 resets) in 39 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 46 ms. (2 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 40 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 42 ms. (2 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 41 ms. (2 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 32 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 38 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 40 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 36 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 29 ms. (4 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 34 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 41 ms. (2 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 30 ms. (4 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 31 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 31 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 29 ms. (4 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 30 ms. (4 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 35 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 32 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 31 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 35 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 30 ms. (4 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 29 ms. (4 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 32 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 32 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 25 ms. (4 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 25 ms. (4 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 32 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 33 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 33 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 29 ms. (4 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 31 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 32 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 28 ms. (4 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 38 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 41 ms. (2 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 33 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 43 ms. (2 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 34 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 42 ms. (2 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 36 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 32 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 35 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 34 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 24 ms. (4 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 32 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 31 ms. (3 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 30 ms. (4 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 27 ms. (4 steps per ms) remains 2164/2164 properties
BEST_FIRST walk for 124 steps (0 resets) in 42 ms. (2 steps per ms) remains 2164/2164 properties
// Phase 1: matrix 144177 rows 78643 cols
[2025-06-05 23:40:27] [INFO ] Invariants computation overflowed in 52364 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2164/222820 variables, and 0 constraints, problems are : Problem set: 0 solved, 2164 unsolved in 5089 ms.
Refiners :[State Equation: 0/78643 constraints, PredecessorRefiner: 2164/2164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2164 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2164/222820 variables, and 0 constraints, problems are : Problem set: 0 solved, 2164 unsolved in 5041 ms.
Refiners :[State Equation: 0/78643 constraints, PredecessorRefiner: 0/2164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 97573ms problems are : Problem set: 0 solved, 2164 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2164 out of 78643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78643/78643 places, 144177/144177 transitions.
Graph (complete) has 69904 edges and 78643 vertex of which 21570 are kept as prefixes of interest. Removing 57073 places using SCC suffix rule.82 ms
Discarding 57073 places :
Also discarding 103993 output transitions
Drop transitions (Output transitions of discarded places.) removed 103993 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4186 transitions
Reduce isomorphic transitions removed 4186 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 4221 rules applied. Total rules applied 4222 place count 21570 transition count 35963
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 4257 place count 21535 transition count 35963
Discarding 1569 places :
Symmetric choice reduction at 2 with 1569 rule applications. Total rules 5826 place count 19966 transition count 34394
Iterating global reduction 2 with 1569 rules applied. Total rules applied 7395 place count 19966 transition count 34394
Performed 1210 Post agglomeration using F-continuation condition.Transition count delta: 1210
Deduced a syphon composed of 1210 places in 8 ms
Reduce places removed 1210 places and 0 transitions.
Iterating global reduction 2 with 2420 rules applied. Total rules applied 9815 place count 18756 transition count 33184
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9816 place count 18755 transition count 33183
Ensure Unique test removed 99 places
Iterating post reduction 2 with 99 rules applied. Total rules applied 9915 place count 18656 transition count 33183
Applied a total of 9915 rules in 6720 ms. Remains 18656 /78643 variables (removed 59987) and now considering 33183/144177 (removed 110994) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6733 ms. Remains : 18656/78643 places, 33183/144177 transitions.
RANDOM walk for 33482 steps (4 resets) in 120017 ms. (0 steps per ms) remains 6/2164 properties
BEST_FIRST walk for 40004 steps (0 resets) in 20494 ms. (1 steps per ms) remains 6/6 properties
BEST_FIRST walk for 35004 steps (0 resets) in 21651 ms. (1 steps per ms) remains 6/6 properties
BEST_FIRST walk for 41004 steps (0 resets) in 20792 ms. (1 steps per ms) remains 6/6 properties
BEST_FIRST walk for 35004 steps (0 resets) in 20972 ms. (1 steps per ms) remains 6/6 properties
BEST_FIRST walk for 56004 steps (0 resets) in 20525 ms. (2 steps per ms) remains 6/6 properties
BEST_FIRST walk for 58004 steps (0 resets) in 21048 ms. (2 steps per ms) remains 6/6 properties
// Phase 1: matrix 33183 rows 18656 cols
[2025-06-05 23:42:26] [INFO ] Invariants computation overflowed in 5036 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 96/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 51/153 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 9/162 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 96/258 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 90/348 variables, 45/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2160/2508 variables, 720/828 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2508 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 90/2598 variables, 90/918 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2598 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/2598 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2598/51839 variables, and 918 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1660 ms.
Refiners :[State Equation: 918/18656 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 96/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 51/153 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 9/162 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 96/258 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 90/348 variables, 45/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 2160/2508 variables, 720/834 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2508 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 90/2598 variables, 90/924 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2598 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/2598 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2598/51839 variables, and 924 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4809 ms.
Refiners :[State Equation: 918/18656 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11732ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 78 steps, including 0 resets, run visited all 6 properties in 48 ms. (steps per millisecond=1 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 4 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 3 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 238 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 8739 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 205636 ms.

BK_STOP 1749166953619

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="ViralEpidemic-PT-S16D2C4A03"
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-5832"
echo " Executing tool itstools"
echo " Input is ViralEpidemic-PT-S16D2C4A03, 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 r245-tall-174915599400648"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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