Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r338-smll-178021499300461.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is FileSystem-PT-N05I10B10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 7.8K May 27 10:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 27 10:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 27 10:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 27 10:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 13K May 27 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 27 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 27 10:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 27 10:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 236K Jun 10 11:57 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1781620757943

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N05I10B10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-06-16 14:39:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-16 14:39:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 14:39:20] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2026-06-16 14:39:20] [INFO ] Transformed 561 places.
[2026-06-16 14:39:20] [INFO ] Transformed 520 transitions.
[2026-06-16 14:39:20] [INFO ] Parsed PT model containing 561 places and 520 transitions and 1850 arcs in 467 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Reduce places removed 10 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-883793814470936648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9461579175389138176.kers'
[2026-06-16 14:39:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-883793814470936648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9461579175389138176.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 1 ms.
// Phase 1: matrix 520 rows 541 cols 1550 entries
Finished phase 1 with 420 SingleSign rule and 90 generalized
[2026-06-16 14:39:21] [INFO ] Computed 41 invariants in 8 ms
Computed 41 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9461579175389138176.kers
Total runtime 10 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FileSystem-PT-N05I10B10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (151 resets) in 104 ms. (95 steps per ms)
FORMULA FileSystem-PT-N05I10B10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N05I10B10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N05I10B10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120011 steps (304 resets) in 285 ms. (419 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-06-16 14:39:21] [INFO ] Invariant cache hit.
[2026-06-16 14:39:22] [INFO ] [Real]Absence check using 31 positive place invariants in 58 ms returned sat
[2026-06-16 14:39:22] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 23 ms returned sat
[2026-06-16 14:39:22] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2026-06-16 14:39:22] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-16 14:39:23] [INFO ] [Real]Added 100 Read/Feed constraints in 205 ms returned sat
[2026-06-16 14:39:23] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:39:23] [INFO ] [Nat]Absence check using 31 positive place invariants in 45 ms returned sat
[2026-06-16 14:39:23] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 13 ms returned sat
[2026-06-16 14:39:23] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2026-06-16 14:39:24] [INFO ] [Nat]Added 100 Read/Feed constraints in 345 ms returned unsat
[2026-06-16 14:39:24] [INFO ] [Real]Absence check using 31 positive place invariants in 38 ms returned sat
[2026-06-16 14:39:24] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 15 ms returned sat
[2026-06-16 14:39:25] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2026-06-16 14:39:25] [INFO ] [Real]Added 100 Read/Feed constraints in 70 ms returned sat
[2026-06-16 14:39:25] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:39:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 37 ms returned sat
[2026-06-16 14:39:25] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 14 ms returned sat
[2026-06-16 14:39:25] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2026-06-16 14:39:26] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:39:26] [INFO ] [Nat]Added 100 Read/Feed constraints in 618 ms returned unsat
[2026-06-16 14:39:26] [INFO ] [Real]Absence check using 31 positive place invariants in 38 ms returned sat
[2026-06-16 14:39:26] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 15 ms returned sat
[2026-06-16 14:39:27] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2026-06-16 14:39:27] [INFO ] [Real]Added 100 Read/Feed constraints in 62 ms returned sat
[2026-06-16 14:39:27] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:39:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 39 ms returned sat
[2026-06-16 14:39:27] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 14 ms returned sat
[2026-06-16 14:39:28] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2026-06-16 14:39:28] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:39:28] [INFO ] [Nat]Added 100 Read/Feed constraints in 836 ms returned unsat
[2026-06-16 14:39:29] [INFO ] [Real]Absence check using 31 positive place invariants in 28 ms returned sat
[2026-06-16 14:39:29] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 10 ms returned sat
[2026-06-16 14:39:29] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2026-06-16 14:39:29] [INFO ] [Real]Added 100 Read/Feed constraints in 42 ms returned sat
[2026-06-16 14:39:29] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:39:29] [INFO ] [Nat]Absence check using 31 positive place invariants in 37 ms returned sat
[2026-06-16 14:39:29] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 15 ms returned sat
[2026-06-16 14:39:30] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2026-06-16 14:39:30] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:39:30] [INFO ] [Nat]Added 100 Read/Feed constraints in 522 ms returned unsat
[2026-06-16 14:39:30] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2026-06-16 14:39:30] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 9 ms returned sat
[2026-06-16 14:39:31] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2026-06-16 14:39:31] [INFO ] [Real]Added 100 Read/Feed constraints in 58 ms returned sat
[2026-06-16 14:39:31] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:39:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 38 ms returned sat
[2026-06-16 14:39:31] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 15 ms returned sat
[2026-06-16 14:39:32] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2026-06-16 14:39:32] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:39:32] [INFO ] [Nat]Added 100 Read/Feed constraints in 700 ms returned unsat
[2026-06-16 14:39:32] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned sat
[2026-06-16 14:39:32] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 8 ms returned sat
[2026-06-16 14:39:33] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2026-06-16 14:39:33] [INFO ] [Real]Added 100 Read/Feed constraints in 59 ms returned sat
[2026-06-16 14:39:33] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:39:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 27 ms returned sat
[2026-06-16 14:39:33] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 10 ms returned sat
[2026-06-16 14:39:34] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2026-06-16 14:39:34] [INFO ] [Nat]Added 100 Read/Feed constraints in 267 ms returned unsat
[2026-06-16 14:39:34] [INFO ] [Real]Absence check using 31 positive place invariants in 38 ms returned sat
[2026-06-16 14:39:34] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 14 ms returned sat
[2026-06-16 14:39:35] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2026-06-16 14:39:35] [INFO ] [Real]Added 100 Read/Feed constraints in 167 ms returned sat
[2026-06-16 14:39:35] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:39:35] [INFO ] [Nat]Absence check using 31 positive place invariants in 37 ms returned sat
[2026-06-16 14:39:35] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 13 ms returned sat
[2026-06-16 14:39:35] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2026-06-16 14:39:36] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:39:36] [INFO ] [Nat]Added 100 Read/Feed constraints in 643 ms returned unsat
[2026-06-16 14:39:36] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned sat
[2026-06-16 14:39:36] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 8 ms returned sat
[2026-06-16 14:39:37] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2026-06-16 14:39:37] [INFO ] [Real]Added 100 Read/Feed constraints in 91 ms returned sat
[2026-06-16 14:39:37] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:39:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 37 ms returned sat
[2026-06-16 14:39:37] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 13 ms returned sat
[2026-06-16 14:39:37] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2026-06-16 14:39:37] [INFO ] [Nat]Added 100 Read/Feed constraints in 104 ms returned unsat
[2026-06-16 14:39:38] [INFO ] [Real]Absence check using 31 positive place invariants in 37 ms returned sat
[2026-06-16 14:39:38] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 15 ms returned sat
[2026-06-16 14:39:38] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2026-06-16 14:39:38] [INFO ] [Real]Added 100 Read/Feed constraints in 61 ms returned sat
[2026-06-16 14:39:38] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:39:39] [INFO ] [Nat]Absence check using 31 positive place invariants in 47 ms returned sat
[2026-06-16 14:39:39] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 22 ms returned sat
[2026-06-16 14:39:39] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2026-06-16 14:39:39] [INFO ] [Nat]Added 100 Read/Feed constraints in 314 ms returned unsat
[2026-06-16 14:39:40] [INFO ] [Real]Absence check using 31 positive place invariants in 37 ms returned sat
[2026-06-16 14:39:40] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 11 ms returned sat
[2026-06-16 14:39:40] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2026-06-16 14:39:40] [INFO ] [Real]Added 100 Read/Feed constraints in 106 ms returned sat
[2026-06-16 14:39:40] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:39:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 38 ms returned sat
[2026-06-16 14:39:40] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 12 ms returned sat
[2026-06-16 14:39:41] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2026-06-16 14:39:41] [INFO ] [Nat]Added 100 Read/Feed constraints in 172 ms returned sat
[2026-06-16 14:39:41] [INFO ] Computed and/alt/rep : 410/420/410 causal constraints (skipped 100 transitions) in 68 ms.
[2026-06-16 14:39:42] [INFO ] Added : 66 causal constraints over 14 iterations in 1304 ms. Result :sat
Minimization took 504 ms.
[2026-06-16 14:39:43] [INFO ] [Real]Absence check using 31 positive place invariants in 38 ms returned sat
[2026-06-16 14:39:43] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 14 ms returned sat
[2026-06-16 14:39:44] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2026-06-16 14:39:44] [INFO ] [Real]Added 100 Read/Feed constraints in 59 ms returned sat
[2026-06-16 14:39:44] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:39:44] [INFO ] [Nat]Absence check using 31 positive place invariants in 30 ms returned sat
[2026-06-16 14:39:44] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 12 ms returned sat
[2026-06-16 14:39:44] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2026-06-16 14:39:45] [INFO ] [Nat]Added 100 Read/Feed constraints in 272 ms returned sat
[2026-06-16 14:39:45] [INFO ] Computed and/alt/rep : 410/420/410 causal constraints (skipped 100 transitions) in 66 ms.
[2026-06-16 14:39:46] [INFO ] Added : 66 causal constraints over 14 iterations in 1246 ms. Result :sat
Minimization took 512 ms.
[2026-06-16 14:39:47] [INFO ] [Real]Absence check using 31 positive place invariants in 35 ms returned sat
[2026-06-16 14:39:47] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 12 ms returned sat
[2026-06-16 14:39:47] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2026-06-16 14:39:47] [INFO ] [Real]Added 100 Read/Feed constraints in 56 ms returned sat
[2026-06-16 14:39:47] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:39:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 37 ms returned sat
[2026-06-16 14:39:47] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 11 ms returned sat
[2026-06-16 14:39:48] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2026-06-16 14:39:48] [INFO ] [Nat]Added 100 Read/Feed constraints in 418 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0]
FORMULA FileSystem-PT-N05I10B10-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B10-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 520/520 transitions.
Graph (complete) has 1240 edges and 551 vertex of which 451 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.7 ms
Discarding 100 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 451 transition count 510
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 441 transition count 510
Discarding 88 places :
Symmetric choice reduction at 2 with 88 rule applications. Total rules 109 place count 353 transition count 422
Iterating global reduction 2 with 88 rules applied. Total rules applied 197 place count 353 transition count 422
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 2 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 417 place count 243 transition count 312
Free-agglomeration rule (complex) applied 100 times.
Iterating global reduction 2 with 100 rules applied. Total rules applied 517 place count 243 transition count 212
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 2 with 108 rules applied. Total rules applied 625 place count 135 transition count 212
Applied a total of 625 rules in 209 ms. Remains 135 /551 variables (removed 416) and now considering 212/520 (removed 308) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 135/551 places, 212/520 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18045195709565544683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4357598215425553390.kers'
[2026-06-16 14:39:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18045195709565544683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4357598215425553390.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 212 rows 123 cols 534 entries
Finished phase 1 with 121 SingleSign rule and 0 generalized
[2026-06-16 14:39:49] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4357598215425553390.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (38461 resets) in 2170 ms. (460 steps per ms)
BEST_FIRST walk for 2000001 steps (11637 resets) in 1352 ms. (1478 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-06-16 14:39:52] [INFO ] Invariant cache hit.
[2026-06-16 14:39:52] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2026-06-16 14:39:52] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2026-06-16 14:39:52] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-16 14:39:52] [INFO ] [Real]Added 100 Read/Feed constraints in 18 ms returned sat
[2026-06-16 14:39:52] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:39:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2026-06-16 14:39:52] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2026-06-16 14:39:52] [INFO ] [Nat]Added 100 Read/Feed constraints in 32 ms returned sat
[2026-06-16 14:39:52] [INFO ] Computed and/alt/rep : 102/112/102 causal constraints (skipped 100 transitions) in 24 ms.
[2026-06-16 14:39:52] [INFO ] Added : 10 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 102 ms.
[2026-06-16 14:39:53] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2026-06-16 14:39:53] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2026-06-16 14:39:53] [INFO ] [Real]Added 100 Read/Feed constraints in 16 ms returned sat
[2026-06-16 14:39:53] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:39:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2026-06-16 14:39:53] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2026-06-16 14:39:53] [INFO ] [Nat]Added 100 Read/Feed constraints in 98 ms returned sat
[2026-06-16 14:39:53] [INFO ] Computed and/alt/rep : 102/112/102 causal constraints (skipped 100 transitions) in 17 ms.
[2026-06-16 14:39:53] [INFO ] Added : 10 causal constraints over 2 iterations in 66 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 212/212 transitions.
Applied a total of 0 rules in 10 ms. Remains 135 /135 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 135/135 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 212/212 transitions.
Applied a total of 0 rules in 10 ms. Remains 135 /135 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2026-06-16 14:39:53] [INFO ] Invariant cache hit.
[2026-06-16 14:39:54] [INFO ] Implicit Places using invariants in 272 ms returned []
[2026-06-16 14:39:54] [INFO ] Invariant cache hit.
[2026-06-16 14:39:54] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-16 14:39:54] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
[2026-06-16 14:39:54] [INFO ] Redundant transitions in 9 ms returned []
Running 202 sub problems to find dead transitions.
[2026-06-16 14:39:54] [INFO ] Invariant cache hit.
[2026-06-16 14:39:54] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 11/135 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 212/347 variables, 135/163 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 100/263 constraints. Problems are: Problem set: 20 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/263 constraints. Problems are: Problem set: 20 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 0/347 variables, 0/263 constraints. Problems are: Problem set: 20 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 263 constraints, problems are : Problem set: 20 solved, 182 unsolved in 25510 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 135/135 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 12/12 constraints. Problems are: Problem set: 20 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 2/14 constraints. Problems are: Problem set: 20 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 11/135 variables, 2/16 constraints. Problems are: Problem set: 20 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 12/28 constraints. Problems are: Problem set: 20 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 1/29 constraints. Problems are: Problem set: 20 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/29 constraints. Problems are: Problem set: 20 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 212/347 variables, 135/164 constraints. Problems are: Problem set: 20 solved, 182 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 100/264 constraints. Problems are: Problem set: 170 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 32/296 constraints. Problems are: Problem set: 170 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/296 constraints. Problems are: Problem set: 170 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/347 variables, 0/296 constraints. Problems are: Problem set: 170 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 296 constraints, problems are : Problem set: 170 solved, 32 unsolved in 10613 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 135/135 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 32/202 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36261ms problems are : Problem set: 170 solved, 32 unsolved
Search for dead transitions found 170 dead transitions in 36278ms
Found 170 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 170 transitions
Dead transitions reduction (with SMT) removed 170 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 135/135 places, 42/212 transitions.
Graph (complete) has 110 edges and 135 vertex of which 2 are kept as prefixes of interest. Removing 133 places using SCC suffix rule.0 ms
Discarding 133 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 2 /135 variables (removed 133) and now considering 0/42 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6601662314883275937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5128441082253887642.kers'
[2026-06-16 14:40:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6601662314883275937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5128441082253887642.kers]
[2026-06-16 14:40:31] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5128441082253887642.kers
Total runtime 0 ms.
[2026-06-16 14:40:31] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-06-16 14:40:31] [INFO ] Invariant cache hit.
[2026-06-16 14:40:31] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/135 places, 0/212 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 37451 ms. Remains : 2/135 places, 0/212 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA FileSystem-PT-N05I10B10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (after structural reductions) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 70824 ms.

BK_STOP 1781620831252

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="FileSystem-PT-N05I10B10"
export BK_EXAMINATION="UpperBounds"
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-5973"
echo " Executing tool itstools"
echo " Input is FileSystem-PT-N05I10B10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r338-smll-178021499300461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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