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-171654446300054.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 PhilosophersDyn-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446300054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 26K Apr 11 14:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 11 14:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 219K Apr 11 14:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 14:40 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 15K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 208K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 814K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 86K Apr 11 15:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 422K Apr 11 15:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 847K Apr 11 15:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.4M Apr 11 15:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 PhilosophersDyn-PT-10-ReachabilityCardinality-2024-00
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityCardinality-2024-01
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityCardinality-2024-02
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityCardinality-2024-03
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityCardinality-2024-04
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityCardinality-2024-05
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityCardinality-2024-06
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityCardinality-2024-07
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityCardinality-2024-08
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityCardinality-2024-09
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityCardinality-2024-10
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityCardinality-2024-11
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityCardinality-2024-12
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityCardinality-2024-13
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityCardinality-2024-14
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717247951038

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:19:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:19:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:19:14] [INFO ] Load time of PNML (sax parser for PT used): 529 ms
[2024-06-01 13:19:14] [INFO ] Transformed 170 places.
[2024-06-01 13:19:14] [INFO ] Transformed 2310 transitions.
[2024-06-01 13:19:14] [INFO ] Parsed PT model containing 170 places and 2310 transitions and 18190 arcs in 1174 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 64 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
RANDOM walk for 40000 steps (4772 resets) in 5106 ms. (7 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (26 resets) in 112 ms. (35 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (32 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (52 resets) in 82 ms. (48 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (36 resets) in 220 ms. (18 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (38 resets) in 111 ms. (35 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (27 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (27 resets) in 78 ms. (50 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (38 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (32 resets) in 113 ms. (35 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (33 resets) in 112 ms. (35 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (34 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (35 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (34 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (32 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (32 resets) in 116 ms. (34 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (39 resets) in 130 ms. (30 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 210728 steps, run timeout after 6001 ms. (steps per millisecond=35 ) properties seen :1 out of 16
Probabilistic random walk after 210728 steps, saw 54155 distinct states, run finished after 6009 ms. (steps per millisecond=35 ) properties seen :1
FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 13:19:23] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2024-06-01 13:19:23] [INFO ] Computed 39 invariants in 70 ms
[2024-06-01 13:19:23] [INFO ] State equation strengthened by 1030 read => feed constraints.
Problem PhilosophersDyn-PT-10-ReachabilityCardinality-2024-00 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PhilosophersDyn-PT-10-ReachabilityCardinality-2024-02 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem PhilosophersDyn-PT-10-ReachabilityCardinality-2024-03 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem PhilosophersDyn-PT-10-ReachabilityCardinality-2024-04 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem PhilosophersDyn-PT-10-ReachabilityCardinality-2024-05 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem PhilosophersDyn-PT-10-ReachabilityCardinality-2024-06 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem PhilosophersDyn-PT-10-ReachabilityCardinality-2024-08 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem PhilosophersDyn-PT-10-ReachabilityCardinality-2024-09 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PhilosophersDyn-PT-10-ReachabilityCardinality-2024-11 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem PhilosophersDyn-PT-10-ReachabilityCardinality-2024-12 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem PhilosophersDyn-PT-10-ReachabilityCardinality-2024-13 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem PhilosophersDyn-PT-10-ReachabilityCardinality-2024-15 is UNSAT
FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 27/27 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 12/39 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1905/2075 variables, 170/209 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2075 variables, 1030/1239 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2075 variables, 0/1239 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/2075 variables, 0/1239 constraints. Problems are: Problem set: 12 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2075/2075 variables, and 1239 constraints, problems are : Problem set: 12 solved, 3 unsolved in 1714 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 170/170 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 7/7 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 12/19 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/19 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 28/161 variables, 20/39 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/39 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1905/2066 variables, 161/200 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2066 variables, 1030/1230 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2066 variables, 0/1230 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 9/2075 variables, 9/1239 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2075 variables, 1/1240 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2075 variables, 0/1240 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2075 variables, 0/1240 constraints. Problems are: Problem set: 12 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2075/2075 variables, and 1240 constraints, problems are : Problem set: 12 solved, 3 unsolved in 4078 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 170/170 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 7087ms problems are : Problem set: 12 solved, 3 unsolved
FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3276 ms.
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 223 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
Running 2220 sub problems to find dead transitions.
[2024-06-01 13:19:33] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2024-06-01 13:19:33] [INFO ] Invariant cache hit.
[2024-06-01 13:19:33] [INFO ] State equation strengthened by 1030 read => feed constraints.
Problem TDEAD16 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2228 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 27/27 constraints. Problems are: Problem set: 134 solved, 2086 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2010 is UNSAT
Problem TDEAD2032 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2039 is UNSAT
Problem TDEAD2065 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2079 is UNSAT
Problem TDEAD2080 is UNSAT
Problem TDEAD2096 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2200 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2220 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2233 is UNSAT
Problem TDEAD2242 is UNSAT
Problem TDEAD2259 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 12/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1905/2075 variables, 170/209 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
SMT process timed out in 34631ms, After SMT, problems are : Problem set: 380 solved, 1840 unsolved
Search for dead transitions found 380 dead transitions in 34661ms
Found 380 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 207 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35129 ms. Remains : 170/170 places, 1885/2265 transitions.
RANDOM walk for 40000 steps (4758 resets) in 1128 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (339 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (399 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 184369 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 184369 steps, saw 47614 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
// Phase 1: matrix 1885 rows 170 cols
[2024-06-01 13:20:12] [INFO ] Computed 39 invariants in 47 ms
[2024-06-01 13:20:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 11 places in 335 ms of which 9 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 3 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 1 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/146 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 14/160 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1885/2045 variables, 160/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2045 variables, 1010/1216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2045 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/2055 variables, 10/1226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2055 variables, 0/1226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2055 variables, 0/1226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1226 constraints, problems are : Problem set: 0 solved, 2 unsolved in 9404 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/146 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 14/160 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1885/2045 variables, 160/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2045 variables, 1010/1216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2045 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 10/2055 variables, 10/1226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2055 variables, 0/1226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2055 variables, 0/1226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1226 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6493 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 7/7 constraints]
After SMT, in 16033ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 216 ms.
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 127 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 125 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2024-06-01 13:20:28] [INFO ] Invariant cache hit.
[2024-06-01 13:20:28] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-06-01 13:20:28] [INFO ] Invariant cache hit.
[2024-06-01 13:20:29] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-06-01 13:21:12] [INFO ] Performed 47/170 implicitness test of which 0 returned IMPLICIT in 42 seconds.
[2024-06-01 13:21:44] [INFO ] Performed 66/170 implicitness test of which 0 returned IMPLICIT in 74 seconds.
[2024-06-01 13:22:16] [INFO ] Performed 81/170 implicitness test of which 0 returned IMPLICIT in 106 seconds.
[2024-06-01 13:22:48] [INFO ] Performed 97/170 implicitness test of which 0 returned IMPLICIT in 138 seconds.
[2024-06-01 13:22:48] [INFO ] Timeout of Implicit test with SMT after 138 seconds.
[2024-06-01 13:22:48] [INFO ] Implicit Places using invariants and state equation in 139656 ms returned []
Implicit Place search using SMT with State Equation took 139875 ms to find 0 implicit places.
[2024-06-01 13:22:48] [INFO ] Redundant transitions in 120 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:22:48] [INFO ] Invariant cache hit.
[2024-06-01 13:22:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 41995ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42013ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182146 ms. Remains : 170/170 places, 1885/1885 transitions.
Attempting over-approximation, by ignoring read arcs.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 2685
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 2685
Applied a total of 20 rules in 198 ms. Remains 160 /170 variables (removed 10) and now considering 2685/1885 (removed -800) transitions.
Running SMT prover for 2 properties.
[2024-06-01 13:23:30] [INFO ] Flow matrix only has 2595 transitions (discarded 90 similar events)
// Phase 1: matrix 2595 rows 160 cols
[2024-06-01 13:23:31] [INFO ] Computed 39 invariants in 85 ms
[2024-06-01 13:23:31] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 13:23:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-06-01 13:23:31] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 17 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-06-01 13:23:32] [INFO ] After 752ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-06-01 13:23:32] [INFO ] After 910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1470 ms.
[2024-06-01 13:23:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-06-01 13:23:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 1885 transitions and 14300 arcs took 34 ms.
[2024-06-01 13:23:32] [INFO ] Flatten gal took : 425 ms
Total runtime 259428 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 : PhilosophersDyn-PT-10-ReachabilityCardinality-2024-01
Could not compute solution for formula : PhilosophersDyn-PT-10-ReachabilityCardinality-2024-07

BK_STOP 1717248213333

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 PhilosophersDyn-PT-10-ReachabilityCardinality-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/607/inv_0_
rfs formula name PhilosophersDyn-PT-10-ReachabilityCardinality-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/607/inv_1_
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="PhilosophersDyn-PT-10"
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 PhilosophersDyn-PT-10, 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-171654446300054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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