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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 8.0K Apr 12 15:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 12 15:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 15:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 15:19 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 1717219299146

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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:21:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-01 05:21:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:21:40] [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:21:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:21:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 553 ms
[2024-06-01 05:21:40] [INFO ] Detected 1 constant HL places corresponding to 10 PT places.
[2024-06-01 05:21:40] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 326 PT places and 12821.0 transition bindings in 23 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 1 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 05:21:40] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 3 ms.
[2024-06-01 05:21:40] [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(10), It(10)] of place AMC breaks symmetries in sort It
[2024-06-01 05:21:41] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 62 ms.
[2024-06-01 05:21:41] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 20 places and 20 transitions.
Built sparse matrix representations for Structural reductions in 2 ms.20671KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 306/306 places, 1631/1631 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 270 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 281 ms. Remains : 306/306 places, 1631/1631 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 306/306 places, 1631/1631 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 137 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 05:21:41] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 05:21:41] [INFO ] Computed 45 invariants in 43 ms
[2024-06-01 05:21:42] [INFO ] Implicit Places using invariants in 751 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 783 ms to find 10 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 296/306 places, 1631/1631 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1621
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1621
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 20 rules in 269 ms. Remains 286 /296 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
[2024-06-01 05:21:42] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-06-01 05:21:42] [INFO ] Computed 35 invariants in 14 ms
[2024-06-01 05:21:42] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-06-01 05:21:42] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2024-06-01 05:21:42] [INFO ] Invariant cache hit.
[2024-06-01 05:21:43] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 05:21:44] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 2085 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 286/306 places, 1621/1631 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 3280 ms. Remains : 286/306 places, 1621/1631 transitions.
Random walk for 1250000 steps, including 0 resets, run took 6280 ms (no deadlock found). (steps per millisecond=199 )
Random directed walk for 1250000 steps, including 0 resets, run took 4940 ms (no deadlock found). (steps per millisecond=253 )
[2024-06-01 05:21:55] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2024-06-01 05:21:55] [INFO ] Invariant cache hit.
[2024-06-01 05:21:56] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-06-01 05:21:56] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 254 ms returned sat
[2024-06-01 05:21:56] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2024-06-01 05:21:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:21:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-06-01 05:21:57] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 48 ms returned sat
[2024-06-01 05:21:57] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2024-06-01 05:21:57] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 05:21:57] [INFO ] [Nat]Added 111 Read/Feed constraints in 185 ms returned sat
[2024-06-01 05:21:57] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 12 ms to minimize.
[2024-06-01 05:21:57] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-06-01 05:21:57] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-06-01 05:21:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 513 ms
[2024-06-01 05:21:58] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 102 ms.
[2024-06-01 05:21:58] [INFO ] Added : 1 causal constraints over 1 iterations in 179 ms. Result :sat
Parikh directed walk for 10600 steps, including 932 resets, run took 100 ms. (steps per millisecond=106 )
Random directed walk for 500002 steps, including 0 resets, run took 1941 ms (no deadlock found). (steps per millisecond=257 )
Random walk for 500000 steps, including 0 resets, run took 2465 ms (no deadlock found). (steps per millisecond=202 )
Random directed walk for 500002 steps, including 0 resets, run took 1871 ms (no deadlock found). (steps per millisecond=267 )
Random walk for 500000 steps, including 0 resets, run took 2470 ms (no deadlock found). (steps per millisecond=202 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 286/286 places, 1621/1621 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 123 ms. Remains 286 /286 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
[2024-06-01 05:22:07] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2024-06-01 05:22:07] [INFO ] Invariant cache hit.
[2024-06-01 05:22:07] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-06-01 05:22:07] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2024-06-01 05:22:07] [INFO ] Invariant cache hit.
[2024-06-01 05:22:07] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 05:22:09] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 2028 ms to find 0 implicit places.
[2024-06-01 05:22:09] [INFO ] Redundant transitions in 102 ms returned []
Running 1611 sub problems to find dead transitions.
[2024-06-01 05:22:09] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2024-06-01 05:22:09] [INFO ] Invariant cache hit.
[2024-06-01 05:22:09] [INFO ] State equation strengthened by 111 read => feed constraints.
Problem TDEAD91 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD991 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 10 solved, 1601 unsolved
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
[2024-06-01 05:22:22] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 2 ms to minimize.
[2024-06-01 05:22:22] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-06-01 05:22:22] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-06-01 05:22:30] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 3 ms to minimize.
[2024-06-01 05:22:30] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 2 ms to minimize.
[2024-06-01 05:22:30] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 3 ms to minimize.
[2024-06-01 05:22:31] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 2 ms to minimize.
[2024-06-01 05:22:31] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 2 ms to minimize.
[2024-06-01 05:22:32] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 1 ms to minimize.
[2024-06-01 05:22:32] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 2 ms to minimize.
[2024-06-01 05:22:32] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 2 ms to minimize.
[2024-06-01 05:22:35] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 2 ms to minimize.
[2024-06-01 05:22:35] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 2 ms to minimize.
[2024-06-01 05:22:35] [INFO ] Deduced a trap composed of 49 places in 229 ms of which 2 ms to minimize.
[2024-06-01 05:22:36] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 2 ms to minimize.
[2024-06-01 05:22:36] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 1 ms to minimize.
[2024-06-01 05:22:36] [INFO ] Deduced a trap composed of 51 places in 232 ms of which 2 ms to minimize.
[2024-06-01 05:22:36] [INFO ] Deduced a trap composed of 50 places in 229 ms of which 3 ms to minimize.
[2024-06-01 05:22:37] [INFO ] Deduced a trap composed of 49 places in 236 ms of which 2 ms to minimize.
[2024-06-01 05:22:37] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/918 variables, and 55 constraints, problems are : Problem set: 100 solved, 1511 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1611/1611 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
[2024-06-01 05:22:53] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 2 ms to minimize.
[2024-06-01 05:22:53] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 2 ms to minimize.
[2024-06-01 05:22:54] [INFO ] Deduced a trap composed of 30 places in 239 ms of which 2 ms to minimize.
[2024-06-01 05:22:55] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 2 ms to minimize.
[2024-06-01 05:22:55] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 2 ms to minimize.
[2024-06-01 05:22:55] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 2 ms to minimize.
[2024-06-01 05:22:56] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 2 ms to minimize.
[2024-06-01 05:22:56] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 2 ms to minimize.
[2024-06-01 05:22:56] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 2 ms to minimize.
[2024-06-01 05:22:56] [INFO ] Deduced a trap composed of 57 places in 219 ms of which 1 ms to minimize.
[2024-06-01 05:22:59] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 2 ms to minimize.
[2024-06-01 05:22:59] [INFO ] Deduced a trap composed of 46 places in 207 ms of which 2 ms to minimize.
[2024-06-01 05:22:59] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 2 ms to minimize.
[2024-06-01 05:23:00] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 2 ms to minimize.
[2024-06-01 05:23:00] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 2 ms to minimize.
[2024-06-01 05:23:00] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 1 ms to minimize.
[2024-06-01 05:23:00] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 1 ms to minimize.
[2024-06-01 05:23:01] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 2 ms to minimize.
[2024-06-01 05:23:01] [INFO ] Deduced a trap composed of 90 places in 241 ms of which 3 ms to minimize.
[2024-06-01 05:23:01] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/75 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
[2024-06-01 05:23:12] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 76 constraints, problems are : Problem set: 100 solved, 1511 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1611 constraints, Known Traps: 41/41 constraints]
After SMT, in 64503ms problems are : Problem set: 100 solved, 1511 unsolved
Search for dead transitions found 100 dead transitions in 64535ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 286/286 places, 1521/1621 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 88 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-06-01 05:23:13] [INFO ] Redundant transitions in 27 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 66948 ms. Remains : 286/286 places, 1521/1621 transitions.
Random walk for 1250000 steps, including 0 resets, run took 5816 ms (no deadlock found). (steps per millisecond=214 )
Random directed walk for 1250008 steps, including 0 resets, run took 4374 ms (no deadlock found). (steps per millisecond=285 )
[2024-06-01 05:23:24] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 05:23:24] [INFO ] Invariant cache hit.
[2024-06-01 05:23:24] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-06-01 05:23:24] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 103 ms returned sat
[2024-06-01 05:23:25] [INFO ] [Real]Absence check using state equation in 874 ms returned sat
[2024-06-01 05:23:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:23:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-06-01 05:23:25] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 33 ms returned sat
[2024-06-01 05:23:25] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2024-06-01 05:23:25] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 05:23:25] [INFO ] [Nat]Added 111 Read/Feed constraints in 89 ms returned sat
[2024-06-01 05:23:26] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-06-01 05:23:26] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-06-01 05:23:26] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-06-01 05:23:26] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-06-01 05:23:27] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-06-01 05:23:27] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-06-01 05:23:27] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-06-01 05:23:27] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-06-01 05:23:27] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-06-01 05:23:27] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1581 ms
[2024-06-01 05:23:27] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 67 ms.
[2024-06-01 05:23:27] [INFO ] Added : 4 causal constraints over 3 iterations in 215 ms. Result :sat
Parikh directed walk for 21500 steps, including 1000 resets, run took 131 ms. (steps per millisecond=164 )
Random directed walk for 500001 steps, including 0 resets, run took 1747 ms (no deadlock found). (steps per millisecond=286 )
Random walk for 500000 steps, including 0 resets, run took 2321 ms (no deadlock found). (steps per millisecond=215 )
Random directed walk for 500000 steps, including 0 resets, run took 1735 ms (no deadlock found). (steps per millisecond=288 )
Random walk for 500000 steps, including 0 resets, run took 2323 ms (no deadlock found). (steps per millisecond=215 )
[2024-06-01 05:23:36] [INFO ] Flatten gal took : 215 ms
[2024-06-01 05:23:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 6 ms.
[2024-06-01 05:23:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 1631 transitions and 11204 arcs took 14 ms.
Total runtime 116129 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 1717219416632

--------------------
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-10"
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-10, 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-171679094300231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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