fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r427-tajo-167905979400239
Last Updated
May 14, 2023

About the Execution of Smart+red for ShieldRVt-PT-004B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
338.752 11824.00 26466.00 74.40 TTFFTTFFT?TTFTF? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r427-tajo-167905979400239.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldRVt-PT-004B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979400239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.6K Feb 25 22:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 22:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 22:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 22:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 22:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 22:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 22:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 48K 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 ShieldRVt-PT-004B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679383468052

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-004B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 07:24:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 07:24:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 07:24:29] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-21 07:24:29] [INFO ] Transformed 203 places.
[2023-03-21 07:24:29] [INFO ] Transformed 203 transitions.
[2023-03-21 07:24:29] [INFO ] Found NUPN structural information;
[2023-03-21 07:24:29] [INFO ] Parsed PT model containing 203 places and 203 transitions and 478 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 16) seen :11
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 203 rows 203 cols
[2023-03-21 07:24:30] [INFO ] Computed 17 place invariants in 19 ms
[2023-03-21 07:24:30] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 07:24:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-21 07:24:31] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-21 07:24:31] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 3 ms to minimize.
[2023-03-21 07:24:31] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2023-03-21 07:24:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2023-03-21 07:24:31] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2023-03-21 07:24:31] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2023-03-21 07:24:31] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2023-03-21 07:24:31] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2023-03-21 07:24:31] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2023-03-21 07:24:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 261 ms
[2023-03-21 07:24:31] [INFO ] After 682ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-21 07:24:31] [INFO ] After 858ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 53 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 203/203 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 203 transition count 174
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 174 transition count 172
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 66 place count 173 transition count 167
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 71 place count 168 transition count 167
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 71 place count 168 transition count 149
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 107 place count 150 transition count 149
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 125 place count 132 transition count 131
Iterating global reduction 4 with 18 rules applied. Total rules applied 143 place count 132 transition count 131
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 143 place count 132 transition count 129
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 147 place count 130 transition count 129
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 193 place count 107 transition count 106
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 196 place count 107 transition count 103
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 199 place count 104 transition count 103
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 202 place count 104 transition count 103
Applied a total of 202 rules in 55 ms. Remains 104 /203 variables (removed 99) and now considering 103/203 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 104/203 places, 103/203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :1
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 103 rows 104 cols
[2023-03-21 07:24:32] [INFO ] Computed 17 place invariants in 7 ms
[2023-03-21 07:24:32] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 07:24:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-21 07:24:32] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 07:24:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 07:24:32] [INFO ] After 36ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 07:24:32] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2023-03-21 07:24:32] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2023-03-21 07:24:32] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2023-03-21 07:24:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 142 ms
[2023-03-21 07:24:32] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-21 07:24:32] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 45 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 103/103 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 104 transition count 100
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 101 transition count 100
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 101 transition count 99
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 100 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 99 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 99 transition count 98
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 2 with 10 rules applied. Total rules applied 20 place count 94 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 93 transition count 93
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 93 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 92 transition count 92
Applied a total of 24 rules in 41 ms. Remains 92 /104 variables (removed 12) and now considering 92/103 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 92/104 places, 92/103 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 656883 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 656883 steps, saw 278012 distinct states, run finished after 3002 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 92 rows 92 cols
[2023-03-21 07:24:35] [INFO ] Computed 17 place invariants in 8 ms
[2023-03-21 07:24:36] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 07:24:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-21 07:24:36] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 07:24:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 07:24:36] [INFO ] After 30ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 07:24:36] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2023-03-21 07:24:36] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2023-03-21 07:24:36] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2023-03-21 07:24:36] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2023-03-21 07:24:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 138 ms
[2023-03-21 07:24:36] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-21 07:24:36] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 45 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 92/92 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 92/92 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-21 07:24:36] [INFO ] Invariant cache hit.
[2023-03-21 07:24:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-21 07:24:36] [INFO ] Invariant cache hit.
[2023-03-21 07:24:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 07:24:36] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-21 07:24:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 07:24:36] [INFO ] Invariant cache hit.
[2023-03-21 07:24:36] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 92/92 places, 92/92 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 91
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 92 transition count 91
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 92 transition count 90
Applied a total of 5 rules in 11 ms. Remains 92 /92 variables (removed 0) and now considering 90/92 (removed 2) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 90 rows 92 cols
[2023-03-21 07:24:36] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-21 07:24:36] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 07:24:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-03-21 07:24:36] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 07:24:36] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-21 07:24:36] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-21 07:24:36] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-21 07:24:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 92 places, 92 transitions and 266 arcs took 1 ms.
[2023-03-21 07:24:36] [INFO ] Flatten gal took : 30 ms
Total runtime 7195 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldRVt (PT), instance 004B
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 92 places, 92 transitions, 266 arcs.
Final Score: 639.693
Took : 2 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679383479876

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 457:
syntax error

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="ShieldRVt-PT-004B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldRVt-PT-004B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r427-tajo-167905979400239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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