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.r512-smll-171654407200247.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 Peterson-COL-7, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407200247
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.3K Apr 12 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 03:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 03:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 04:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 47K 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

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

=== Now, execution of the tool begins

BK_START 1717268860267

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-7
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:07:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 19:07:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:07:42] [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 19:07:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 19:07:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 929 ms
[2024-06-01 19:07:43] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 31 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-7-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 19:07:43] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 6 ms.
[2024-06-01 19:07:43] [INFO ] Skeletonized 14 HLPN properties in 0 ms.
Remains 2 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 364 steps (0 resets) in 18 ms. (19 steps per ms) remains 0/2 properties
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 19:07:43] [INFO ] Flatten gal took : 37 ms
[2024-06-01 19:07:43] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Domain [Process(8), Tour(7), Process(8)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 7)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 19:07:43] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions 10032 arcs in 134 ms.
[2024-06-01 19:07:43] [INFO ] Unfolded 14 HLPN properties in 5 ms.
Deduced a syphon composed of 56 places in 27 ms
Reduce places removed 56 places and 112 transitions.
RANDOM walk for 40000 steps (8 resets) in 4876 ms. (8 steps per ms) remains 2/14 properties
FORMULA Peterson-COL-7-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-7-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-7-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-7-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-7-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-7-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-7-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-7-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-7-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-7-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-7-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-7-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-7-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 6342 ms. (6 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
[2024-06-01 19:07:47] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-06-01 19:07:47] [INFO ] Computed 31 invariants in 50 ms
[2024-06-01 19:07:47] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1880 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1880 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 112/1992 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1992 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1992 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2760/4752 variables, 1992/2023 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4752 variables, 497/2520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4752 variables, 0/2520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/4752 variables, 0/2520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4752/4752 variables, and 2520 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5054 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1992/1992 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1880 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1880 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 112/1992 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1992 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:07:58] [INFO ] Deduced a trap composed of 363 places in 2221 ms of which 168 ms to minimize.
[2024-06-01 19:08:01] [INFO ] Deduced a trap composed of 199 places in 2048 ms of which 17 ms to minimize.
SMT process timed out in 13838ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1880 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 48 Pre rules applied. Total rules applied 0 place count 1992 transition count 3048
Deduced a syphon composed of 48 places in 4 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 1944 transition count 3048
Applied a total of 96 rules in 226 ms. Remains 1944 /1992 variables (removed 48) and now considering 3048/3096 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 1944/1992 places, 3048/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 1781 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9397 ms. (4 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 389466 steps, run timeout after 9001 ms. (steps per millisecond=43 ) properties seen :1 out of 2
Probabilistic random walk after 389466 steps, saw 230314 distinct states, run finished after 9011 ms. (steps per millisecond=43 ) properties seen :1
FORMULA Peterson-COL-7-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 19:08:13] [INFO ] Flow matrix only has 2712 transitions (discarded 336 similar events)
// Phase 1: matrix 2712 rows 1944 cols
[2024-06-01 19:08:13] [INFO ] Computed 31 invariants in 20 ms
[2024-06-01 19:08:13] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1880 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1880 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/1944 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1944 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1944 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2712/4656 variables, 1944/1975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4656 variables, 497/2472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4656 variables, 0/2472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4656 variables, 0/2472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4656/4656 variables, and 2472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6869 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1944/1944 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1880 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1880 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/1944 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1944 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:08:27] [INFO ] Deduced a trap composed of 28 places in 1675 ms of which 16 ms to minimize.
[2024-06-01 19:08:30] [INFO ] Deduced a trap composed of 254 places in 2028 ms of which 17 ms to minimize.
[2024-06-01 19:08:32] [INFO ] Deduced a trap composed of 46 places in 1862 ms of which 16 ms to minimize.
[2024-06-01 19:08:34] [INFO ] Deduced a trap composed of 44 places in 1656 ms of which 15 ms to minimize.
[2024-06-01 19:08:37] [INFO ] Deduced a trap composed of 196 places in 1832 ms of which 17 ms to minimize.
[2024-06-01 19:08:39] [INFO ] Deduced a trap composed of 198 places in 1833 ms of which 16 ms to minimize.
[2024-06-01 19:08:41] [INFO ] Deduced a trap composed of 208 places in 1801 ms of which 16 ms to minimize.
[2024-06-01 19:08:42] [INFO ] Deduced a trap composed of 54 places in 1758 ms of which 18 ms to minimize.
[2024-06-01 19:08:45] [INFO ] Deduced a trap composed of 36 places in 1608 ms of which 16 ms to minimize.
[2024-06-01 19:08:50] [INFO ] Deduced a trap composed of 25 places in 1724 ms of which 14 ms to minimize.
[2024-06-01 19:08:51] [INFO ] Deduced a trap composed of 24 places in 1699 ms of which 15 ms to minimize.
[2024-06-01 19:08:53] [INFO ] Deduced a trap composed of 24 places in 1712 ms of which 15 ms to minimize.
[2024-06-01 19:08:55] [INFO ] Deduced a trap composed of 24 places in 1667 ms of which 16 ms to minimize.
[2024-06-01 19:08:57] [INFO ] Deduced a trap composed of 67 places in 1712 ms of which 15 ms to minimize.
[2024-06-01 19:08:59] [INFO ] Deduced a trap composed of 78 places in 1567 ms of which 15 ms to minimize.
[2024-06-01 19:09:01] [INFO ] Deduced a trap composed of 264 places in 1716 ms of which 16 ms to minimize.
[2024-06-01 19:09:02] [INFO ] Deduced a trap composed of 13 places in 1698 ms of which 15 ms to minimize.
[2024-06-01 19:09:04] [INFO ] Deduced a trap composed of 256 places in 1788 ms of which 15 ms to minimize.
[2024-06-01 19:09:06] [INFO ] Deduced a trap composed of 303 places in 1473 ms of which 15 ms to minimize.
[2024-06-01 19:09:08] [INFO ] Deduced a trap composed of 264 places in 1663 ms of which 15 ms to minimize.
SMT process timed out in 54552ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1880 out of 1944 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1944/1944 places, 3048/3048 transitions.
Applied a total of 0 rules in 58 ms. Remains 1944 /1944 variables (removed 0) and now considering 3048/3048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 1944/1944 places, 3048/3048 transitions.
RANDOM walk for 40000 steps (8 resets) in 832 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6603 ms. (6 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 110610 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 1
Probabilistic random walk after 110610 steps, saw 70001 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
[2024-06-01 19:09:13] [INFO ] Flow matrix only has 2712 transitions (discarded 336 similar events)
[2024-06-01 19:09:13] [INFO ] Invariant cache hit.
[2024-06-01 19:09:13] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1880 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1880 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/1944 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1944 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1944 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2712/4656 variables, 1944/1975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4656 variables, 497/2472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4656 variables, 0/2472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4656 variables, 0/2472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4656/4656 variables, and 2472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4315 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1944/1944 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1880 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1880 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/1944 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1944 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:09:23] [INFO ] Deduced a trap composed of 108 places in 1851 ms of which 16 ms to minimize.
[2024-06-01 19:09:25] [INFO ] Deduced a trap composed of 87 places in 2066 ms of which 16 ms to minimize.
[2024-06-01 19:09:27] [INFO ] Deduced a trap composed of 54 places in 1730 ms of which 15 ms to minimize.
[2024-06-01 19:09:29] [INFO ] Deduced a trap composed of 65 places in 1922 ms of which 16 ms to minimize.
[2024-06-01 19:09:35] [INFO ] Deduced a trap composed of 135 places in 1857 ms of which 16 ms to minimize.
[2024-06-01 19:09:39] [INFO ] Deduced a trap composed of 74 places in 1750 ms of which 15 ms to minimize.
[2024-06-01 19:09:41] [INFO ] Deduced a trap composed of 21 places in 1694 ms of which 13 ms to minimize.
[2024-06-01 19:09:42] [INFO ] Deduced a trap composed of 21 places in 1414 ms of which 14 ms to minimize.
[2024-06-01 19:09:44] [INFO ] Deduced a trap composed of 96 places in 1369 ms of which 14 ms to minimize.
[2024-06-01 19:09:47] [INFO ] Deduced a trap composed of 196 places in 1835 ms of which 16 ms to minimize.
[2024-06-01 19:09:49] [INFO ] Deduced a trap composed of 256 places in 1857 ms of which 16 ms to minimize.
[2024-06-01 19:09:51] [INFO ] Deduced a trap composed of 274 places in 1868 ms of which 16 ms to minimize.
[2024-06-01 19:09:53] [INFO ] Deduced a trap composed of 169 places in 1824 ms of which 19 ms to minimize.
[2024-06-01 19:09:55] [INFO ] Deduced a trap composed of 103 places in 1978 ms of which 16 ms to minimize.
[2024-06-01 19:09:57] [INFO ] Deduced a trap composed of 162 places in 1662 ms of which 16 ms to minimize.
[2024-06-01 19:09:58] [INFO ] Deduced a trap composed of 339 places in 1821 ms of which 16 ms to minimize.
[2024-06-01 19:10:01] [INFO ] Deduced a trap composed of 291 places in 1883 ms of which 16 ms to minimize.
[2024-06-01 19:10:03] [INFO ] Deduced a trap composed of 246 places in 1992 ms of which 18 ms to minimize.
[2024-06-01 19:10:05] [INFO ] Deduced a trap composed of 242 places in 1863 ms of which 16 ms to minimize.
[2024-06-01 19:10:07] [INFO ] Deduced a trap composed of 275 places in 1626 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1944 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:10:09] [INFO ] Deduced a trap composed of 354 places in 1819 ms of which 16 ms to minimize.
[2024-06-01 19:10:11] [INFO ] Deduced a trap composed of 366 places in 2062 ms of which 16 ms to minimize.
[2024-06-01 19:10:13] [INFO ] Deduced a trap composed of 227 places in 1944 ms of which 16 ms to minimize.
[2024-06-01 19:10:15] [INFO ] Deduced a trap composed of 188 places in 1846 ms of which 16 ms to minimize.
[2024-06-01 19:10:17] [INFO ] Deduced a trap composed of 32 places in 1803 ms of which 15 ms to minimize.
[2024-06-01 19:10:19] [INFO ] Deduced a trap composed of 32 places in 1797 ms of which 16 ms to minimize.
[2024-06-01 19:10:21] [INFO ] Deduced a trap composed of 135 places in 1802 ms of which 15 ms to minimize.
[2024-06-01 19:10:23] [INFO ] Deduced a trap composed of 159 places in 1862 ms of which 16 ms to minimize.
[2024-06-01 19:10:25] [INFO ] Deduced a trap composed of 189 places in 1965 ms of which 16 ms to minimize.
[2024-06-01 19:10:27] [INFO ] Deduced a trap composed of 129 places in 1982 ms of which 16 ms to minimize.
[2024-06-01 19:10:29] [INFO ] Deduced a trap composed of 15 places in 1984 ms of which 16 ms to minimize.
[2024-06-01 19:10:31] [INFO ] Deduced a trap composed of 16 places in 1949 ms of which 17 ms to minimize.
[2024-06-01 19:10:33] [INFO ] Deduced a trap composed of 213 places in 1532 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1944/4656 variables, and 64 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75008 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/1944 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 33/33 constraints]
After SMT, in 81540ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1880 out of 1944 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1944/1944 places, 3048/3048 transitions.
Applied a total of 0 rules in 49 ms. Remains 1944 /1944 variables (removed 0) and now considering 3048/3048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1944/1944 places, 3048/3048 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1944/1944 places, 3048/3048 transitions.
Applied a total of 0 rules in 45 ms. Remains 1944 /1944 variables (removed 0) and now considering 3048/3048 (removed 0) transitions.
[2024-06-01 19:10:34] [INFO ] Flow matrix only has 2712 transitions (discarded 336 similar events)
[2024-06-01 19:10:34] [INFO ] Invariant cache hit.
[2024-06-01 19:10:35] [INFO ] Implicit Places using invariants in 515 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 534 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1936/1944 places, 3048/3048 transitions.
Applied a total of 0 rules in 33 ms. Remains 1936 /1936 variables (removed 0) and now considering 3048/3048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 617 ms. Remains : 1936/1944 places, 3048/3048 transitions.
RANDOM walk for 40000 steps (8 resets) in 903 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6681 ms. (5 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 243531 steps, run timeout after 6001 ms. (steps per millisecond=40 ) properties seen :0 out of 1
Probabilistic random walk after 243531 steps, saw 147342 distinct states, run finished after 6004 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 19:10:43] [INFO ] Flow matrix only has 2712 transitions (discarded 336 similar events)
// Phase 1: matrix 2712 rows 1936 cols
[2024-06-01 19:10:43] [INFO ] Computed 23 invariants in 16 ms
[2024-06-01 19:10:43] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1880 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1880 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 56/1936 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1936 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2712/4648 variables, 1936/1959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4648 variables, 497/2456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4648 variables, 0/2456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4648 variables, 0/2456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4648/4648 variables, and 2456 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6242 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1936/1936 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1880 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1880 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 56/1936 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:10:55] [INFO ] Deduced a trap composed of 83 places in 1737 ms of which 16 ms to minimize.
[2024-06-01 19:10:57] [INFO ] Deduced a trap composed of 67 places in 1775 ms of which 16 ms to minimize.
[2024-06-01 19:11:00] [INFO ] Deduced a trap composed of 48 places in 1763 ms of which 16 ms to minimize.
[2024-06-01 19:11:02] [INFO ] Deduced a trap composed of 71 places in 1847 ms of which 16 ms to minimize.
[2024-06-01 19:11:04] [INFO ] Deduced a trap composed of 96 places in 1803 ms of which 16 ms to minimize.
[2024-06-01 19:11:06] [INFO ] Deduced a trap composed of 69 places in 1982 ms of which 16 ms to minimize.
[2024-06-01 19:11:08] [INFO ] Deduced a trap composed of 172 places in 1879 ms of which 16 ms to minimize.
[2024-06-01 19:11:10] [INFO ] Deduced a trap composed of 74 places in 1855 ms of which 15 ms to minimize.
[2024-06-01 19:11:12] [INFO ] Deduced a trap composed of 73 places in 1835 ms of which 16 ms to minimize.
[2024-06-01 19:11:14] [INFO ] Deduced a trap composed of 205 places in 1976 ms of which 15 ms to minimize.
[2024-06-01 19:11:16] [INFO ] Deduced a trap composed of 173 places in 1970 ms of which 16 ms to minimize.
[2024-06-01 19:11:19] [INFO ] Deduced a trap composed of 110 places in 1857 ms of which 15 ms to minimize.
[2024-06-01 19:11:21] [INFO ] Deduced a trap composed of 97 places in 1853 ms of which 15 ms to minimize.
[2024-06-01 19:11:22] [INFO ] Deduced a trap composed of 222 places in 1760 ms of which 16 ms to minimize.
[2024-06-01 19:11:24] [INFO ] Deduced a trap composed of 54 places in 1809 ms of which 16 ms to minimize.
[2024-06-01 19:11:29] [INFO ] Deduced a trap composed of 18 places in 1976 ms of which 16 ms to minimize.
[2024-06-01 19:11:31] [INFO ] Deduced a trap composed of 58 places in 1803 ms of which 15 ms to minimize.
[2024-06-01 19:11:35] [INFO ] Deduced a trap composed of 140 places in 1961 ms of which 15 ms to minimize.
[2024-06-01 19:11:37] [INFO ] Deduced a trap composed of 51 places in 1836 ms of which 16 ms to minimize.
[2024-06-01 19:11:39] [INFO ] Deduced a trap composed of 114 places in 1698 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1936 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:11:41] [INFO ] Deduced a trap composed of 106 places in 1812 ms of which 14 ms to minimize.
[2024-06-01 19:11:43] [INFO ] Deduced a trap composed of 80 places in 1823 ms of which 15 ms to minimize.
[2024-06-01 19:11:45] [INFO ] Deduced a trap composed of 168 places in 1717 ms of which 15 ms to minimize.
[2024-06-01 19:11:47] [INFO ] Deduced a trap composed of 114 places in 1871 ms of which 22 ms to minimize.
[2024-06-01 19:11:49] [INFO ] Deduced a trap composed of 201 places in 1811 ms of which 15 ms to minimize.
[2024-06-01 19:11:51] [INFO ] Deduced a trap composed of 198 places in 1868 ms of which 15 ms to minimize.
[2024-06-01 19:11:52] [INFO ] Deduced a trap composed of 82 places in 1556 ms of which 15 ms to minimize.
[2024-06-01 19:11:54] [INFO ] Deduced a trap composed of 168 places in 1824 ms of which 19 ms to minimize.
[2024-06-01 19:11:56] [INFO ] Deduced a trap composed of 267 places in 1591 ms of which 15 ms to minimize.
[2024-06-01 19:11:58] [INFO ] Deduced a trap composed of 141 places in 1857 ms of which 25 ms to minimize.
[2024-06-01 19:12:00] [INFO ] Deduced a trap composed of 135 places in 1764 ms of which 15 ms to minimize.
[2024-06-01 19:12:02] [INFO ] Deduced a trap composed of 130 places in 1667 ms of which 15 ms to minimize.
[2024-06-01 19:12:03] [INFO ] Deduced a trap composed of 98 places in 1828 ms of which 15 ms to minimize.
[2024-06-01 19:12:05] [INFO ] Deduced a trap composed of 162 places in 1425 ms of which 14 ms to minimize.
[2024-06-01 19:12:06] [INFO ] Deduced a trap composed of 279 places in 1426 ms of which 14 ms to minimize.
[2024-06-01 19:12:08] [INFO ] Deduced a trap composed of 135 places in 1398 ms of which 14 ms to minimize.
[2024-06-01 19:12:09] [INFO ] Deduced a trap composed of 164 places in 1422 ms of which 14 ms to minimize.
[2024-06-01 19:12:11] [INFO ] Deduced a trap composed of 196 places in 1429 ms of which 13 ms to minimize.
[2024-06-01 19:12:12] [INFO ] Deduced a trap composed of 139 places in 1431 ms of which 14 ms to minimize.
[2024-06-01 19:12:14] [INFO ] Deduced a trap composed of 186 places in 1466 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1936 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:12:18] [INFO ] Deduced a trap composed of 100 places in 1657 ms of which 16 ms to minimize.
[2024-06-01 19:12:20] [INFO ] Deduced a trap composed of 89 places in 1566 ms of which 14 ms to minimize.
[2024-06-01 19:12:22] [INFO ] Deduced a trap composed of 39 places in 1857 ms of which 16 ms to minimize.
SMT process timed out in 98624ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1880 out of 1936 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1936/1936 places, 3048/3048 transitions.
Applied a total of 0 rules in 39 ms. Remains 1936 /1936 variables (removed 0) and now considering 3048/3048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1936/1936 places, 3048/3048 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1936/1936 places, 3048/3048 transitions.
Applied a total of 0 rules in 40 ms. Remains 1936 /1936 variables (removed 0) and now considering 3048/3048 (removed 0) transitions.
[2024-06-01 19:12:22] [INFO ] Flow matrix only has 2712 transitions (discarded 336 similar events)
[2024-06-01 19:12:22] [INFO ] Invariant cache hit.
[2024-06-01 19:12:22] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-06-01 19:12:22] [INFO ] Flow matrix only has 2712 transitions (discarded 336 similar events)
[2024-06-01 19:12:22] [INFO ] Invariant cache hit.
[2024-06-01 19:12:24] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 19:12:25] [INFO ] Implicit Places using invariants and state equation in 2286 ms returned []
Implicit Place search using SMT with State Equation took 2761 ms to find 0 implicit places.
[2024-06-01 19:12:25] [INFO ] Redundant transitions in 249 ms returned []
Running 3040 sub problems to find dead transitions.
[2024-06-01 19:12:25] [INFO ] Flow matrix only has 2712 transitions (discarded 336 similar events)
[2024-06-01 19:12:25] [INFO ] Invariant cache hit.
[2024-06-01 19:12:25] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1936 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3040 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1936/4648 variables, and 23 constraints, problems are : Problem set: 0 solved, 3040 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1936 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 3040/3040 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3040 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1936 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3040 unsolved
[2024-06-01 19:13:02] [INFO ] Deduced a trap composed of 89 places in 1732 ms of which 15 ms to minimize.
[2024-06-01 19:13:04] [INFO ] Deduced a trap composed of 74 places in 1688 ms of which 15 ms to minimize.
[2024-06-01 19:13:06] [INFO ] Deduced a trap composed of 155 places in 1851 ms of which 15 ms to minimize.
[2024-06-01 19:13:07] [INFO ] Deduced a trap composed of 22 places in 1645 ms of which 16 ms to minimize.
[2024-06-01 19:13:09] [INFO ] Deduced a trap composed of 170 places in 1759 ms of which 16 ms to minimize.
[2024-06-01 19:13:11] [INFO ] Deduced a trap composed of 106 places in 1799 ms of which 16 ms to minimize.
[2024-06-01 19:13:13] [INFO ] Deduced a trap composed of 82 places in 1912 ms of which 15 ms to minimize.
[2024-06-01 19:13:15] [INFO ] Deduced a trap composed of 66 places in 1987 ms of which 16 ms to minimize.
[2024-06-01 19:13:17] [INFO ] Deduced a trap composed of 40 places in 1780 ms of which 17 ms to minimize.
[2024-06-01 19:13:19] [INFO ] Deduced a trap composed of 28 places in 1952 ms of which 15 ms to minimize.
[2024-06-01 19:13:21] [INFO ] Deduced a trap composed of 39 places in 1821 ms of which 16 ms to minimize.
[2024-06-01 19:13:22] [INFO ] Deduced a trap composed of 71 places in 1490 ms of which 17 ms to minimize.
[2024-06-01 19:13:24] [INFO ] Deduced a trap composed of 121 places in 1431 ms of which 15 ms to minimize.
[2024-06-01 19:13:25] [INFO ] Deduced a trap composed of 34 places in 1480 ms of which 15 ms to minimize.
[2024-06-01 19:13:27] [INFO ] Deduced a trap composed of 24 places in 1800 ms of which 14 ms to minimize.
SMT process timed out in 61991ms, After SMT, problems are : Problem set: 0 solved, 3040 unsolved
Search for dead transitions found 0 dead transitions in 62034ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65108 ms. Remains : 1936/1936 places, 3048/3048 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 336 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 1936 transition count 2712
Applied a total of 336 rules in 41 ms. Remains 1936 /1936 variables (removed 0) and now considering 2712/3048 (removed 336) transitions.
Running SMT prover for 1 properties.
[2024-06-01 19:13:29] [INFO ] Invariant cache hit.
[2024-06-01 19:13:29] [INFO ] [Real]Absence check using 23 positive place invariants in 27 ms returned sat
[2024-06-01 19:13:30] [INFO ] After 941ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 19:13:30] [INFO ] [Nat]Absence check using 23 positive place invariants in 27 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-06-01 19:13:32] [INFO ] After 1242ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :1
[2024-06-01 19:13:32] [INFO ] After 2119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 4846 ms.
[2024-06-01 19:13:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 27 ms.
[2024-06-01 19:13:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1936 places, 3048 transitions and 9472 arcs took 26 ms.
[2024-06-01 19:13:32] [INFO ] Flatten gal took : 336 ms
Total runtime 350852 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 : Peterson-COL-7-ReachabilityFireability-2024-00

BK_STOP 1717269213257

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name Peterson-COL-7-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/918/inv_0_
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="Peterson-COL-7"
export BK_EXAMINATION="ReachabilityFireability"
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 Peterson-COL-7, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407200247"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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