Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446900358.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S06J06T08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446900358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 25K Apr 11 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 11 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 249K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Apr 11 17:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 268K Apr 11 17:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 265K Apr 11 17:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 11 17:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.6K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717256588729

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:43:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:43:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:43:10] [INFO ] Load time of PNML (sax parser for PT used): 702 ms
[2024-06-01 15:43:10] [INFO ] Transformed 894 places.
[2024-06-01 15:43:11] [INFO ] Transformed 14334 transitions.
[2024-06-01 15:43:11] [INFO ] Parsed PT model containing 894 places and 14334 transitions and 119772 arcs in 961 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
RANDOM walk for 40000 steps (239 resets) in 3055 ms. (13 steps per ms) remains 12/16 properties
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (90 resets) in 909 ms. (43 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (93 resets) in 382 ms. (104 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (93 resets) in 331 ms. (120 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 998 ms. (40 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (50 resets) in 960 ms. (41 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (92 resets) in 273 ms. (146 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (90 resets) in 289 ms. (137 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (78 resets) in 339 ms. (117 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (89 resets) in 227 ms. (175 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (97 resets) in 256 ms. (155 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (105 resets) in 276 ms. (144 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (105 resets) in 368 ms. (108 steps per ms) remains 12/12 properties
[2024-06-01 15:43:14] [INFO ] Flow matrix only has 3526 transitions (discarded 48 similar events)
// Phase 1: matrix 3526 rows 894 cols
[2024-06-01 15:43:14] [INFO ] Computed 62 invariants in 194 ms
[2024-06-01 15:43:14] [INFO ] State equation strengthened by 224 read => feed constraints.
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-04 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-05 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-09 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 16/16 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-00 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-01 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/784 variables, 19/35 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/784 variables, 0/35 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 13/797 variables, 3/38 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/797 variables, 0/38 constraints. Problems are: Problem set: 5 solved, 7 unsolved
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-03 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-11 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-12 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-13 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-14 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 97/894 variables, 24/62 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/894 variables, 0/62 constraints. Problems are: Problem set: 10 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4420/4420 variables, and 956 constraints, problems are : Problem set: 10 solved, 2 unsolved in 5080 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 894/894 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 9/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 2 unsolved
Problem PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-08 is UNSAT
FORMULA PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 297/357 variables, 15/15 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/15 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/364 variables, 2/17 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/17 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 519/883 variables, 37/54 constraints. Problems are: Problem set: 11 solved, 1 unsolved
[2024-06-01 15:43:20] [INFO ] Deduced a trap composed of 93 places in 384 ms of which 34 ms to minimize.
[2024-06-01 15:43:20] [INFO ] Deduced a trap composed of 94 places in 266 ms of which 3 ms to minimize.
[2024-06-01 15:43:21] [INFO ] Deduced a trap composed of 93 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:43:21] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 1 ms to minimize.
[2024-06-01 15:43:21] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 5/59 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 0/59 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/885 variables, 2/61 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/885 variables, 0/61 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/894 variables, 6/67 constraints. Problems are: Problem set: 11 solved, 1 unsolved
[2024-06-01 15:43:21] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/894 variables, 1/68 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/894 variables, 0/68 constraints. Problems are: Problem set: 11 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4420/4420 variables, and 962 constraints, problems are : Problem set: 11 solved, 1 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 894/894 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 6/6 constraints]
After SMT, in 10817ms problems are : Problem set: 11 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 894 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 894/894 places, 3574/3574 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 888 transition count 3514
Reduce places removed 60 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 828 transition count 3509
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 136 place count 823 transition count 3509
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 136 place count 823 transition count 3414
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 326 place count 728 transition count 3414
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 5 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 490 place count 646 transition count 3332
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 504 place count 646 transition count 3318
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 518 place count 632 transition count 3318
Applied a total of 518 rules in 894 ms. Remains 632 /894 variables (removed 262) and now considering 3318/3574 (removed 256) transitions.
Running 3312 sub problems to find dead transitions.
[2024-06-01 15:43:25] [INFO ] Flow matrix only has 3270 transitions (discarded 48 similar events)
// Phase 1: matrix 3270 rows 632 cols
[2024-06-01 15:43:26] [INFO ] Computed 56 invariants in 101 ms
[2024-06-01 15:43:26] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 1.0)
(s193 0.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 0.0)
(s216 10.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 7.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 1.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 10.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 1.0)
(s325 0.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 0.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 2.0)
(s365 0.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 0.0)
(s382 1.0)
(s383 timeout
0.0)
(s384 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3312 unsolved
SMT process timed out in 49059ms, After SMT, problems are : Problem set: 0 solved, 3312 unsolved
Search for dead transitions found 0 dead transitions in 49102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50031 ms. Remains : 632/894 places, 3318/3574 transitions.
RANDOM walk for 40000 steps (344 resets) in 1086 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (112 resets) in 738 ms. (54 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 65827 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 1
Probabilistic random walk after 65827 steps, saw 24993 distinct states, run finished after 3005 ms. (steps per millisecond=21 ) properties seen :0
[2024-06-01 15:44:18] [INFO ] Flow matrix only has 3270 transitions (discarded 48 similar events)
[2024-06-01 15:44:18] [INFO ] Invariant cache hit.
[2024-06-01 15:44:18] [INFO ] State equation strengthened by 224 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 246/303 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/310 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 311/621 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/624 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/624 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/632 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/632 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3902/3902 variables, and 688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45030 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 632/632 constraints, ReadFeed: 0/224 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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 246/303 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/310 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 311/621 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:45:04] [INFO ] Deduced a trap composed of 62 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:45:04] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 1 ms to minimize.
[2024-06-01 15:45:04] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 1 ms to minimize.
[2024-06-01 15:45:04] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/621 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/624 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/624 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/632 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:45:04] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/632 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/632 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3902/3902 variables, and 693 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10559 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 632/632 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints]
After SMT, in 55649ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 3318/3318 transitions.
Applied a total of 0 rules in 163 ms. Remains 632 /632 variables (removed 0) and now considering 3318/3318 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 632/632 places, 3318/3318 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 3318/3318 transitions.
Applied a total of 0 rules in 104 ms. Remains 632 /632 variables (removed 0) and now considering 3318/3318 (removed 0) transitions.
[2024-06-01 15:45:14] [INFO ] Flow matrix only has 3270 transitions (discarded 48 similar events)
[2024-06-01 15:45:14] [INFO ] Invariant cache hit.
[2024-06-01 15:45:15] [INFO ] Implicit Places using invariants in 1343 ms returned [6, 9, 172, 260, 282, 389, 427, 530]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1381 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 624/632 places, 3318/3318 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 3317
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 3317
Applied a total of 2 rules in 125 ms. Remains 623 /624 variables (removed 1) and now considering 3317/3318 (removed 1) transitions.
[2024-06-01 15:45:16] [INFO ] Flow matrix only has 3269 transitions (discarded 48 similar events)
// Phase 1: matrix 3269 rows 623 cols
[2024-06-01 15:45:16] [INFO ] Computed 48 invariants in 58 ms
[2024-06-01 15:45:17] [INFO ] Implicit Places using invariants in 1480 ms returned []
[2024-06-01 15:45:17] [INFO ] Flow matrix only has 3269 transitions (discarded 48 similar events)
[2024-06-01 15:45:17] [INFO ] Invariant cache hit.
[2024-06-01 15:45:19] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-06-01 15:45:50] [INFO ] Performed 521/623 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:45:57] [INFO ] Implicit Places using invariants and state equation in 40040 ms returned []
Implicit Place search using SMT with State Equation took 41530 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 623/632 places, 3317/3318 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 43154 ms. Remains : 623/632 places, 3317/3318 transitions.
RANDOM walk for 40001 steps (369 resets) in 1481 ms. (26 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (128 resets) in 512 ms. (77 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 71920 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 71920 steps, saw 26682 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-06-01 15:46:01] [INFO ] Flow matrix only has 3269 transitions (discarded 48 similar events)
[2024-06-01 15:46:01] [INFO ] Invariant cache hit.
[2024-06-01 15:46:01] [INFO ] State equation strengthened by 224 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 324/381 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/385 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 231/616 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/616 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/617 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/617 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/623 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/623 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3892/3892 variables, and 671 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75040 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 623/623 constraints, ReadFeed: 0/224 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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 324/381 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/385 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 231/616 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:47:16] [INFO ] Deduced a trap composed of 61 places in 243 ms of which 2 ms to minimize.
[2024-06-01 15:47:16] [INFO ] Deduced a trap composed of 60 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:47:17] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:47:17] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/616 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/617 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/617 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/623 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/623 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3892/3892 variables, and 675 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16562 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 623/623 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 4/4 constraints]
After SMT, in 91669ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 3317/3317 transitions.
Applied a total of 0 rules in 127 ms. Remains 623 /623 variables (removed 0) and now considering 3317/3317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 623/623 places, 3317/3317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 3317/3317 transitions.
Applied a total of 0 rules in 95 ms. Remains 623 /623 variables (removed 0) and now considering 3317/3317 (removed 0) transitions.
[2024-06-01 15:47:33] [INFO ] Flow matrix only has 3269 transitions (discarded 48 similar events)
[2024-06-01 15:47:33] [INFO ] Invariant cache hit.
[2024-06-01 15:47:34] [INFO ] Implicit Places using invariants in 962 ms returned []
[2024-06-01 15:47:34] [INFO ] Flow matrix only has 3269 transitions (discarded 48 similar events)
[2024-06-01 15:47:34] [INFO ] Invariant cache hit.
[2024-06-01 15:47:36] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-06-01 15:48:07] [INFO ] Performed 546/623 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:48:12] [INFO ] Implicit Places using invariants and state equation in 38904 ms returned []
Implicit Place search using SMT with State Equation took 39869 ms to find 0 implicit places.
[2024-06-01 15:48:13] [INFO ] Redundant transitions in 232 ms returned []
Running 3311 sub problems to find dead transitions.
[2024-06-01 15:48:13] [INFO ] Flow matrix only has 3269 transitions (discarded 48 similar events)
[2024-06-01 15:48:13] [INFO ] Invariant cache hit.
[2024-06-01 15:48:13] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 3311 unsolved
[2024-06-01 15:49:07] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/3892 variables, and 38 constraints, problems are : Problem set: 0 solved, 3311 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/623 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 3311/1511 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 3311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 3311 unsolved
[2024-06-01 15:49:16] [INFO ] Deduced a trap composed of 35 places in 676 ms of which 4 ms to minimize.
[2024-06-01 15:49:16] [INFO ] Deduced a trap composed of 62 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:49:16] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:49:16] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:49:16] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 1 ms to minimize.
[2024-06-01 15:49:17] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:49:17] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 2 ms to minimize.
[2024-06-01 15:49:19] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 0 ms to minimize.
[2024-06-01 15:49:19] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:49:20] [INFO ] Deduced a trap composed of 38 places in 304 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/3892 variables, and 48 constraints, problems are : Problem set: 0 solved, 3311 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/623 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1800/1511 constraints, Known Traps: 11/11 constraints]
After SMT, in 88804ms problems are : Problem set: 0 solved, 3311 unsolved
Search for dead transitions found 0 dead transitions in 88835ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129048 ms. Remains : 623/623 places, 3317/3317 transitions.
[2024-06-01 15:49:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-06-01 15:49:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 623 places, 3317 transitions and 22385 arcs took 58 ms.
[2024-06-01 15:49:42] [INFO ] Flatten gal took : 554 ms
Total runtime 392816 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 : PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-15

BK_STOP 1717256983390

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name PolyORBLF-PT-S06J06T08-ReachabilityCardinality-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/669/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="PolyORBLF-PT-S06J06T08"
export BK_EXAMINATION="ReachabilityCardinality"
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 PolyORBLF-PT-S06J06T08, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446900358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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