Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r276-smll-171654415800011.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ParamProductionCell-PT-1, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-171654415800011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 20:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 20:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1716810382611

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ParamProductionCell-PT-1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 11:46:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-05-27 11:46:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 11:46:25] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2024-05-27 11:46:25] [INFO ] Transformed 231 places.
[2024-05-27 11:46:25] [INFO ] Transformed 202 transitions.
[2024-05-27 11:46:25] [INFO ] Found NUPN structural information;
[2024-05-27 11:46:25] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 557 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 12 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 9 ms.20226KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 211 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 211 transition count 182
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 76 place count 193 transition count 164
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 76 rules in 229 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 261 ms. Remains : 193/231 places, 164/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2207 ms (no deadlock found). (steps per millisecond=566 )
Random directed walk for 1250000 steps, including 0 resets, run took 1618 ms (no deadlock found). (steps per millisecond=772 )
// Phase 1: matrix 164 rows 193 cols
[2024-05-27 11:46:30] [INFO ] Computed 59 invariants in 24 ms
[2024-05-27 11:46:30] [INFO ] [Real]Absence check using 35 positive place invariants in 74 ms returned sat
[2024-05-27 11:46:30] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 74 ms returned sat
[2024-05-27 11:46:31] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2024-05-27 11:46:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 11:46:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 40 ms returned sat
[2024-05-27 11:46:31] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 35 ms returned sat
[2024-05-27 11:46:32] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2024-05-27 11:46:32] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 11:46:32] [INFO ] [Nat]Added 68 Read/Feed constraints in 65 ms returned sat
[2024-05-27 11:46:32] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 14 ms to minimize.
[2024-05-27 11:46:32] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 4 ms to minimize.
[2024-05-27 11:46:32] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 4 ms to minimize.
[2024-05-27 11:46:33] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 3 ms to minimize.
[2024-05-27 11:46:33] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 3 ms to minimize.
[2024-05-27 11:46:33] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 4 ms to minimize.
[2024-05-27 11:46:33] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 3 ms to minimize.
[2024-05-27 11:46:33] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 3 ms to minimize.
[2024-05-27 11:46:34] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 4 ms to minimize.
[2024-05-27 11:46:34] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 3 ms to minimize.
[2024-05-27 11:46:34] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 3 ms to minimize.
[2024-05-27 11:46:34] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 3 ms to minimize.
[2024-05-27 11:46:34] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 3 ms to minimize.
[2024-05-27 11:46:35] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 3 ms to minimize.
[2024-05-27 11:46:35] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 3 ms to minimize.
[2024-05-27 11:46:35] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 3 ms to minimize.
[2024-05-27 11:46:35] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 3 ms to minimize.
[2024-05-27 11:46:35] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 4 ms to minimize.
[2024-05-27 11:46:35] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 3 ms to minimize.
[2024-05-27 11:46:36] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-05-27 11:46:36] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 3 ms to minimize.
[2024-05-27 11:46:36] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 3 ms to minimize.
[2024-05-27 11:46:36] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 3 ms to minimize.
[2024-05-27 11:46:36] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 3 ms to minimize.
[2024-05-27 11:46:36] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 3 ms to minimize.
[2024-05-27 11:46:36] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 2 ms to minimize.
[2024-05-27 11:46:37] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 3 ms to minimize.
[2024-05-27 11:46:37] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 3 ms to minimize.
[2024-05-27 11:46:37] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 3 ms to minimize.
[2024-05-27 11:46:37] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
[2024-05-27 11:46:37] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 4 ms to minimize.
[2024-05-27 11:46:37] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-27 11:46:38] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 3 ms to minimize.
[2024-05-27 11:46:38] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 4 ms to minimize.
[2024-05-27 11:46:38] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 9 ms to minimize.
[2024-05-27 11:46:38] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 5917 ms
[2024-05-27 11:46:38] [INFO ] Computed and/alt/rep : 156/412/156 causal constraints (skipped 7 transitions) in 27 ms.
[2024-05-27 11:46:39] [INFO ] Added : 139 causal constraints over 28 iterations in 937 ms. Result :sat
Parikh directed walk for 23400 steps, including 462 resets, run took 65 ms. (steps per millisecond=360 )
Random directed walk for 500002 steps, including 0 resets, run took 635 ms (no deadlock found). (steps per millisecond=787 )
Random walk for 500000 steps, including 0 resets, run took 716 ms (no deadlock found). (steps per millisecond=698 )
Random directed walk for 500000 steps, including 0 resets, run took 845 ms (no deadlock found). (steps per millisecond=591 )
Random walk for 500000 steps, including 0 resets, run took 691 ms (no deadlock found). (steps per millisecond=723 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 193/193 places, 164/164 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 13 ms. Remains 193 /193 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-27 11:46:42] [INFO ] Invariant cache hit.
[2024-05-27 11:46:42] [INFO ] Implicit Places using invariants in 351 ms returned [1, 2, 9, 14, 15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 71, 77, 78, 80, 92, 93, 95, 97, 98, 119, 132, 133, 135, 137, 138, 160, 162, 163, 166, 167, 172, 173, 175, 184]
[2024-05-27 11:46:42] [INFO ] Actually due to overlaps returned [78, 80, 77, 14, 35, 40, 54, 64, 92, 93, 95, 132, 133, 135, 166, 167, 175, 17, 18, 22, 28, 36, 41, 55, 65, 172, 173, 184, 97, 98, 137, 138, 162, 163]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 370 ms to find 34 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 159/193 places, 164/164 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 159 transition count 143
Reduce places removed 21 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 138 transition count 143
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 42 place count 138 transition count 137
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 54 place count 132 transition count 137
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 130 transition count 135
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 130 transition count 135
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 140 place count 89 transition count 94
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 140 rules in 28 ms. Remains 89 /159 variables (removed 70) and now considering 94/164 (removed 70) transitions.
// Phase 1: matrix 94 rows 89 cols
[2024-05-27 11:46:42] [INFO ] Computed 25 invariants in 2 ms
[2024-05-27 11:46:42] [INFO ] Implicit Places using invariants in 173 ms returned [1, 2, 9, 14, 15, 22, 23, 32, 37, 42, 61, 76]
[2024-05-27 11:46:42] [INFO ] Actually due to overlaps returned [9, 42, 61, 1, 2, 14, 15, 22, 23, 37, 76]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 177 ms to find 11 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 78/193 places, 94/164 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 73 transition count 89
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 72 transition count 88
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 12 rules in 21 ms. Remains 72 /78 variables (removed 6) and now considering 88/94 (removed 6) transitions.
// Phase 1: matrix 88 rows 72 cols
[2024-05-27 11:46:42] [INFO ] Computed 14 invariants in 1 ms
[2024-05-27 11:46:42] [INFO ] Implicit Places using invariants in 92 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 3 : 71/193 places, 88/164 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 87
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 2 rules in 14 ms. Remains 70 /71 variables (removed 1) and now considering 87/88 (removed 1) transitions.
// Phase 1: matrix 87 rows 70 cols
[2024-05-27 11:46:42] [INFO ] Computed 13 invariants in 1 ms
[2024-05-27 11:46:43] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-27 11:46:43] [INFO ] Invariant cache hit.
[2024-05-27 11:46:43] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 11:46:43] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 4 : 70/193 places, 87/164 transitions.
Finished structural reductions in DEADLOCK mode , in 4 iterations and 1053 ms. Remains : 70/193 places, 87/164 transitions.
Random walk for 1250000 steps, including 0 resets, run took 956 ms (no deadlock found). (steps per millisecond=1307 )
Random directed walk for 1250000 steps, including 0 resets, run took 874 ms (no deadlock found). (steps per millisecond=1430 )
[2024-05-27 11:46:45] [INFO ] Invariant cache hit.
[2024-05-27 11:46:45] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 11:46:45] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-27 11:46:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 11:46:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-27 11:46:45] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-27 11:46:45] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 11:46:45] [INFO ] [Nat]Added 67 Read/Feed constraints in 9 ms returned sat
[2024-05-27 11:46:45] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 2 ms to minimize.
[2024-05-27 11:46:45] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-27 11:46:45] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-27 11:46:45] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-27 11:46:45] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-27 11:46:45] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
[2024-05-27 11:46:45] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-27 11:46:45] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 2 ms to minimize.
[2024-05-27 11:46:45] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-27 11:46:45] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 2 ms to minimize.
[2024-05-27 11:46:46] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2024-05-27 11:46:46] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2024-05-27 11:46:46] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-27 11:46:46] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-27 11:46:46] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-27 11:46:46] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-27 11:46:46] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-27 11:46:46] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
[2024-05-27 11:46:46] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-27 11:46:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 11:46:46] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 5 ms to minimize.
[2024-05-27 11:46:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
[2024-05-27 11:46:46] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-27 11:46:46] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-27 11:46:46] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-27 11:46:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 25 trap constraints in 1262 ms
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION
Total runtime 21533 ms.
ITS solved all properties within timeout

BK_STOP 1716810406702

--------------------
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 ReachabilityDeadlock -timeout 180 -rebuildPNML

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="ParamProductionCell-PT-1"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ParamProductionCell-PT-1, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r276-smll-171654415800011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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