Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r251-tall-174915604900017.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 gold2024
Input is Szymanski-PT-b02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r251-tall-174915604900017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749196462182

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-06 07:54:23] [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]
[2025-06-06 07:54:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 07:54:23] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2025-06-06 07:54:23] [INFO ] Transformed 568 places.
[2025-06-06 07:54:23] [INFO ] Transformed 8320 transitions.
[2025-06-06 07:54:23] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 456 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b02-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-06 07:54:24] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2025-06-06 07:54:24] [INFO ] Computed 3 invariants in 61 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 5, 2, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 95 ms. (104 steps per ms)
FORMULA Szymanski-PT-b02-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (6 resets) in 139 ms. (214 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 2, 0] Max Struct:[1, 5, 1]
[2025-06-06 07:54:24] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2025-06-06 07:54:24] [INFO ] Invariant cache hit.
[2025-06-06 07:54:24] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2025-06-06 07:54:24] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 10 ms returned sat
[2025-06-06 07:54:25] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2025-06-06 07:54:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:54:25] [INFO ] [Real]Added 147 Read/Feed constraints in 123 ms returned sat
[2025-06-06 07:54:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:25] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:26] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2025-06-06 07:54:26] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:27] [INFO ] [Nat]Added 147 Read/Feed constraints in 1037 ms returned unknown
[2025-06-06 07:54:27] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:27] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:27] [INFO ] [Real]Absence check using state equation in 376 ms returned unsat
[2025-06-06 07:54:27] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:27] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:28] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2025-06-06 07:54:28] [INFO ] [Real]Added 147 Read/Feed constraints in 547 ms returned sat
[2025-06-06 07:54:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:29] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:29] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2025-06-06 07:54:30] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:30] [INFO ] [Nat]Added 147 Read/Feed constraints in 1061 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 2, 0] Max Struct:[1, 2, 1]
FORMULA Szymanski-PT-b02-UpperBounds-07 2 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 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 306 transition count 7938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 305 transition count 7810
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 305 transition count 7810
Applied a total of 129 rules in 483 ms. Remains 305 /308 variables (removed 3) and now considering 7810/8064 (removed 254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 305/308 places, 7810/8064 transitions.
[2025-06-06 07:54:31] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2025-06-06 07:54:31] [INFO ] Computed 1 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2899 ms. (344 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 2096 ms. (953 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-06 07:54:36] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2025-06-06 07:54:36] [INFO ] Invariant cache hit.
[2025-06-06 07:54:36] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-06 07:54:36] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2025-06-06 07:54:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:36] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2025-06-06 07:54:37] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2025-06-06 07:54:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:54:40] [INFO ] [Nat]Added 147 Read/Feed constraints in 2988 ms returned sat
[2025-06-06 07:54:40] [INFO ] Deduced a trap composed of 72 places in 641 ms of which 20 ms to minimize.
[2025-06-06 07:54:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 820 ms
[2025-06-06 07:54:41] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2595 transitions) in 562 ms.
[2025-06-06 07:54:41] [INFO ] Added : 0 causal constraints over 0 iterations in 758 ms. Result :sat
Minimization took 4509 ms.
[2025-06-06 07:54:46] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2025-06-06 07:54:46] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2025-06-06 07:54:46] [INFO ] [Real]Added 147 Read/Feed constraints in 87 ms returned sat
[2025-06-06 07:54:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:47] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-06 07:54:47] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2025-06-06 07:54:51] [INFO ] [Nat]Added 147 Read/Feed constraints in 3623 ms returned sat
[2025-06-06 07:54:51] [INFO ] Deduced a trap composed of 108 places in 514 ms of which 3 ms to minimize.
[2025-06-06 07:54:52] [INFO ] Deduced a trap composed of 134 places in 347 ms of which 2 ms to minimize.
[2025-06-06 07:54:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1027 ms
[2025-06-06 07:54:52] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2595 transitions) in 474 ms.
[2025-06-06 07:54:52] [INFO ] Added : 0 causal constraints over 0 iterations in 637 ms. Result :sat
Minimization took 4502 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 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 222 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 299 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2025-06-06 07:54:57] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2025-06-06 07:54:57] [INFO ] Invariant cache hit.
[2025-06-06 07:54:58] [INFO ] Implicit Places using invariants in 453 ms returned []
[2025-06-06 07:54:58] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2025-06-06 07:54:58] [INFO ] Invariant cache hit.
[2025-06-06 07:54:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:55:41] [INFO ] Performed 125/305 implicitness test of which 0 returned IMPLICIT in 42 seconds.
[2025-06-06 07:56:11] [INFO ] Performed 296/305 implicitness test of which 0 returned IMPLICIT in 72 seconds.
[2025-06-06 07:56:16] [INFO ] Implicit Places using invariants and state equation in 78720 ms returned []
Implicit Place search using SMT with State Equation took 79176 ms to find 0 implicit places.
[2025-06-06 07:56:17] [INFO ] Redundant transitions in 883 ms returned []
Running 7808 sub problems to find dead transitions.
[2025-06-06 07:56:17] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2025-06-06 07:56:17] [INFO ] Invariant cache hit.
[2025-06-06 07:56:18] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2911 variables, and 1 constraints, problems are : Problem set: 0 solved, 7808 unsolved in 30176 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7808/7808 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7808 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2911 variables, and 1 constraints, problems are : Problem set: 0 solved, 7808 unsolved in 30098 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7808 constraints, Known Traps: 0/0 constraints]
After SMT, in 88154ms problems are : Problem set: 0 solved, 7808 unsolved
Search for dead transitions found 0 dead transitions in 88251ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168659 ms. Remains : 305/305 places, 7810/7810 transitions.
RANDOM walk for 40001 steps (8 resets) in 976 ms. (40 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 372 ms. (107 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
[2025-06-06 07:57:46] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2025-06-06 07:57:46] [INFO ] Invariant cache hit.
[2025-06-06 07:57:46] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 304/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2606/2911 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-06 07:57:47] [INFO ] Flatten gal took : 902 ms
At refinement iteration 4 (INCLUDED_ONLY) 0/2911 variables, 147/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2911 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-06 07:57:48] [INFO ] Flatten gal took : 442 ms
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/2911 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2911/2911 variables, and 453 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1357 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 304/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-06 07:57:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14184386725735909481.gal : 75 ms
[2025-06-06 07:57:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8509839113274380189.prop : 0 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14184386725735909481.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8509839113274380189.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2025-06-06 07:57:48] [INFO ] Deduced a trap composed of 92 places in 585 ms of which 6 ms to minimize.
Loading property file /tmp/ReachabilityCardinality8509839113274380189.prop.
[2025-06-06 07:57:49] [INFO ] Deduced a trap composed of 89 places in 561 ms of which 3 ms to minimize.
[2025-06-06 07:57:50] [INFO ] Deduced a trap composed of 120 places in 532 ms of which 2 ms to minimize.
[2025-06-06 07:57:50] [INFO ] Deduced a trap composed of 59 places in 567 ms of which 2 ms to minimize.
[2025-06-06 07:57:51] [INFO ] Deduced a trap composed of 86 places in 547 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 55
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :55 after 196
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :196 after 383
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :383 after 812
[2025-06-06 07:57:51] [INFO ] Deduced a trap composed of 124 places in 588 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :812 after 1300
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2606/2911 variables, 305/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2911/2911 variables, and 459 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 6436ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 305 transition count 7808
Applied a total of 2 rules in 206 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7810 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 305/305 places, 7808/7810 transitions.
RANDOM walk for 40001 steps (8 resets) in 287 ms. (138 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1300 after 2780
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2780 after 6764
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6764 after 9763
Interrupted probabilistic random walk after 134048 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 2
Probabilistic random walk after 134048 steps, saw 46504 distinct states, run finished after 3004 ms. (steps per millisecond=44 ) properties seen :0
[2025-06-06 07:57:56] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2025-06-06 07:57:56] [INFO ] Computed 3 invariants in 27 ms
[2025-06-06 07:57:56] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :9763 after 22137
[2025-06-06 07:57:57] [INFO ] Deduced a trap composed of 44 places in 470 ms of which 2 ms to minimize.
[2025-06-06 07:57:57] [INFO ] Deduced a trap composed of 134 places in 477 ms of which 3 ms to minimize.
[2025-06-06 07:57:58] [INFO ] Deduced a trap composed of 129 places in 466 ms of which 2 ms to minimize.
[2025-06-06 07:57:58] [INFO ] Deduced a trap composed of 129 places in 465 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 459 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3212 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-06 07:58:05] [INFO ] Deduced a trap composed of 146 places in 417 ms of which 1 ms to minimize.
[2025-06-06 07:58:05] [INFO ] Deduced a trap composed of 137 places in 349 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 463 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6362 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 9644ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 73 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 181 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2025-06-06 07:58:06] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:06] [INFO ] Invariant cache hit.
[2025-06-06 07:58:07] [INFO ] Implicit Places using invariants in 606 ms returned []
[2025-06-06 07:58:07] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:07] [INFO ] Invariant cache hit.
[2025-06-06 07:58:07] [INFO ] State equation strengthened by 147 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :22137 after 46484
[2025-06-06 07:58:38] [INFO ] Performed 299/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
Detected timeout of ITS tools.
[2025-06-06 07:58:38] [INFO ] Flatten gal took : 213 ms
[2025-06-06 07:58:38] [INFO ] Applying decomposition
[2025-06-06 07:58:38] [INFO ] Flatten gal took : 205 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2460003166830072154.txt' '-o' '/tmp/graph2460003166830072154.bin' '-w' '/tmp/graph2460003166830072154.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2460003166830072154.bin' '-l' '-1' '-v' '-w' '/tmp/graph2460003166830072154.weights' '-q' '0' '-e' '0.001'
[2025-06-06 07:58:39] [INFO ] Decomposing Gal with order
[2025-06-06 07:58:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 07:58:40] [INFO ] Removed a total of 17810 redundant transitions.
[2025-06-06 07:58:40] [INFO ] Flatten gal took : 689 ms
[2025-06-06 07:58:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 903 labels/synchronizations in 285 ms.
[2025-06-06 07:58:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13333212245970400694.gal : 33 ms
[2025-06-06 07:58:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15906866864924756856.prop : 0 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13333212245970400694.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15906866864924756856.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality15906866864924756856.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 80
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :80 after 175
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :175 after 266
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :266 after 289
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :289 after 297
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :297 after 301
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :301 after 301
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,906,1.3988,33112,440,488,21781,30956,7898,42634,409,126940,0
Total reachable state count : 906

Verifying 2 reachability properties.
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,1,1.4014,33112,52,53,21781,30956,7901,42634,412,126940,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,1,1.40176,33372,52,53,21781,30956,7907,42634,414,126940,0
[2025-06-06 07:58:44] [INFO ] Implicit Places using invariants and state equation in 37583 ms returned []
Implicit Place search using SMT with State Equation took 38194 ms to find 0 implicit places.
[2025-06-06 07:58:45] [INFO ] Redundant transitions in 833 ms returned []
Running 7806 sub problems to find dead transitions.
[2025-06-06 07:58:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:45] [INFO ] Invariant cache hit.
[2025-06-06 07:58:45] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30102 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2025-06-06 07:59:48] [INFO ] Deduced a trap composed of 108 places in 512 ms of which 5 ms to minimize.
[2025-06-06 07:59:49] [INFO ] Deduced a trap composed of 138 places in 396 ms of which 1 ms to minimize.
[2025-06-06 07:59:51] [INFO ] Deduced a trap composed of 32 places in 505 ms of which 2 ms to minimize.
[2025-06-06 07:59:51] [INFO ] Deduced a trap composed of 39 places in 551 ms of which 2 ms to minimize.
[2025-06-06 07:59:52] [INFO ] Deduced a trap composed of 45 places in 535 ms of which 2 ms to minimize.
[2025-06-06 07:59:53] [INFO ] Deduced a trap composed of 41 places in 562 ms of which 3 ms to minimize.
[2025-06-06 07:59:53] [INFO ] Deduced a trap composed of 80 places in 550 ms of which 2 ms to minimize.
[2025-06-06 07:59:54] [INFO ] Deduced a trap composed of 48 places in 496 ms of which 2 ms to minimize.
[2025-06-06 07:59:54] [INFO ] Deduced a trap composed of 75 places in 410 ms of which 2 ms to minimize.
[2025-06-06 07:59:55] [INFO ] Deduced a trap composed of 31 places in 515 ms of which 2 ms to minimize.
[2025-06-06 07:59:55] [INFO ] Deduced a trap composed of 44 places in 421 ms of which 2 ms to minimize.
[2025-06-06 07:59:56] [INFO ] Deduced a trap composed of 72 places in 433 ms of which 2 ms to minimize.
[2025-06-06 07:59:58] [INFO ] Deduced a trap composed of 91 places in 518 ms of which 2 ms to minimize.
[2025-06-06 07:59:59] [INFO ] Deduced a trap composed of 60 places in 578 ms of which 2 ms to minimize.
[2025-06-06 07:59:59] [INFO ] Deduced a trap composed of 88 places in 556 ms of which 2 ms to minimize.
[2025-06-06 08:00:00] [INFO ] Deduced a trap composed of 51 places in 502 ms of which 3 ms to minimize.
[2025-06-06 08:00:00] [INFO ] Deduced a trap composed of 99 places in 540 ms of which 2 ms to minimize.
[2025-06-06 08:00:01] [INFO ] Deduced a trap composed of 60 places in 491 ms of which 2 ms to minimize.
[2025-06-06 08:00:02] [INFO ] Deduced a trap composed of 107 places in 476 ms of which 3 ms to minimize.
[2025-06-06 08:00:02] [INFO ] Deduced a trap composed of 61 places in 460 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2025-06-06 08:00:07] [INFO ] Deduced a trap composed of 120 places in 410 ms of which 1 ms to minimize.
[2025-06-06 08:00:08] [INFO ] Deduced a trap composed of 140 places in 236 ms of which 1 ms to minimize.
[2025-06-06 08:00:09] [INFO ] Deduced a trap composed of 113 places in 379 ms of which 2 ms to minimize.
[2025-06-06 08:00:10] [INFO ] Deduced a trap composed of 93 places in 443 ms of which 2 ms to minimize.
[2025-06-06 08:00:11] [INFO ] Deduced a trap composed of 93 places in 389 ms of which 2 ms to minimize.
[2025-06-06 08:00:11] [INFO ] Deduced a trap composed of 75 places in 428 ms of which 2 ms to minimize.
[2025-06-06 08:00:12] [INFO ] Deduced a trap composed of 86 places in 422 ms of which 2 ms to minimize.
[2025-06-06 08:00:12] [INFO ] Deduced a trap composed of 94 places in 381 ms of which 4 ms to minimize.
[2025-06-06 08:00:13] [INFO ] Deduced a trap composed of 144 places in 552 ms of which 2 ms to minimize.
[2025-06-06 08:00:14] [INFO ] Deduced a trap composed of 132 places in 546 ms of which 2 ms to minimize.
[2025-06-06 08:00:14] [INFO ] Deduced a trap composed of 116 places in 501 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 34 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30117 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 31/31 constraints]
After SMT, in 89295ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 89373ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128644 ms. Remains : 305/305 places, 7808/7808 transitions.
FORMULA Szymanski-PT-b02-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b02-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 351775 ms.

BK_STOP 1749196815319

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="Szymanski-PT-b02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is Szymanski-PT-b02, 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 r251-tall-174915604900017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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