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.r139-smll-174876533100005.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 Medical-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533100005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 19K 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 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748895157771

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:12:40] [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-02 20:12:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:12:41] [INFO ] Load time of PNML (sax parser for PT used): 1101 ms
[2025-06-02 20:12:41] [INFO ] Transformed 312 places.
[2025-06-02 20:12:41] [INFO ] Transformed 5431 transitions.
[2025-06-02 20:12:41] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 1356 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 242 places in 32 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-10-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-10-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
[2025-06-02 20:12:41] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2025-06-02 20:12:41] [INFO ] Computed 10 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 10000 steps (58 resets) in 58 ms. (169 steps per ms)
FORMULA Medical-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (21 resets) in 40 ms. (487 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-02 20:12:41] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2025-06-02 20:12:41] [INFO ] Invariant cache hit.
[2025-06-02 20:12:42] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2025-06-02 20:12:42] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2025-06-02 20:12:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 20:12:42] [INFO ] [Real]Added 56 Read/Feed constraints in 30 ms returned sat
[2025-06-02 20:12:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:12:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-02 20:12:42] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2025-06-02 20:12:42] [INFO ] [Nat]Added 56 Read/Feed constraints in 32 ms returned sat
[2025-06-02 20:12:42] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 12 ms to minimize.
[2025-06-02 20:12:42] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 3 ms to minimize.
[2025-06-02 20:12:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
[2025-06-02 20:12:42] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 48 ms.
[2025-06-02 20:12:43] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2025-06-02 20:12:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2025-06-02 20:12:43] [INFO ] Added : 56 causal constraints over 12 iterations in 534 ms. Result :sat
Minimization took 85 ms.
[2025-06-02 20:12:43] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-02 20:12:43] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-06-02 20:12:43] [INFO ] [Real]Added 56 Read/Feed constraints in 13 ms returned sat
[2025-06-02 20:12:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:12:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:12:43] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2025-06-02 20:12:43] [INFO ] [Nat]Added 56 Read/Feed constraints in 13 ms returned sat
[2025-06-02 20:12:43] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2025-06-02 20:12:43] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2025-06-02 20:12:43] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2025-06-02 20:12:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 222 ms
[2025-06-02 20:12:43] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 27 ms.
[2025-06-02 20:12:44] [INFO ] Added : 26 causal constraints over 6 iterations in 122 ms. Result :sat
Minimization took 52 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 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 227/227 transitions.
Graph (complete) has 347 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 67 transition count 224
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 64 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 63 transition count 224
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 61 transition count 222
Applied a total of 13 rules in 76 ms. Remains 61 /69 variables (removed 8) and now considering 222/227 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 61/69 places, 222/227 transitions.
[2025-06-02 20:12:44] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2025-06-02 20:12:44] [INFO ] Computed 8 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000007 steps (2 resets) in 769 ms. (1298 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 1477 ms. (1353 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-02 20:12:46] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:12:46] [INFO ] Invariant cache hit.
[2025-06-02 20:12:46] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:12:46] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-06-02 20:12:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 20:12:46] [INFO ] [Real]Added 57 Read/Feed constraints in 12 ms returned sat
[2025-06-02 20:12:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:12:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:12:46] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-06-02 20:12:46] [INFO ] [Nat]Added 57 Read/Feed constraints in 21 ms returned sat
[2025-06-02 20:12:46] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2025-06-02 20:12:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2025-06-02 20:12:47] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 38 ms.
[2025-06-02 20:12:47] [INFO ] Added : 9 causal constraints over 2 iterations in 105 ms. Result :sat
Minimization took 69 ms.
[2025-06-02 20:12:47] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:12:47] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-06-02 20:12:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:12:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:12:47] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-06-02 20:12:47] [INFO ] [Nat]Added 57 Read/Feed constraints in 19 ms returned sat
[2025-06-02 20:12:47] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 39 ms.
[2025-06-02 20:12:47] [INFO ] Added : 12 causal constraints over 3 iterations in 122 ms. Result :sat
Minimization took 77 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 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 18 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 18 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2025-06-02 20:12:47] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:12:47] [INFO ] Invariant cache hit.
[2025-06-02 20:12:47] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-06-02 20:12:47] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:12:47] [INFO ] Invariant cache hit.
[2025-06-02 20:12:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 20:12:48] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2025-06-02 20:12:48] [INFO ] Redundant transitions in 18 ms returned []
Running 221 sub problems to find dead transitions.
[2025-06-02 20:12:48] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:12:48] [INFO ] Invariant cache hit.
[2025-06-02 20:12:48] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2025-06-02 20:12:49] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 57/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2025-06-02 20:12:52] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 128 constraints, problems are : Problem set: 0 solved, 221 unsolved in 8578 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/71 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 57/128 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 221/349 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:13:00] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 5 ms to minimize.
[2025-06-02 20:13:00] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2025-06-02 20:13:01] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2025-06-02 20:13:01] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2025-06-02 20:13:01] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 5/354 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:13:03] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2025-06-02 20:13:03] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/356 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/356 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/356 constraints. Problems are: Problem set: 43 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 356 constraints, problems are : Problem set: 43 solved, 178 unsolved in 13894 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 9/9 constraints]
After SMT, in 22969ms problems are : Problem set: 43 solved, 178 unsolved
Search for dead transitions found 43 dead transitions in 22993ms
Found 43 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 43 transitions
Dead transitions reduction (with SMT) removed 43 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/61 places, 179/222 transitions.
Reduce places removed 11 places and 65 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 50 transition count 114
Reduce places removed 6 places and 31 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 44 transition count 83
Reduce places removed 2 places and 11 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 42 transition count 72
Reduce places removed 2 places and 12 transitions.
Graph (complete) has 127 edges and 40 vertex of which 2 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.0 ms
Discarding 38 places :
Also discarding 60 output transitions
Drop transitions (Output transitions of discarded places.) removed 60 transitions
Iterating post reduction 3 with 3 rules applied. Total rules applied 22 place count 2 transition count 0
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 22 rules in 6 ms. Remains 2 /61 variables (removed 59) and now considering 0/179 (removed 179) transitions.
[2025-06-02 20:13:11] [INFO ] Computed 0 invariants in 0 ms
[2025-06-02 20:13:11] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-02 20:13:11] [INFO ] Invariant cache hit.
[2025-06-02 20:13:11] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/61 places, 0/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 23599 ms. Remains : 2/61 places, 0/222 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA Medical-PT-10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 31287 ms.

BK_STOP 1748895191372

--------------------
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="Medical-PT-10"
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 Medical-PT-10, 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 r139-smll-174876533100005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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