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.r526-tall-171679094300221.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 SafeBus-COL-03, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r526-tall-171679094300221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.9K Apr 12 14:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 14:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 12 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 12 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 14:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 14:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1717219248090

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-COL-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:20:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-01 05:20:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:20:49] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 05:20:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:20:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 553 ms
[2024-06-01 05:20:49] [INFO ] Detected 1 constant HL places corresponding to 3 PT places.
[2024-06-01 05:20:49] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 60 PT places and 214.0 transition bindings in 26 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 05:20:49] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-06-01 05:20:49] [INFO ] Skeletonized 1 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Domain [It(3), It(3)] of place AMC breaks symmetries in sort It
[2024-06-01 05:20:49] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions 556 arcs in 22 ms.
[2024-06-01 05:20:49] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 6 transitions.
Built sparse matrix representations for Structural reductions in 0 ms.27358KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 54/54 places, 91/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 15 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 25 ms. Remains : 54/54 places, 91/91 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 54/54 places, 91/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 8 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-06-01 05:20:50] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2024-06-01 05:20:50] [INFO ] Computed 17 invariants in 14 ms
[2024-06-01 05:20:50] [INFO ] Implicit Places using invariants in 199 ms returned [28, 29, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 227 ms to find 3 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 51/54 places, 91/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 51 transition count 88
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 6 place count 48 transition count 88
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
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 12 place count 45 transition count 91
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 12 rules in 19 ms. Remains 45 /51 variables (removed 6) and now considering 91/91 (removed 0) transitions.
[2024-06-01 05:20:50] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 45 cols
[2024-06-01 05:20:50] [INFO ] Computed 14 invariants in 7 ms
[2024-06-01 05:20:50] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 05:20:50] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-06-01 05:20:50] [INFO ] Invariant cache hit.
[2024-06-01 05:20:50] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 05:20:50] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 45/54 places, 91/91 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 464 ms. Remains : 45/54 places, 91/91 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1523 ms (no deadlock found). (steps per millisecond=820 )
Random directed walk for 1250000 steps, including 0 resets, run took 1088 ms (no deadlock found). (steps per millisecond=1148 )
[2024-06-01 05:20:53] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-06-01 05:20:53] [INFO ] Invariant cache hit.
[2024-06-01 05:20:53] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 05:20:53] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2024-06-01 05:20:53] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 05:20:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:20:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:20:53] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2024-06-01 05:20:53] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 05:20:53] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 05:20:53] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2024-06-01 05:20:53] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 7 ms to minimize.
[2024-06-01 05:20:53] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
[2024-06-01 05:20:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2024-06-01 05:20:53] [INFO ] Computed and/alt/rep : 37/219/37 causal constraints (skipped 28 transitions) in 6 ms.
[2024-06-01 05:20:53] [INFO ] Added : 23 causal constraints over 5 iterations in 55 ms. Result :sat
Parikh directed walk for 10800 steps, including 867 resets, run took 26 ms. (steps per millisecond=415 )
Random directed walk for 500002 steps, including 0 resets, run took 423 ms (no deadlock found). (steps per millisecond=1182 )
Random walk for 500000 steps, including 0 resets, run took 528 ms (no deadlock found). (steps per millisecond=946 )
Random directed walk for 500001 steps, including 0 resets, run took 412 ms (no deadlock found). (steps per millisecond=1213 )
Random walk for 500000 steps, including 0 resets, run took 519 ms (no deadlock found). (steps per millisecond=963 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 45/45 places, 91/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 9 ms. Remains 45 /45 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-06-01 05:20:55] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-06-01 05:20:55] [INFO ] Invariant cache hit.
[2024-06-01 05:20:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 05:20:55] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-06-01 05:20:55] [INFO ] Invariant cache hit.
[2024-06-01 05:20:55] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 05:20:55] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-06-01 05:20:55] [INFO ] Redundant transitions in 1 ms returned []
Running 88 sub problems to find dead transitions.
[2024-06-01 05:20:55] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2024-06-01 05:20:55] [INFO ] Invariant cache hit.
[2024-06-01 05:20:55] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 9/14 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-06-01 05:20:55] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:20:55] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 05:20:55] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:20:56] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:20:56] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-06-01 05:20:56] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:20:56] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 05:20:56] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:20:56] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 9/23 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-06-01 05:20:56] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/24 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/24 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/113 variables, 45/69 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 13/82 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/82 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/113 variables, 0/82 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 82 constraints, problems are : Problem set: 9 solved, 79 unsolved in 1581 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 9 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 9/14 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 10/24 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2024-06-01 05:20:57] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/25 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/25 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/113 variables, 45/70 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 13/83 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 79/162 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/162 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/162 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 162 constraints, problems are : Problem set: 9 solved, 79 unsolved in 1584 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/88 constraints, Known Traps: 11/11 constraints]
After SMT, in 3255ms problems are : Problem set: 9 solved, 79 unsolved
Search for dead transitions found 9 dead transitions in 3265ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 45/45 places, 82/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 7 ms. Remains 45 /45 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 05:20:58] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 3472 ms. Remains : 45/45 places, 82/91 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1262 ms (no deadlock found). (steps per millisecond=990 )
Random directed walk for 1250001 steps, including 0 resets, run took 957 ms (no deadlock found). (steps per millisecond=1306 )
[2024-06-01 05:21:00] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2024-06-01 05:21:00] [INFO ] Invariant cache hit.
[2024-06-01 05:21:01] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 05:21:01] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2024-06-01 05:21:01] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 05:21:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:21:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 05:21:01] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-06-01 05:21:01] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:21:01] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 05:21:01] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-06-01 05:21:01] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 05:21:01] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:21:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2024-06-01 05:21:01] [INFO ] Computed and/alt/rep : 37/219/37 causal constraints (skipped 28 transitions) in 6 ms.
[2024-06-01 05:21:01] [INFO ] Added : 21 causal constraints over 5 iterations in 44 ms. Result :sat
Parikh directed walk for 8500 steps, including 638 resets, run took 20 ms. (steps per millisecond=425 )
Random directed walk for 500000 steps, including 0 resets, run took 380 ms (no deadlock found). (steps per millisecond=1315 )
Random walk for 500000 steps, including 0 resets, run took 481 ms (no deadlock found). (steps per millisecond=1039 )
Random directed walk for 500003 steps, including 0 resets, run took 392 ms (no deadlock found). (steps per millisecond=1275 )
Random walk for 500000 steps, including 0 resets, run took 488 ms (no deadlock found). (steps per millisecond=1024 )
[2024-06-01 05:21:03] [INFO ] Flatten gal took : 33 ms
[2024-06-01 05:21:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2024-06-01 05:21:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 91 transitions and 529 arcs took 5 ms.
Total runtime 13940 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ReachabilityDeadlock

BK_STOP 1717219263343

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML
mcc2024
property name is ReachabilityDeadlock
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="SafeBus-COL-03"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 SafeBus-COL-03, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r526-tall-171679094300221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-03.tgz
mv SafeBus-COL-03 execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;