Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447300506.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 itstools
Input is PolyORBNT-PT-S10J60, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447300506
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 36K Apr 12 11:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 196K Apr 12 11:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 12 11:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.2M Apr 12 11:08 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 23K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 180K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 160K Apr 12 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 714K Apr 12 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 401K Apr 12 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 13:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K 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 7 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 PolyORBNT-PT-S10J60-CTLFireability-2024-00
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-2024-01
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-2024-02
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-2024-03
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-2024-04
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-2024-05
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-2024-06
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-2024-07
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-2024-08
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-2024-09
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-2024-10
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-2024-11
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-2024-12
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-2024-13
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-2024-14
FORMULA_NAME PolyORBNT-PT-S10J60-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716934045992

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 22:07:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 22:07:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:07:28] [INFO ] Load time of PNML (sax parser for PT used): 787 ms
[2024-05-28 22:07:28] [INFO ] Transformed 1234 places.
[2024-05-28 22:07:28] [INFO ] Transformed 12920 transitions.
[2024-05-28 22:07:28] [INFO ] Parsed PT model containing 1234 places and 12920 transitions and 116879 arcs in 1042 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 164 ms.
[2024-05-28 22:07:28] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 22:07:28] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 22:07:28] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 22:07:28] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 22:07:28] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 22:07:28] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 22:07:28] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 22:07:28] [INFO ] Reduced 9285 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 1080 out of 1234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2810
Applied a total of 10 rules in 100 ms. Remains 1224 /1234 variables (removed 10) and now considering 2810/2810 (removed 0) transitions.
Running 2799 sub problems to find dead transitions.
[2024-05-28 22:07:29] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1224 cols
[2024-05-28 22:07:29] [INFO ] Computed 142 invariants in 299 ms
[2024-05-28 22:07:29] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 4.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 (/ 3.0 4.0))
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 4.0)
(s204 0.0)
(s205 1.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1213 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2799 unsolved
SMT process timed out in 41450ms, After SMT, problems are : Problem set: 0 solved, 2799 unsolved
Search for dead transitions found 0 dead transitions in 41505ms
[2024-05-28 22:08:10] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
[2024-05-28 22:08:10] [INFO ] Invariant cache hit.
[2024-05-28 22:08:11] [INFO ] Implicit Places using invariants in 591 ms returned []
[2024-05-28 22:08:11] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
[2024-05-28 22:08:11] [INFO ] Invariant cache hit.
[2024-05-28 22:08:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:08:16] [INFO ] Implicit Places using invariants and state equation in 5588 ms returned []
Implicit Place search using SMT with State Equation took 6184 ms to find 0 implicit places.
Running 2799 sub problems to find dead transitions.
[2024-05-28 22:08:16] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
[2024-05-28 22:08:16] [INFO ] Invariant cache hit.
[2024-05-28 22:08:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1213 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2799 unsolved
SMT process timed out in 50117ms, After SMT, problems are : Problem set: 0 solved, 2799 unsolved
Search for dead transitions found 0 dead transitions in 50164ms
Starting structural reductions in LTL mode, iteration 1 : 1224/1234 places, 2810/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98028 ms. Remains : 1224/1234 places, 2810/2810 transitions.
Support contains 1080 out of 1224 places after structural reductions.
[2024-05-28 22:09:07] [INFO ] Flatten gal took : 354 ms
[2024-05-28 22:09:08] [INFO ] Flatten gal took : 274 ms
[2024-05-28 22:09:09] [INFO ] Input system was already deterministic with 2810 transitions.
RANDOM walk for 40000 steps (2241 resets) in 20477 ms. (1 steps per ms) remains 85/95 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1500 ms. (2 steps per ms) remains 84/85 properties
BEST_FIRST walk for 4004 steps (40 resets) in 233 ms. (17 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (40 resets) in 187 ms. (21 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 810 ms. (4 steps per ms) remains 81/84 properties
BEST_FIRST walk for 4003 steps (39 resets) in 171 ms. (23 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (40 resets) in 323 ms. (12 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (40 resets) in 490 ms. (8 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (39 resets) in 138 ms. (28 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (40 resets) in 209 ms. (19 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (40 resets) in 143 ms. (27 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (40 resets) in 216 ms. (18 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (39 resets) in 158 ms. (25 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (40 resets) in 147 ms. (27 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (40 resets) in 125 ms. (31 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (39 resets) in 378 ms. (10 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (40 resets) in 166 ms. (23 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (41 resets) in 153 ms. (25 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (40 resets) in 189 ms. (21 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (39 resets) in 204 ms. (19 steps per ms) remains 67/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 66/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (41 resets) in 127 ms. (31 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 65/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (40 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 64/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 63/64 properties
BEST_FIRST walk for 4004 steps (41 resets) in 85 ms. (46 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 62/63 properties
BEST_FIRST walk for 4003 steps (41 resets) in 73 ms. (54 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (10 resets) in 29 ms. (133 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 58/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (40 resets) in 39 ms. (100 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4003 steps (40 resets) in 72 ms. (54 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (40 resets) in 69 ms. (57 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (40 resets) in 54 ms. (72 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
[2024-05-28 22:09:18] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
[2024-05-28 22:09:18] [INFO ] Invariant cache hit.
[2024-05-28 22:09:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/887 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/887 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem AtomicPropp14 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 302/1189 variables, 120/122 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1189 variables, 1/123 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1189 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 46 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp94 is UNSAT
At refinement iteration 6 (OVERLAPS) 35/1224 variables, 19/142 constraints. Problems are: Problem set: 35 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1224 variables, 0/142 constraints. Problems are: Problem set: 35 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4025/4025 variables, and 1366 constraints, problems are : Problem set: 35 solved, 12 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 1224/1224 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 47/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 35 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 35 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 498/586 variables, 62/62 constraints. Problems are: Problem set: 35 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 1/63 constraints. Problems are: Problem set: 35 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/63 constraints. Problems are: Problem set: 35 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 550/1136 variables, 55/118 constraints. Problems are: Problem set: 35 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1136 variables, 0/118 constraints. Problems are: Problem set: 35 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 84/1220 variables, 20/138 constraints. Problems are: Problem set: 35 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1220 variables, 0/138 constraints. Problems are: Problem set: 35 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 4/1224 variables, 4/142 constraints. Problems are: Problem set: 35 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1224 variables, 0/142 constraints. Problems are: Problem set: 35 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 2801/4025 variables, 1224/1366 constraints. Problems are: Problem set: 35 solved, 12 unsolved
SMT process timed out in 18733ms, After SMT, problems are : Problem set: 35 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 88 out of 1224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1224/1224 places, 2810/2810 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 1224 transition count 2749
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 1163 transition count 2749
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 122 place count 1163 transition count 2686
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 248 place count 1100 transition count 2686
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 249 place count 1099 transition count 2685
Iterating global reduction 2 with 1 rules applied. Total rules applied 250 place count 1099 transition count 2685
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 254 place count 1097 transition count 2683
Applied a total of 254 rules in 645 ms. Remains 1097 /1224 variables (removed 127) and now considering 2683/2810 (removed 127) transitions.
Running 2672 sub problems to find dead transitions.
[2024-05-28 22:09:37] [INFO ] Flow matrix only has 2674 transitions (discarded 9 similar events)
// Phase 1: matrix 2674 rows 1097 cols
[2024-05-28 22:09:37] [INFO ] Computed 142 invariants in 196 ms
[2024-05-28 22:09:37] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1087 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 2672 unsolved
SMT process timed out in 41854ms, After SMT, problems are : Problem set: 0 solved, 2672 unsolved
Search for dead transitions found 0 dead transitions in 41927ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42581 ms. Remains : 1097/1224 places, 2683/2810 transitions.
RANDOM walk for 40000 steps (2687 resets) in 3386 ms. (11 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 7525 ms. (5 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (285 resets) in 454 ms. (87 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (273 resets) in 416 ms. (95 steps per ms) remains 2/3 properties
[2024-05-28 22:10:23] [INFO ] Flow matrix only has 2674 transitions (discarded 9 similar events)
[2024-05-28 22:10:23] [INFO ] Invariant cache hit.
[2024-05-28 22:10:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 855/867 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/867 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 216/1083 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1083 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/1097 variables, 10/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1097 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp61 is UNSAT
After SMT solving in domain Real declared 3771/3771 variables, and 1239 constraints, problems are : Problem set: 2 solved, 0 unsolved in 2029 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 1097/1097 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4390ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 37 atomic propositions for a total of 16 simplifications.
[2024-05-28 22:10:27] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 22:10:27] [INFO ] Flatten gal took : 226 ms
[2024-05-28 22:10:27] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBNT-PT-S10J60-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 22:10:28] [INFO ] Flatten gal took : 181 ms

BK_STOP 1716934229642

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="PolyORBNT-PT-S10J60"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBNT-PT-S10J60, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654447300506"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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