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.r393-oct2-167903716900350.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 ltsminxred
Input is ShieldIIPt-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716900350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.5K Feb 25 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 17:12 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.9K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 8.7K Feb 25 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 1.7M 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-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679442823118

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 23:53:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 23:53:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:53:46] [INFO ] Load time of PNML (sax parser for PT used): 267 ms
[2023-03-21 23:53:46] [INFO ] Transformed 7003 places.
[2023-03-21 23:53:46] [INFO ] Transformed 6503 transitions.
[2023-03-21 23:53:46] [INFO ] Found NUPN structural information;
[2023-03-21 23:53:46] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 654 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 636 ms. (steps per millisecond=15 ) properties (out of 13) seen :3
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 6503 rows 7003 cols
[2023-03-21 23:53:48] [INFO ] Computed 901 place invariants in 59 ms
[2023-03-21 23:53:51] [INFO ] After 3333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 23:53:54] [INFO ] [Nat]Absence check using 901 positive place invariants in 823 ms returned sat
[2023-03-21 23:54:16] [INFO ] After 20073ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-21 23:54:16] [INFO ] After 20109ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-21 23:54:16] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 74 out of 7003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions removed 1650 transitions
Trivial Post-agglo rules discarded 1650 transitions
Performed 1650 trivial Post agglomeration. Transition count delta: 1650
Iterating post reduction 0 with 1650 rules applied. Total rules applied 1650 place count 7003 transition count 4853
Reduce places removed 1650 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 1652 rules applied. Total rules applied 3302 place count 5353 transition count 4851
Reduce places removed 1 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 2 with 22 rules applied. Total rules applied 3324 place count 5352 transition count 4830
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 3345 place count 5331 transition count 4830
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 398 Pre rules applied. Total rules applied 3345 place count 5331 transition count 4432
Deduced a syphon composed of 398 places in 24 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 4 with 796 rules applied. Total rules applied 4141 place count 4933 transition count 4432
Discarding 681 places :
Symmetric choice reduction at 4 with 681 rule applications. Total rules 4822 place count 4252 transition count 3751
Iterating global reduction 4 with 681 rules applied. Total rules applied 5503 place count 4252 transition count 3751
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 282 Pre rules applied. Total rules applied 5503 place count 4252 transition count 3469
Deduced a syphon composed of 282 places in 25 ms
Reduce places removed 282 places and 0 transitions.
Iterating global reduction 4 with 564 rules applied. Total rules applied 6067 place count 3970 transition count 3469
Performed 1674 Post agglomeration using F-continuation condition.Transition count delta: 1674
Deduced a syphon composed of 1674 places in 12 ms
Reduce places removed 1674 places and 0 transitions.
Iterating global reduction 4 with 3348 rules applied. Total rules applied 9415 place count 2296 transition count 1795
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9617 place count 2195 transition count 1853
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9819 place count 2094 transition count 1919
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 83 places in 6 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 9985 place count 2011 transition count 1971
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 9986 place count 2011 transition count 1970
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 9990 place count 2011 transition count 1966
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 9994 place count 2007 transition count 1966
Partial Free-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 6 with 98 rules applied. Total rules applied 10092 place count 2007 transition count 1966
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 10093 place count 2006 transition count 1965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 10094 place count 2005 transition count 1965
Applied a total of 10094 rules in 3101 ms. Remains 2005 /7003 variables (removed 4998) and now considering 1965/6503 (removed 4538) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3102 ms. Remains : 2005/7003 places, 1965/6503 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 111002 steps, run timeout after 6002 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 111002 steps, saw 67085 distinct states, run finished after 6004 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1965 rows 2005 cols
[2023-03-21 23:54:28] [INFO ] Computed 900 place invariants in 7 ms
[2023-03-21 23:54:29] [INFO ] After 727ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 23:54:30] [INFO ] [Nat]Absence check using 900 positive place invariants in 269 ms returned sat
[2023-03-21 23:54:32] [INFO ] After 2297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 23:54:32] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-21 23:54:35] [INFO ] After 2627ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-21 23:54:35] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 6 ms to minimize.
[2023-03-21 23:54:36] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 1 ms to minimize.
[2023-03-21 23:54:36] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 1 ms to minimize.
[2023-03-21 23:54:36] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2023-03-21 23:54:37] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2023-03-21 23:54:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1772 ms
[2023-03-21 23:54:38] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 2 ms to minimize.
[2023-03-21 23:54:38] [INFO ] Deduced a trap composed of 5 places in 284 ms of which 18 ms to minimize.
[2023-03-21 23:54:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1436 ms
[2023-03-21 23:54:40] [INFO ] Deduced a trap composed of 5 places in 307 ms of which 1 ms to minimize.
[2023-03-21 23:54:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 515 ms
[2023-03-21 23:54:41] [INFO ] After 8267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 2893 ms.
[2023-03-21 23:54:44] [INFO ] After 14977ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 1180 ms.
Support contains 74 out of 2005 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2005/2005 places, 1965/1965 transitions.
Applied a total of 0 rules in 61 ms. Remains 2005 /2005 variables (removed 0) and now considering 1965/1965 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 2005/2005 places, 1965/1965 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2005/2005 places, 1965/1965 transitions.
Applied a total of 0 rules in 58 ms. Remains 2005 /2005 variables (removed 0) and now considering 1965/1965 (removed 0) transitions.
[2023-03-21 23:54:45] [INFO ] Invariant cache hit.
[2023-03-21 23:54:48] [INFO ] Implicit Places using invariants in 2778 ms returned []
[2023-03-21 23:54:48] [INFO ] Invariant cache hit.
[2023-03-21 23:54:50] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-21 23:54:56] [INFO ] Implicit Places using invariants and state equation in 7998 ms returned []
Implicit Place search using SMT with State Equation took 10782 ms to find 0 implicit places.
[2023-03-21 23:54:56] [INFO ] Redundant transitions in 141 ms returned []
[2023-03-21 23:54:56] [INFO ] Invariant cache hit.
[2023-03-21 23:54:57] [INFO ] Dead Transitions using invariants and state equation in 1339 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12339 ms. Remains : 2005/2005 places, 1965/1965 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 2005 transition count 1964
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2004 transition count 1964
Partial Free-agglomeration rule applied 257 times.
Drop transitions removed 257 transitions
Iterating global reduction 0 with 257 rules applied. Total rules applied 259 place count 2004 transition count 1964
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 260 place count 2004 transition count 1963
Applied a total of 260 rules in 266 ms. Remains 2004 /2005 variables (removed 1) and now considering 1963/1965 (removed 2) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 1963 rows 2004 cols
[2023-03-21 23:54:58] [INFO ] Computed 900 place invariants in 10 ms
[2023-03-21 23:54:58] [INFO ] After 751ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 23:54:59] [INFO ] [Nat]Absence check using 900 positive place invariants in 221 ms returned sat
[2023-03-21 23:55:02] [INFO ] After 2628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 23:55:03] [INFO ] State equation strengthened by 239 read => feed constraints.
[2023-03-21 23:55:04] [INFO ] After 1435ms SMT Verify possible using 239 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-21 23:55:04] [INFO ] Deduced a trap composed of 6 places in 338 ms of which 1 ms to minimize.
[2023-03-21 23:55:05] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 0 ms to minimize.
[2023-03-21 23:55:05] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 0 ms to minimize.
[2023-03-21 23:55:06] [INFO ] Deduced a trap composed of 3 places in 420 ms of which 1 ms to minimize.
[2023-03-21 23:55:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1783 ms
[2023-03-21 23:55:06] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2023-03-21 23:55:07] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 0 ms to minimize.
[2023-03-21 23:55:07] [INFO ] Deduced a trap composed of 3 places in 362 ms of which 1 ms to minimize.
[2023-03-21 23:55:08] [INFO ] Deduced a trap composed of 3 places in 368 ms of which 0 ms to minimize.
[2023-03-21 23:55:08] [INFO ] Deduced a trap composed of 5 places in 463 ms of which 1 ms to minimize.
[2023-03-21 23:55:09] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2023-03-21 23:55:09] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2023-03-21 23:55:09] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 1 ms to minimize.
[2023-03-21 23:55:10] [INFO ] Deduced a trap composed of 9 places in 420 ms of which 2 ms to minimize.
[2023-03-21 23:55:10] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 0 ms to minimize.
[2023-03-21 23:55:11] [INFO ] Deduced a trap composed of 5 places in 411 ms of which 1 ms to minimize.
[2023-03-21 23:55:11] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 0 ms to minimize.
[2023-03-21 23:55:11] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5206 ms
[2023-03-21 23:55:12] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 1 ms to minimize.
[2023-03-21 23:55:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 486 ms
[2023-03-21 23:55:13] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 1 ms to minimize.
[2023-03-21 23:55:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2023-03-21 23:55:14] [INFO ] After 10998ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1491 ms.
[2023-03-21 23:55:15] [INFO ] After 16747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-21 23:55:15] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 34 ms.
[2023-03-21 23:55:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2005 places, 1965 transitions and 9592 arcs took 16 ms.
[2023-03-21 23:55:16] [INFO ] Flatten gal took : 242 ms
Total runtime 90211 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/596/inv_0_ --invariant=/tmp/596/inv_1_ --invariant=/tmp/596/inv_2_ --invariant=/tmp/596/inv_3_ --invariant=/tmp/596/inv_4_ --invariant=/tmp/596/inv_5_ --invariant=/tmp/596/inv_6_ --invariant=/tmp/596/inv_7_ --invariant=/tmp/596/inv_8_ --inv-par
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityCardinality-00
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityCardinality-04
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityCardinality-06
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityCardinality-08
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityCardinality-09
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityCardinality-10
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityCardinality-11
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityCardinality-12
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityCardinality-13

BK_STOP 1679446308831

--------------------
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
mcc2023
rfs formula name ShieldIIPt-PT-100B-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/596/inv_0_
rfs formula name ShieldIIPt-PT-100B-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/596/inv_1_
rfs formula name ShieldIIPt-PT-100B-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/596/inv_2_
rfs formula name ShieldIIPt-PT-100B-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/596/inv_3_
rfs formula name ShieldIIPt-PT-100B-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/596/inv_4_
rfs formula name ShieldIIPt-PT-100B-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/596/inv_5_
rfs formula name ShieldIIPt-PT-100B-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/596/inv_6_
rfs formula name ShieldIIPt-PT-100B-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/596/inv_7_
rfs formula name ShieldIIPt-PT-100B-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/596/inv_8_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 2005 places, 1965 transitions and 9592 arcs
pnml2lts-sym: Petri net ShieldIIPt_PT_100B analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.050 real 0.040 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 1965->1125 groups
pnml2lts-sym: Regrouping took 1.180 real 1.180 user 0.000 sys
pnml2lts-sym: state vector length is 2005; there are 1125 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done

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-100B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPt-PT-100B, 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 r393-oct2-167903716900350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100B.tgz
mv ShieldIIPt-PT-100B 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;