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

About the Execution of ITS-Tools for BART-PT-030

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853730100859.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 BART-PT-030, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853730100859
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 52M
-rw-r--r-- 1 mcc users 1.1M May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.8M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9M May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.0M May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 809K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 591K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.4M May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 4.7M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9M May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 86K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 174K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 7.1M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BART-PT-030-LTLCardinality-00
FORMULA_NAME BART-PT-030-LTLCardinality-01
FORMULA_NAME BART-PT-030-LTLCardinality-02
FORMULA_NAME BART-PT-030-LTLCardinality-03
FORMULA_NAME BART-PT-030-LTLCardinality-04
FORMULA_NAME BART-PT-030-LTLCardinality-05
FORMULA_NAME BART-PT-030-LTLCardinality-06
FORMULA_NAME BART-PT-030-LTLCardinality-07
FORMULA_NAME BART-PT-030-LTLCardinality-08
FORMULA_NAME BART-PT-030-LTLCardinality-09
FORMULA_NAME BART-PT-030-LTLCardinality-10
FORMULA_NAME BART-PT-030-LTLCardinality-11
FORMULA_NAME BART-PT-030-LTLCardinality-12
FORMULA_NAME BART-PT-030-LTLCardinality-13
FORMULA_NAME BART-PT-030-LTLCardinality-14
FORMULA_NAME BART-PT-030-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748674836348

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-030
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-31 07:00:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 07:00:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:00:38] [INFO ] Load time of PNML (sax parser for PT used): 548 ms
[2025-05-31 07:00:38] [INFO ] Transformed 4170 places.
[2025-05-31 07:00:38] [INFO ] Transformed 6060 transitions.
[2025-05-31 07:00:38] [INFO ] Found NUPN structural information;
[2025-05-31 07:00:38] [INFO ] Parsed PT model containing 4170 places and 6060 transitions and 48600 arcs in 693 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 90 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-030-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 960 places :
Symmetric choice reduction at 0 with 960 rule applications. Total rules 960 place count 3000 transition count 5100
Iterating global reduction 0 with 960 rules applied. Total rules applied 1920 place count 3000 transition count 5100
Discarding 808 places :
Symmetric choice reduction at 0 with 808 rule applications. Total rules 2728 place count 2192 transition count 4292
Iterating global reduction 0 with 808 rules applied. Total rules applied 3536 place count 2192 transition count 4292
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3656 place count 2072 transition count 4172
Iterating global reduction 0 with 120 rules applied. Total rules applied 3776 place count 2072 transition count 4172
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3866 place count 1982 transition count 4082
Iterating global reduction 0 with 90 rules applied. Total rules applied 3956 place count 1982 transition count 4082
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4046 place count 1892 transition count 3992
Iterating global reduction 0 with 90 rules applied. Total rules applied 4136 place count 1892 transition count 3992
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4226 place count 1802 transition count 3902
Iterating global reduction 0 with 90 rules applied. Total rules applied 4316 place count 1802 transition count 3902
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4406 place count 1712 transition count 3812
Iterating global reduction 0 with 90 rules applied. Total rules applied 4496 place count 1712 transition count 3812
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4586 place count 1622 transition count 3722
Iterating global reduction 0 with 90 rules applied. Total rules applied 4676 place count 1622 transition count 3722
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4736 place count 1562 transition count 3662
Iterating global reduction 0 with 60 rules applied. Total rules applied 4796 place count 1562 transition count 3662
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4855 place count 1503 transition count 3603
Iterating global reduction 0 with 59 rules applied. Total rules applied 4914 place count 1503 transition count 3603
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4944 place count 1473 transition count 3573
Iterating global reduction 0 with 30 rules applied. Total rules applied 4974 place count 1473 transition count 3573
Applied a total of 4974 rules in 1738 ms. Remains 1473 /3960 variables (removed 2487) and now considering 3573/6060 (removed 2487) transitions.
// Phase 1: matrix 3573 rows 1473 cols
[2025-05-31 07:00:40] [INFO ] Computed 30 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:00:40] [INFO ] Implicit Places using invariants in 501 ms returned []
[2025-05-31 07:00:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:00:41] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
Running 2493 sub problems to find dead transitions.
[2025-05-31 07:00:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1443/5046 variables, and 0 constraints, problems are : Problem set: 0 solved, 2493 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1473 constraints, PredecessorRefiner: 2493/2493 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2493 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1443/5046 variables, and 0 constraints, problems are : Problem set: 0 solved, 2493 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1473 constraints, PredecessorRefiner: 0/2493 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61138ms problems are : Problem set: 0 solved, 2493 unsolved
Search for dead transitions found 0 dead transitions in 61158ms
Starting structural reductions in LTL mode, iteration 1 : 1473/3960 places, 3573/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64374 ms. Remains : 1473/3960 places, 3573/6060 transitions.
Support contains 2 out of 1473 places after structural reductions.
[2025-05-31 07:01:43] [INFO ] Flatten gal took : 273 ms
[2025-05-31 07:01:43] [INFO ] Flatten gal took : 94 ms
[2025-05-31 07:01:43] [INFO ] Input system was already deterministic with 3573 transitions.
RANDOM walk for 31555 steps (6 resets) in 1158 ms. (27 steps per ms) remains 0/2 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1473/1473 places, 3573/3573 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1472 transition count 3572
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1472 transition count 3572
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1471 transition count 3571
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1471 transition count 3571
Applied a total of 4 rules in 184 ms. Remains 1471 /1473 variables (removed 2) and now considering 3571/3573 (removed 2) transitions.
// Phase 1: matrix 3571 rows 1471 cols
[2025-05-31 07:01:44] [INFO ] Computed 30 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:01:44] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-05-31 07:01:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:01:45] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
Running 2491 sub problems to find dead transitions.
[2025-05-31 07:01:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1441/5042 variables, and 0 constraints, problems are : Problem set: 0 solved, 2491 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1471 constraints, PredecessorRefiner: 2491/2491 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2491 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1441/5042 variables, and 0 constraints, problems are : Problem set: 0 solved, 2491 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1471 constraints, PredecessorRefiner: 0/2491 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60878ms problems are : Problem set: 0 solved, 2491 unsolved
Search for dead transitions found 0 dead transitions in 60883ms
Starting structural reductions in LTL mode, iteration 1 : 1471/1473 places, 3571/3573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62178 ms. Remains : 1471/1473 places, 3571/3573 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-030-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 2418 ms.
Product exploration explored 100000 steps with 50000 reset in 2335 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-030-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-030-LTLCardinality-09 finished in 67893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1473 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1473/1473 places, 3573/3573 transitions.
Graph (trivial) has 3571 edges and 1473 vertex of which 1471 / 1473 are part of one of the 30 SCC in 8 ms
Free SCC test removed 1441 places
Ensure Unique test removed 3540 transitions
Reduce isomorphic transitions removed 3540 transitions.
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 3 transition count 5
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 30 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 2 transition count 3
Applied a total of 32 rules in 28 ms. Remains 2 /1473 variables (removed 1471) and now considering 3/3573 (removed 3570) transitions.
// Phase 1: matrix 3 rows 2 cols
[2025-05-31 07:02:52] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:02:52] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-05-31 07:02:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:02:52] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:02:52] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2025-05-31 07:02:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 68ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1473 places, 3/3573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 2/1473 places, 3/3573 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-030-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BART-PT-030-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLCardinality-15 finished in 195 ms.
All properties solved by simple procedures.
Total runtime 134834 ms.

BK_STOP 1748674972427

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

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="BART-PT-030"
export BK_EXAMINATION="LTLCardinality"
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-5832"
echo " Executing tool itstools"
echo " Input is BART-PT-030, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853730100859"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-030.tgz
mv BART-PT-030 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;