Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r504-tall-171649613000557.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is Medical-PT-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649613000557
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 13 14:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 14:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M May 18 16:42 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

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

=== Now, execution of the tool begins

BK_START 1717230031267

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:20:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 08:20:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:20:32] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2024-06-01 08:20:32] [INFO ] Transformed 312 places.
[2024-06-01 08:20:32] [INFO ] Transformed 5431 transitions.
[2024-06-01 08:20:32] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 432 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 242 places in 23 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-12-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf]
[2024-06-01 08:20:32] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2024-06-01 08:20:32] [INFO ] Computed 10 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0] Max Struct:[+inf, 1, 1, 1]
FORMULA Medical-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10005 steps (51 resets) in 30 ms. (322 steps per ms)
FORMULA Medical-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Medical-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (10 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-06-01 08:20:32] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-06-01 08:20:32] [INFO ] Invariant cache hit.
[2024-06-01 08:20:33] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 08:20:33] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-01 08:20:33] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 08:20:33] [INFO ] [Real]Added 56 Read/Feed constraints in 11 ms returned sat
[2024-06-01 08:20:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:20:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 08:20:33] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-01 08:20:33] [INFO ] [Nat]Added 56 Read/Feed constraints in 10 ms returned sat
[2024-06-01 08:20:33] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 11 ms to minimize.
[2024-06-01 08:20:33] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 4 ms to minimize.
[2024-06-01 08:20:33] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-06-01 08:20:33] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:20:33] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:20:33] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:20:33] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:20:33] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:20:33] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2024-06-01 08:20:33] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:20:33] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 3 ms to minimize.
[2024-06-01 08:20:34] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-06-01 08:20:34] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:20:34] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:20:34] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 08:20:34] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 946 ms
[2024-06-01 08:20:34] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 16 ms.
[2024-06-01 08:20:34] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:20:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-06-01 08:20:34] [INFO ] Added : 45 causal constraints over 10 iterations in 215 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 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.5 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 0 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 1 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 50 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 65 ms. Remains : 61/69 places, 222/227 transitions.
[2024-06-01 08:20:34] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
Found an invariant !
This invariant on transitions {1=1, 151=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {3=1, 151=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-06-01 08:20:34] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2024-06-01 08:20:34] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 482 ms. (2070 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 494 ms. (2020 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-06-01 08:20:35] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-06-01 08:20:35] [INFO ] Invariant cache hit.
[2024-06-01 08:20:35] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-01 08:20:35] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-06-01 08:20:35] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 08:20:35] [INFO ] [Real]Added 57 Read/Feed constraints in 9 ms returned sat
[2024-06-01 08:20:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:20:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-01 08:20:36] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-06-01 08:20:36] [INFO ] [Nat]Added 57 Read/Feed constraints in 8 ms returned sat
[2024-06-01 08:20:36] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:20:36] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:20:36] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:20:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 164 ms
[2024-06-01 08:20:36] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 26 ms.
[2024-06-01 08:20:36] [INFO ] Added : 9 causal constraints over 2 iterations in 61 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 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 7 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 7 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 6 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-06-01 08:20:36] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-06-01 08:20:36] [INFO ] Invariant cache hit.
[2024-06-01 08:20:36] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 08:20:36] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-06-01 08:20:36] [INFO ] Invariant cache hit.
[2024-06-01 08:20:36] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 08:20:36] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-06-01 08:20:36] [INFO ] Redundant transitions in 8 ms returned []
Running 221 sub problems to find dead transitions.
[2024-06-01 08:20:36] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-06-01 08:20:36] [INFO ] Invariant cache hit.
[2024-06-01 08:20:36] [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
[2024-06-01 08:20:37] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 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
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 127 constraints, problems are : Problem set: 0 solved, 221 unsolved in 4177 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: 1/1 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, 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
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/348 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2024-06-01 08:20:42] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:20:42] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:20:42] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 3/351 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2024-06-01 08:20:43] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:20:44] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:20:44] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:20:44] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 4/355 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2024-06-01 08:20:46] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/356 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/356 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 10 (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 9487 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 13878ms problems are : Problem set: 43 solved, 178 unsolved
Search for dead transitions found 43 dead transitions in 13888ms
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 10 places and 65 transitions.
Graph (complete) has 195 edges and 51 vertex of which 1 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 114 output transitions
Drop transitions (Output transitions of discarded places.) removed 114 transitions
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 1 transition count 0
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 11 rules in 4 ms. Remains 1 /61 variables (removed 60) and now considering 0/179 (removed 179) transitions.
[2024-06-01 08:20:50] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 08:20:50] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 08:20:50] [INFO ] Invariant cache hit.
[2024-06-01 08:20:50] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/61 places, 0/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 14167 ms. Remains : 1/61 places, 0/222 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-12-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 18130 ms.
ITS solved all properties within timeout

BK_STOP 1717230050500

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-12"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Medical-PT-12, 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 r504-tall-171649613000557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Medical-PT-12.tgz
mv Medical-PT-12 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;