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.r299-tajo-171654455500059.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 PolyORBLF-COL-S02J04T10, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tajo-171654455500059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1717141308438

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-COL-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
Liveness COL
Running Version 202405141337
[2024-05-31 07:41:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-31 07:41:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 07:41:49] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 07:41:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 07:41:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 996 ms
[2024-05-31 07:41:51] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 45 ms.
[2024-05-31 07:41:51] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 7 ms.
[2024-05-31 07:41:51] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-31 07:41:51] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 70 ms.
[2024-05-31 07:41:51] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-31 07:41:51] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 16 ms.
[2024-05-31 07:41:51] [INFO ] Unfolded 65 HLPN properties in 2 ms.
[2024-05-31 07:41:51] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-31 07:41:51] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-31 07:41:51] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-31 07:41:51] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 1 ms.
[2024-05-31 07:41:51] [INFO ] Skeletonized 65 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-31 07:41:51] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 23 ms.
[2024-05-31 07:41:51] [INFO ] Unfolded 65 HLPN properties in 0 ms.
[2024-05-31 07:41:51] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-31 07:41:51] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-31 07:41:51] [INFO ] Reduced 110 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.28119KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 84 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-31 07:41:51] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-05-31 07:41:51] [INFO ] Computed 54 invariants in 158 ms
[2024-05-31 07:41:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-31 07:42:11] [INFO ] Deduced a trap composed of 65 places in 360 ms of which 46 ms to minimize.
[2024-05-31 07:42:11] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 3 ms to minimize.
[2024-05-31 07:42:11] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-05-31 07:42:11] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-05-31 07:42:11] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 1 ms to minimize.
[2024-05-31 07:42:11] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-31 07:42:11] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-05-31 07:42:11] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-05-31 07:42:12] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2024-05-31 07:42:12] [INFO ] Deduced a trap composed of 373 places in 315 ms of which 5 ms to minimize.
[2024-05-31 07:42:13] [INFO ] Deduced a trap composed of 381 places in 367 ms of which 10 ms to minimize.
[2024-05-31 07:42:13] [INFO ] Deduced a trap composed of 237 places in 291 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2144 variables, and 62 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20141 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-31 07:42:16] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-31 07:42:17] [INFO ] Deduced a trap composed of 360 places in 439 ms of which 6 ms to minimize.
[2024-05-31 07:42:30] [INFO ] Deduced a trap composed of 23 places in 260 ms of which 3 ms to minimize.
[2024-05-31 07:42:31] [INFO ] Deduced a trap composed of 420 places in 650 ms of which 17 ms to minimize.
[2024-05-31 07:42:32] [INFO ] Deduced a trap composed of 512 places in 394 ms of which 5 ms to minimize.
[2024-05-31 07:42:32] [INFO ] Deduced a trap composed of 482 places in 440 ms of which 5 ms to minimize.
[2024-05-31 07:42:33] [INFO ] Deduced a trap composed of 511 places in 564 ms of which 18 ms to minimize.
[2024-05-31 07:42:33] [INFO ] Deduced a trap composed of 492 places in 476 ms of which 5 ms to minimize.
[2024-05-31 07:42:33] [INFO ] Deduced a trap composed of 514 places in 379 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/2144 variables, and 71 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 21/21 constraints]
After SMT, in 42940ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 42994ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 43173 ms. Remains : 752/752 places, 1412/1412 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 37 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
[2024-05-31 07:42:34] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-31 07:42:34] [INFO ] Invariant cache hit.
[2024-05-31 07:42:34] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-31 07:42:34] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-31 07:42:34] [INFO ] Invariant cache hit.
[2024-05-31 07:42:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 07:42:35] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2024-05-31 07:42:35] [INFO ] Redundant transitions in 80 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-05-31 07:42:35] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-31 07:42:35] [INFO ] Invariant cache hit.
[2024-05-31 07:42:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-31 07:42:55] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-05-31 07:43:01] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 4 ms to minimize.
[2024-05-31 07:43:01] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 3 ms to minimize.
[2024-05-31 07:43:01] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 2 ms to minimize.
[2024-05-31 07:43:01] [INFO ] Deduced a trap composed of 66 places in 181 ms of which 2 ms to minimize.
[2024-05-31 07:43:01] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 3 ms to minimize.
[2024-05-31 07:43:02] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-31 07:43:02] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-05-31 07:43:02] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 0 ms to minimize.
[2024-05-31 07:43:02] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-05-31 07:43:02] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 0 ms to minimize.
[2024-05-31 07:43:05] [INFO ] Deduced a trap composed of 432 places in 373 ms of which 6 ms to minimize.
[2024-05-31 07:43:05] [INFO ] Deduced a trap composed of 397 places in 345 ms of which 4 ms to minimize.
[2024-05-31 07:43:06] [INFO ] Deduced a trap composed of 369 places in 310 ms of which 5 ms to minimize.
[2024-05-31 07:43:06] [INFO ] Deduced a trap composed of 384 places in 339 ms of which 4 ms to minimize.
[2024-05-31 07:43:06] [INFO ] Deduced a trap composed of 424 places in 295 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.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 0.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 0.0)
(s56 0.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 0.0)
(s67 0.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 0.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 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 0.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 0.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 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 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2144 variables, and 66 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-31 07:43:14] [INFO ] Deduced a trap composed of 205 places in 445 ms of which 19 ms to minimize.
[2024-05-31 07:43:14] [INFO ] Deduced a trap composed of 246 places in 353 ms of which 5 ms to minimize.
[2024-05-31 07:43:15] [INFO ] Deduced a trap composed of 381 places in 560 ms of which 21 ms to minimize.
[2024-05-31 07:43:15] [INFO ] Deduced a trap composed of 451 places in 340 ms of which 4 ms to minimize.
[2024-05-31 07:43:16] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 3 ms to minimize.
[2024-05-31 07:43:25] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 4 ms to minimize.
[2024-05-31 07:43:27] [INFO ] Deduced a trap composed of 415 places in 333 ms of which 5 ms to minimize.
[2024-05-31 07:43:35] [INFO ] Deduced a trap composed of 402 places in 321 ms of which 5 ms to minimize.
[2024-05-31 07:43:36] [INFO ] Deduced a trap composed of 377 places in 382 ms of which 5 ms to minimize.
[2024-05-31 07:43:37] [INFO ] Deduced a trap composed of 402 places in 363 ms of which 6 ms to minimize.
[2024-05-31 07:43:37] [INFO ] Deduced a trap composed of 369 places in 350 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/2144 variables, and 77 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 27/27 constraints]
After SMT, in 62740ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 62757ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 63947 ms. Remains : 752/752 places, 1412/1412 transitions.
Finished random walk after 4906 steps, including 0 resets, run found a deadlock after 29 ms. (steps per millisecond=169 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 108638 ms.

BK_STOP 1717141418600

--------------------
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
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J04T10"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 PolyORBLF-COL-S02J04T10, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r299-tajo-171654455500059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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