Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r147-tall-162089138000251.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ParamProductionCell-PT-5, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-162089138000251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 25K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 158K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 07:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 174K May 5 16:51 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 1620948031114

Running Version 0
[2021-05-13 23:20:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2021-05-13 23:20:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:20:32] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2021-05-13 23:20:32] [INFO ] Transformed 231 places.
[2021-05-13 23:20:32] [INFO ] Transformed 202 transitions.
[2021-05-13 23:20:32] [INFO ] Found NUPN structural information;
[2021-05-13 23:20:32] [INFO ] Parsed PT model containing 231 places and 202 transitions in 104 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 5 ms.15792KB memory used
Starting structural reductions, iteration 0 : 231/231 places, 202/202 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 1 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
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
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
Applied a total of 76 rules in 70 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
Finished structural reductions, in 1 iterations. Remains : 193/231 places, 164/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2923 ms (no deadlock found). (steps per millisecond=427 )
Random directed walk for 1250001 steps, including 0 resets, run took 1943 ms (no deadlock found). (steps per millisecond=643 )
// Phase 1: matrix 164 rows 193 cols
[2021-05-13 23:20:37] [INFO ] Computed 59 place invariants in 12 ms
[2021-05-13 23:20:38] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-13 23:20:38] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 21 ms returned sat
[2021-05-13 23:20:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:20:38] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2021-05-13 23:20:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:20:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2021-05-13 23:20:38] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 31 ms returned sat
[2021-05-13 23:20:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:20:38] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2021-05-13 23:20:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-13 23:20:38] [INFO ] [Nat]Added 68 Read/Feed constraints in 20 ms returned sat
[2021-05-13 23:20:38] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2021-05-13 23:20:38] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2021-05-13 23:20:39] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2021-05-13 23:20:40] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2021-05-13 23:20:40] [INFO ] Deduced a trap composed of 29 places in 19 ms of which 0 ms to minimize.
[2021-05-13 23:20:40] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2021-05-13 23:20:40] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2021-05-13 23:20:40] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1408 ms
[2021-05-13 23:20:40] [INFO ] Computed and/alt/rep : 154/412/154 causal constraints (skipped 7 transitions) in 9 ms.
[2021-05-13 23:20:40] [INFO ] Added : 151 causal constraints over 31 iterations in 516 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
Parikh directed walk for 41900 steps, including 291 resets, run took 167 ms. (steps per millisecond=250 )
Random directed walk for 500000 steps, including 0 resets, run took 750 ms (no deadlock found). (steps per millisecond=666 )
Random walk for 500000 steps, including 0 resets, run took 1141 ms (no deadlock found). (steps per millisecond=438 )
Random directed walk for 500002 steps, including 0 resets, run took 741 ms (no deadlock found). (steps per millisecond=674 )
Random walk for 500000 steps, including 0 resets, run took 1123 ms (no deadlock found). (steps per millisecond=445 )
Starting structural reductions, iteration 0 : 193/193 places, 164/164 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 164/164 (removed 0) transitions.
// Phase 1: matrix 164 rows 193 cols
[2021-05-13 23:20:44] [INFO ] Computed 59 place invariants in 4 ms
[2021-05-13 23:20:44] [INFO ] Implicit Places using invariants in 171 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 92, 93, 95, 97, 98, 132, 133, 135, 137, 138, 162, 163, 166, 167, 172, 173, 175, 184]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 173 ms to find 39 implicit places.
[2021-05-13 23:20:44] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 164 rows 154 cols
[2021-05-13 23:20:44] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-13 23:20:44] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Starting structural reductions, iteration 1 : 154/193 places, 164/164 transitions.
Drop transitions 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 154 transition count 143
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 133 transition count 143
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 133 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 127 transition count 137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 125 transition count 135
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 125 transition count 135
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 136 place count 86 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 84 transition count 94
Applied a total of 140 rules in 21 ms. Remains 84 /154 variables (removed 70) and now considering 94/164 (removed 70) transitions.
// Phase 1: matrix 94 rows 84 cols
[2021-05-13 23:20:44] [INFO ] Computed 20 place invariants in 4 ms
[2021-05-13 23:20:44] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2021-05-13 23:20:44] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-13 23:20:45] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-13 23:20:45] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 84/193 places, 94/164 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2210 ms (no deadlock found). (steps per millisecond=565 )
Random directed walk for 1250000 steps, including 0 resets, run took 1394 ms (no deadlock found). (steps per millisecond=896 )
// Phase 1: matrix 94 rows 84 cols
[2021-05-13 23:20:48] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-13 23:20:48] [INFO ] [Real]Absence check using 18 positive place invariants in 4 ms returned sat
[2021-05-13 23:20:48] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-13 23:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:20:48] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2021-05-13 23:20:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:20:48] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2021-05-13 23:20:48] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-13 23:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:20:48] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2021-05-13 23:20:48] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-13 23:20:48] [INFO ] [Nat]Added 66 Read/Feed constraints in 7 ms returned sat
[2021-05-13 23:20:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2021-05-13 23:20:48] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2021-05-13 23:20:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2021-05-13 23:20:48] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2021-05-13 23:20:48] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2021-05-13 23:20:48] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2021-05-13 23:20:48] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2021-05-13 23:20:49] [INFO ] Deduced a trap composed of 11 places in 13 ms of which 1 ms to minimize.
[2021-05-13 23:20:49] [INFO ] Deduced a trap composed of 23 places in 13 ms of which 0 ms to minimize.
[2021-05-13 23:20:49] [INFO ] Deduced a trap composed of 14 places in 14 ms of which 0 ms to minimize.
[2021-05-13 23:20:49] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 4 ms to minimize.
[2021-05-13 23:20:49] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2021-05-13 23:20:49] [INFO ] Deduced a trap composed of 13 places in 14 ms of which 0 ms to minimize.
[2021-05-13 23:20:49] [INFO ] Deduced a trap composed of 26 places in 15 ms of which 0 ms to minimize.
[2021-05-13 23:20:49] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-13 23:20:49] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2021-05-13 23:20:49] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2021-05-13 23:20:49] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2021-05-13 23:20:49] [INFO ] Deduced a trap composed of 13 places in 15 ms of which 0 ms to minimize.
[2021-05-13 23:20:49] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 465 ms
[2021-05-13 23:20:49] [INFO ] Computed and/alt/rep : 91/215/91 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-13 23:20:49] [INFO ] Added : 89 causal constraints over 18 iterations in 149 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
Parikh directed walk for 16900 steps, including 280 resets, run took 46 ms. (steps per millisecond=367 )
Random directed walk for 500001 steps, including 0 resets, run took 551 ms (no deadlock found). (steps per millisecond=907 )
Random walk for 500000 steps, including 0 resets, run took 876 ms (no deadlock found). (steps per millisecond=570 )
Random directed walk for 500002 steps, including 0 resets, run took 569 ms (no deadlock found). (steps per millisecond=878 )
Random walk for 500000 steps, including 0 resets, run took 884 ms (no deadlock found). (steps per millisecond=565 )
[2021-05-13 23:20:52] [INFO ] Flatten gal took : 70 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4515076294593678693
[2021-05-13 23:20:52] [INFO ] Applying decomposition
[2021-05-13 23:20:52] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2021-05-13 23:20:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 23:20:52] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2021-05-13 23:20:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 23:20:52] [INFO ] Flatten gal took : 34 ms
[2021-05-13 23:20:52] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2021-05-13 23:20:52] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 23:20:52] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4515076294593678693
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4515076294593678693]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7467233071671391132.txt, -o, /tmp/graph7467233071671391132.bin, -w, /tmp/graph7467233071671391132.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7467233071671391132.bin, -l, -1, -v, -w, /tmp/graph7467233071671391132.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:20:52] [INFO ] Decomposing Gal with order
[2021-05-13 23:20:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:20:52] [INFO ] Removed a total of 86 redundant transitions.
[2021-05-13 23:20:52] [INFO ] Flatten gal took : 86 ms
[2021-05-13 23:20:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-13 23:20:52] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock7000862793338341435.gal : 8 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityDeadlock7000862793338341435.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityDeadlock7000862793338341435.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65724e+06,0.32003,16884,1753,57,28578,485,662,31615,62,1240,0


Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,0,0.453241,16884,1,0,28578,485,1799,45242,222,1240,33723

System contains 0 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 0 ]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620948054410

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-5"
export BK_EXAMINATION="ReachabilityDeadlock"
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-4028"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-5, 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 r147-tall-162089138000251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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