About the Execution of GreatSPN+red for PolyORBNT-PT-S10J20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16177.903 | 3600000.00 | 10408991.00 | 917.20 | TFFTFF?TFF?FFFFF | normal |
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.r289-tajo-171654446000483.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 greatspnxred
Input is PolyORBNT-PT-S10J20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654446000483
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 23K Apr 12 11:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 11:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 958K Apr 12 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:17 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 8.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Apr 12 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 12 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.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 13M 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-S10J20-LTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S10J20-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716889414264
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:43:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 09:43:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:43:36] [INFO ] Load time of PNML (sax parser for PT used): 728 ms
[2024-05-28 09:43:36] [INFO ] Transformed 474 places.
[2024-05-28 09:43:36] [INFO ] Transformed 11760 transitions.
[2024-05-28 09:43:36] [INFO ] Parsed PT model containing 474 places and 11760 transitions and 111119 arcs in 961 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 118 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1649
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1649
Applied a total of 12 rules in 144 ms. Remains 463 /474 variables (removed 11) and now considering 1649/1650 (removed 1) transitions.
Running 1638 sub problems to find dead transitions.
[2024-05-28 09:43:37] [INFO ] Flow matrix only has 1640 transitions (discarded 9 similar events)
// Phase 1: matrix 1640 rows 463 cols
[2024-05-28 09:43:37] [INFO ] Computed 62 invariants in 83 ms
[2024-05-28 09:43:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 2.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.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 4.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 4.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 (/ 2.0 3.0))
(s64 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 (/ 2.0 3.0))
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 (/ 1.0 3.0))
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 (/ 2.0 3.0))
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 4.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 (/ 1.0 3.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 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 4.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.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 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 (/ 2.0 3.0))
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 (/ 1.0 3.0))
(s285 4.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 9.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 4.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/2103 variables, and 51 constraints, problems are : Problem set: 0 solved, 1638 unsolved in 20098 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1638/638 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1638 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
Problem TDEAD230 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1644 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/453 variables, 1/52 constraints. Problems are: Problem set: 66 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/2103 variables, and 52 constraints, problems are : Problem set: 66 solved, 1572 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/638 constraints, Known Traps: 0/0 constraints]
After SMT, in 55865ms problems are : Problem set: 66 solved, 1572 unsolved
Search for dead transitions found 66 dead transitions in 55920ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-05-28 09:44:32] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
// Phase 1: matrix 1574 rows 463 cols
[2024-05-28 09:44:32] [INFO ] Computed 62 invariants in 79 ms
[2024-05-28 09:44:33] [INFO ] Implicit Places using invariants in 530 ms returned []
[2024-05-28 09:44:33] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
[2024-05-28 09:44:33] [INFO ] Invariant cache hit.
[2024-05-28 09:44:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:44:35] [INFO ] Implicit Places using invariants and state equation in 2240 ms returned []
Implicit Place search using SMT with State Equation took 2789 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1583/1650 transitions.
Applied a total of 0 rules in 17 ms. Remains 463 /463 variables (removed 0) and now considering 1583/1583 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58933 ms. Remains : 463/474 places, 1583/1650 transitions.
Support contains 118 out of 463 places after structural reductions.
[2024-05-28 09:44:36] [INFO ] Flatten gal took : 304 ms
[2024-05-28 09:44:36] [INFO ] Flatten gal took : 181 ms
[2024-05-28 09:44:37] [INFO ] Input system was already deterministic with 1583 transitions.
RANDOM walk for 40000 steps (2240 resets) in 3323 ms. (12 steps per ms) remains 20/24 properties
BEST_FIRST walk for 4004 steps (40 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (40 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (40 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (40 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (40 resets) in 40 ms. (97 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (40 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (39 resets) in 89 ms. (44 steps per ms) remains 14/20 properties
BEST_FIRST walk for 4003 steps (40 resets) in 42 ms. (93 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (40 resets) in 43 ms. (91 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (40 resets) in 47 ms. (83 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (41 resets) in 33 ms. (117 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (40 resets) in 22 ms. (174 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (39 resets) in 33 ms. (117 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (40 resets) in 40 ms. (97 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (48 resets) in 27 ms. (143 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (40 resets) in 20 ms. (190 steps per ms) remains 14/14 properties
[2024-05-28 09:44:38] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
[2024-05-28 09:44:38] [INFO ] Invariant cache hit.
[2024-05-28 09:44:38] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 348/406 variables, 44/44 constraints. Problems are: Problem set: 2 solved, 12 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 2/46 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/46 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/409 variables, 1/47 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 0/47 constraints. Problems are: Problem set: 6 solved, 8 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 6 (OVERLAPS) 54/463 variables, 15/62 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/62 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1574/2037 variables, 463/525 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2037 variables, 1/526 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2037 variables, 0/526 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2037 variables, 0/526 constraints. Problems are: Problem set: 11 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2037/2037 variables, and 526 constraints, problems are : Problem set: 11 solved, 3 unsolved in 1290 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 463/463 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 76/85 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/5 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 123/208 variables, 20/25 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/25 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 175/383 variables, 18/43 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/43 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 20/403 variables, 2/45 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 0/45 constraints. Problems are: Problem set: 11 solved, 3 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 10 (OVERLAPS) 59/462 variables, 16/61 constraints. Problems are: Problem set: 12 solved, 2 unsolved
[2024-05-28 09:44:40] [INFO ] Deduced a trap composed of 24 places in 500 ms of which 36 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 1/62 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/62 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/463 variables, 1/63 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/63 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1574/2037 variables, 463/526 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2037 variables, 1/527 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2037 variables, 2/529 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2037 variables, 0/529 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2037 variables, 0/529 constraints. Problems are: Problem set: 12 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2037/2037 variables, and 529 constraints, problems are : Problem set: 12 solved, 2 unsolved in 2835 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 463/463 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 4216ms problems are : Problem set: 12 solved, 2 unsolved
Finished Parikh walk after 34 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Parikh walk visited 2 properties in 56 ms.
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 12 atomic propositions for a total of 10 simplifications.
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 13 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1583/1583 transitions.
Applied a total of 0 rules in 18 ms. Remains 463 /463 variables (removed 0) and now considering 1583/1583 (removed 0) transitions.
Running 1572 sub problems to find dead transitions.
[2024-05-28 09:44:43] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
[2024-05-28 09:44:43] [INFO ] Invariant cache hit.
[2024-05-28 09:44:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/2037 variables, and 51 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1572/1572 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
[2024-05-28 09:45:28] [INFO ] Deduced a trap composed of 62 places in 186 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/2037 variables, and 52 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1572 constraints, Known Traps: 1/1 constraints]
After SMT, in 60499ms problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 60518ms
[2024-05-28 09:45:43] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
[2024-05-28 09:45:43] [INFO ] Invariant cache hit.
[2024-05-28 09:45:43] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-28 09:45:43] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
[2024-05-28 09:45:43] [INFO ] Invariant cache hit.
[2024-05-28 09:45:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:45:48] [INFO ] Implicit Places using invariants and state equation in 4123 ms returned []
Implicit Place search using SMT with State Equation took 4545 ms to find 0 implicit places.
Running 1572 sub problems to find dead transitions.
[2024-05-28 09:45:48] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
[2024-05-28 09:45:48] [INFO ] Invariant cache hit.
[2024-05-28 09:45:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 3 (OVERLAPS) 1/453 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 453/2037 variables, and 52 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1572/1572 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
[2024-05-28 09:46:44] [INFO ] Deduced a trap composed of 62 places in 579 ms of which 81 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 4 (OVERLAPS) 1/453 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/2037 variables, and 53 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1572 constraints, Known Traps: 1/1 constraints]
After SMT, in 80506ms problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 80521ms
Finished structural reductions in LTL mode , in 1 iterations and 145612 ms. Remains : 463/463 places, 1583/1583 transitions.
Stuttering acceptance computed with spot in 522 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLCardinality-02
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 8 ms.
FORMULA PolyORBNT-PT-S10J20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLCardinality-02 finished in 146275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 21 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 1583/1583 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 463 transition count 1558
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 438 transition count 1558
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 438 transition count 1533
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 413 transition count 1533
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 410 transition count 1530
Applied a total of 106 rules in 282 ms. Remains 410 /463 variables (removed 53) and now considering 1530/1583 (removed 53) transitions.
Running 1519 sub problems to find dead transitions.
[2024-05-28 09:47:09] [INFO ] Flow matrix only has 1521 transitions (discarded 9 similar events)
// Phase 1: matrix 1521 rows 410 cols
[2024-05-28 09:47:09] [INFO ] Computed 62 invariants in 18 ms
[2024-05-28 09:47:09] [INFO ] State equation strengthened by 1 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBNT-PT-S10J20
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 474
TRANSITIONS: 11760
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.801s, Sys 0.063s]
SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.133s, Sys 0.004s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 639
MODEL NAME: /home/mcc/execution/model
474 places, 11760 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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-S10J20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBNT-PT-S10J20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654446000483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J20.tgz
mv PolyORBNT-PT-S10J20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;