About the Execution of Smart+red for ResAllocation-PT-R020C002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
632.792 | 14392.00 | 21339.00 | 538.30 | FTTTFTFTTTTFTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r331-tall-167889204900758.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ResAllocation-PT-R020C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r331-tall-167889204900758
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.5K Feb 25 15:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 15:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 15:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 15:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 85K Mar 5 18:23 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 ResAllocation-PT-R020C002-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679158873876
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R020C002
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-18 17:01:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 17:01:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 17:01:16] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-18 17:01:16] [INFO ] Transformed 80 places.
[2023-03-18 17:01:16] [INFO ] Transformed 42 transitions.
[2023-03-18 17:01:16] [INFO ] Parsed PT model containing 80 places and 42 transitions and 200 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 86 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 16) seen :7
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 42 rows 80 cols
[2023-03-18 17:01:17] [INFO ] Computed 40 place invariants in 5 ms
[2023-03-18 17:01:17] [INFO ] [Real]Absence check using 40 positive place invariants in 24 ms returned sat
[2023-03-18 17:01:17] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-18 17:01:17] [INFO ] [Nat]Absence check using 40 positive place invariants in 11 ms returned sat
[2023-03-18 17:01:17] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :2
[2023-03-18 17:01:17] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 6 ms to minimize.
[2023-03-18 17:01:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 82 ms
[2023-03-18 17:01:17] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-18 17:01:17] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-18 17:01:17] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-18 17:01:17] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-18 17:01:17] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2023-03-18 17:01:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 168 ms
[2023-03-18 17:01:17] [INFO ] After 347ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-18 17:01:17] [INFO ] After 467ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :1
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 14 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 42/42 transitions.
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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 77 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 77 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 75 transition count 39
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 75 transition count 38
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 12 place count 72 transition count 38
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 2 with 2 rules applied. Total rules applied 14 place count 71 transition count 37
Applied a total of 14 rules in 32 ms. Remains 71 /80 variables (removed 9) and now considering 37/42 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 71/80 places, 37/42 transitions.
Incomplete random walk after 10000 steps, including 104 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2274162 steps, run timeout after 3001 ms. (steps per millisecond=757 ) properties seen :{}
Probabilistic random walk after 2274162 steps, saw 386468 distinct states, run finished after 3002 ms. (steps per millisecond=757 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 37 rows 71 cols
[2023-03-18 17:01:21] [INFO ] Computed 36 place invariants in 3 ms
[2023-03-18 17:01:21] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 17:01:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-18 17:01:21] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 17:01:21] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 5 ms to minimize.
[2023-03-18 17:01:21] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2023-03-18 17:01:21] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2023-03-18 17:01:21] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2023-03-18 17:01:21] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-18 17:01:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 226 ms
[2023-03-18 17:01:21] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-18 17:01:21] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 14 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 37/37 transitions.
Applied a total of 0 rules in 6 ms. Remains 71 /71 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 71/71 places, 37/37 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 37/37 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2023-03-18 17:01:21] [INFO ] Invariant cache hit.
[2023-03-18 17:01:21] [INFO ] Implicit Places using invariants in 53 ms returned [38, 40, 42, 44, 46, 48, 52, 56, 58, 60, 62, 64, 66, 68]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 55 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/71 places, 37/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61 ms. Remains : 57/71 places, 37/37 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2641436 steps, run timeout after 3001 ms. (steps per millisecond=880 ) properties seen :{}
Probabilistic random walk after 2641436 steps, saw 446037 distinct states, run finished after 3001 ms. (steps per millisecond=880 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 37 rows 57 cols
[2023-03-18 17:01:24] [INFO ] Computed 22 place invariants in 6 ms
[2023-03-18 17:01:24] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 17:01:24] [INFO ] [Nat]Absence check using 22 positive place invariants in 2 ms returned sat
[2023-03-18 17:01:24] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 17:01:24] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-18 17:01:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2023-03-18 17:01:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2023-03-18 17:01:24] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2023-03-18 17:01:24] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2023-03-18 17:01:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 135 ms
[2023-03-18 17:01:24] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-18 17:01:24] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 14 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 37/37 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 57/57 places, 37/37 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 37/37 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2023-03-18 17:01:24] [INFO ] Invariant cache hit.
[2023-03-18 17:01:24] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-18 17:01:24] [INFO ] Invariant cache hit.
[2023-03-18 17:01:24] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-18 17:01:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 17:01:24] [INFO ] Invariant cache hit.
[2023-03-18 17:01:24] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 57/57 places, 37/37 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 56 transition count 37
Applied a total of 1 rules in 3 ms. Remains 56 /57 variables (removed 1) and now considering 37/37 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 37 rows 56 cols
[2023-03-18 17:01:24] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-18 17:01:24] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 17:01:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-18 17:01:24] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 17:01:25] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2023-03-18 17:01:25] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-18 17:01:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2023-03-18 17:01:25] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 3 ms to minimize.
[2023-03-18 17:01:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 114 ms
[2023-03-18 17:01:25] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-18 17:01:25] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-18 17:01:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-18 17:01:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 57 places, 37 transitions and 150 arcs took 2 ms.
[2023-03-18 17:01:25] [INFO ] Flatten gal took : 25 ms
Total runtime 9426 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ResAllocation (PT), instance R020C002
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
GOT IT HERE. BS
Petri model created: 57 places, 37 transitions, 150 arcs.
Final Score: 182.184
Took : 1 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ResAllocation-PT-R020C002-ReachabilityCardinality-13 (reachable &!potential( ( ( (tk(P33)) <= (tk(P37)) ) | ( ( (! ( (tk(P6)) <= ( 1 ) )) | ( ( 1 ) <= (tk(P43)) ) ) & ( ( ( (tk(P1)) <= ( 0 ) ) | (! ( ( 1 ) <= (tk(P37)) )) ) | ( ( (! ( ( 1 ) <= (tk(P45)) )) & ( (tk(P26)) <= ( 0 ) ) ) | ( ( (! ( (tk(P31)) <= ( 0 ) )) & ( (! ( (tk(P48)) <= (tk(P12)) )) & (! ( (tk(P55)) <= ( 1 ) )) ) ) | ( ( ( 1 ) <= (tk(P57)) ) & ( (tk(P11)) <= (tk(P9)) ) ) ) ) ) ) )))
FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
BK_STOP 1679158888268
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -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="ResAllocation-PT-R020C002"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is ResAllocation-PT-R020C002, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r331-tall-167889204900758"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R020C002.tgz
mv ResAllocation-PT-R020C002 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;