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

About the Execution of Smart+red for ShieldIIPt-PT-050A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3286.084 69182.00 99202.00 40.40 TFTTTTTFTTFFFTF? 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.r395-oct2-167903718600327.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPt-PT-050A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718600327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 7.5K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 17:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:39 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.4K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 18:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 25 18:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 18:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 265K 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 ShieldIIPt-PT-050A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679563054043

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=ShieldIIPt-PT-050A
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 09:17:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 09:17:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 09:17:37] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2023-03-23 09:17:37] [INFO ] Transformed 953 places.
[2023-03-23 09:17:37] [INFO ] Transformed 703 transitions.
[2023-03-23 09:17:37] [INFO ] Found NUPN structural information;
[2023-03-23 09:17:37] [INFO ] Parsed PT model containing 953 places and 703 transitions and 3006 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 604 ms. (steps per millisecond=16 ) properties (out of 16) seen :1
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 83419 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1}
Probabilistic random walk after 83419 steps, saw 82352 distinct states, run finished after 3004 ms. (steps per millisecond=27 ) properties seen :13
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 702 rows 953 cols
[2023-03-23 09:17:41] [INFO ] Computed 451 place invariants in 12 ms
[2023-03-23 09:17:41] [INFO ] After 594ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 09:17:42] [INFO ] [Nat]Absence check using 451 positive place invariants in 73 ms returned sat
[2023-03-23 09:17:43] [INFO ] After 854ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 09:17:43] [INFO ] After 1750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 531 ms.
[2023-03-23 09:17:44] [INFO ] After 2595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 239 ms.
Support contains 83 out of 953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 0 with 81 rules applied. Total rules applied 83 place count 952 transition count 701
Applied a total of 83 rules in 221 ms. Remains 952 /953 variables (removed 1) and now considering 701/702 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 952/953 places, 701/702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 157433 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{0=1}
Probabilistic random walk after 157433 steps, saw 155165 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :1
FORMULA ShieldIIPt-PT-050A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 701 rows 952 cols
[2023-03-23 09:17:48] [INFO ] Computed 451 place invariants in 9 ms
[2023-03-23 09:17:48] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 09:17:49] [INFO ] [Nat]Absence check using 451 positive place invariants in 173 ms returned sat
[2023-03-23 09:17:49] [INFO ] After 560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 09:17:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-23 09:17:49] [INFO ] After 209ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 09:17:50] [INFO ] After 556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-23 09:17:50] [INFO ] After 1668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 91 ms.
Support contains 49 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 701/701 transitions.
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 952 transition count 701
Applied a total of 6 rules in 61 ms. Remains 952 /952 variables (removed 0) and now considering 701/701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 952/952 places, 701/701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 249938 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249938 steps, saw 246238 distinct states, run finished after 3012 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 701 rows 952 cols
[2023-03-23 09:17:53] [INFO ] Computed 451 place invariants in 6 ms
[2023-03-23 09:17:54] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 09:17:54] [INFO ] [Nat]Absence check using 451 positive place invariants in 74 ms returned sat
[2023-03-23 09:17:54] [INFO ] After 531ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 09:17:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-23 09:17:56] [INFO ] After 1584ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 09:17:56] [INFO ] After 2017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 205 ms.
[2023-03-23 09:17:57] [INFO ] After 3087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 100 ms.
Support contains 49 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 701/701 transitions.
Applied a total of 0 rules in 78 ms. Remains 952 /952 variables (removed 0) and now considering 701/701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 952/952 places, 701/701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 701/701 transitions.
Applied a total of 0 rules in 34 ms. Remains 952 /952 variables (removed 0) and now considering 701/701 (removed 0) transitions.
[2023-03-23 09:17:57] [INFO ] Invariant cache hit.
[2023-03-23 09:17:58] [INFO ] Implicit Places using invariants in 776 ms returned [945]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 790 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 951/952 places, 701/701 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 951 transition count 700
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 950 transition count 700
Applied a total of 2 rules in 53 ms. Remains 950 /951 variables (removed 1) and now considering 700/701 (removed 1) transitions.
// Phase 1: matrix 700 rows 950 cols
[2023-03-23 09:17:58] [INFO ] Computed 450 place invariants in 14 ms
[2023-03-23 09:17:58] [INFO ] Implicit Places using invariants in 708 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 712 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 949/952 places, 700/701 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 948 transition count 699
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 120 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2023-03-23 09:17:59] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-23 09:17:59] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-23 09:17:59] [INFO ] Invariant cache hit.
[2023-03-23 09:18:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-23 09:18:01] [INFO ] Implicit Places using invariants and state equation in 1779 ms returned []
Implicit Place search using SMT with State Equation took 2216 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 948/952 places, 699/701 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3925 ms. Remains : 948/952 places, 699/701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 288176 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 288176 steps, saw 283893 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 09:18:04] [INFO ] Invariant cache hit.
[2023-03-23 09:18:04] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 09:18:05] [INFO ] [Nat]Absence check using 449 positive place invariants in 216 ms returned sat
[2023-03-23 09:18:05] [INFO ] After 565ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 09:18:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-23 09:18:05] [INFO ] After 241ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 09:18:06] [INFO ] After 462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 377 ms.
[2023-03-23 09:18:06] [INFO ] After 1869ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 66 ms.
Support contains 49 out of 948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 699/699 transitions.
Applied a total of 0 rules in 22 ms. Remains 948 /948 variables (removed 0) and now considering 699/699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 948/948 places, 699/699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 699/699 transitions.
Applied a total of 0 rules in 22 ms. Remains 948 /948 variables (removed 0) and now considering 699/699 (removed 0) transitions.
[2023-03-23 09:18:06] [INFO ] Invariant cache hit.
[2023-03-23 09:18:07] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-23 09:18:07] [INFO ] Invariant cache hit.
[2023-03-23 09:18:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-23 09:18:09] [INFO ] Implicit Places using invariants and state equation in 1921 ms returned []
Implicit Place search using SMT with State Equation took 2420 ms to find 0 implicit places.
[2023-03-23 09:18:09] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-23 09:18:09] [INFO ] Invariant cache hit.
[2023-03-23 09:18:09] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3107 ms. Remains : 948/948 places, 699/699 transitions.
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 0 with 41 rules applied. Total rules applied 41 place count 948 transition count 699
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 948 transition count 658
Applied a total of 82 rules in 58 ms. Remains 948 /948 variables (removed 0) and now considering 658/699 (removed 41) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 658 rows 948 cols
[2023-03-23 09:18:09] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-23 09:18:10] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 09:18:10] [INFO ] [Nat]Absence check using 449 positive place invariants in 55 ms returned sat
[2023-03-23 09:18:10] [INFO ] After 661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 09:18:11] [INFO ] After 824ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-23 09:18:11] [INFO ] After 1245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 09:18:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 30 ms.
[2023-03-23 09:18:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 948 places, 699 transitions and 3208 arcs took 10 ms.
[2023-03-23 09:18:11] [INFO ] Flatten gal took : 167 ms
Total runtime 34961 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPt (PT), instance 050A
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: 948 places, 699 transitions, 3208 arcs.
Final Score: 101263.948
Took : 30 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679563123225

--------------------
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:
++ 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
++ sed s/.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 4862:
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="ShieldIIPt-PT-050A"
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 ShieldIIPt-PT-050A, 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 r395-oct2-167903718600327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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