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

About the Execution of ITS-Tools for ShieldPPPt-PT-010B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
359.319 16155.00 42803.00 463.80 TTFFTTTFTFTFFTFT 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.r389-oct2-167903713800622.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 itstools
Input is ShieldPPPt-PT-010B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713800622
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.0K Feb 25 21:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 21:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 21:05 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.2K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 21:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 21:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 21:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 185K 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 ShieldPPPt-PT-010B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679216159883

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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-010B
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-19 08:56:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 08:56:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 08:56:02] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2023-03-19 08:56:02] [INFO ] Transformed 783 places.
[2023-03-19 08:56:02] [INFO ] Transformed 713 transitions.
[2023-03-19 08:56:02] [INFO ] Found NUPN structural information;
[2023-03-19 08:56:02] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 13) seen :9
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
[2023-03-19 08:56:03] [INFO ] Flatten gal took : 112 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) 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 4) seen :0
[2023-03-19 08:56:03] [INFO ] Flatten gal took : 61 ms
Running SMT prover for 4 properties.
[2023-03-19 08:56:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10506326234705735751.gal : 43 ms
// Phase 1: matrix 713 rows 783 cols
[2023-03-19 08:56:03] [INFO ] Computed 111 place invariants in 19 ms
[2023-03-19 08:56:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2098121493861320418.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10506326234705735751.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2098121493861320418.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2098121493861320418.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 19
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :19 after 289
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :289 after 7515
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :7515 after 1.93828e+08
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.93828e+08 after 3.61401e+15
[2023-03-19 08:56:03] [INFO ] [Real]Absence check using 111 positive place invariants in 42 ms returned sat
[2023-03-19 08:56:03] [INFO ] After 452ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 08:56:04] [INFO ] [Nat]Absence check using 111 positive place invariants in 28 ms returned sat
[2023-03-19 08:56:04] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 08:56:04] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 8 ms to minimize.
[2023-03-19 08:56:04] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
[2023-03-19 08:56:05] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2023-03-19 08:56:05] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2023-03-19 08:56:05] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 0 ms to minimize.
[2023-03-19 08:56:05] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2023-03-19 08:56:05] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2023-03-19 08:56:05] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2023-03-19 08:56:06] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2023-03-19 08:56:06] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 1 ms to minimize.
[2023-03-19 08:56:06] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2023-03-19 08:56:06] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2023-03-19 08:56:06] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 0 ms to minimize.
[2023-03-19 08:56:06] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2023-03-19 08:56:06] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2023-03-19 08:56:06] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2023-03-19 08:56:06] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
[2023-03-19 08:56:07] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2023-03-19 08:56:07] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2023-03-19 08:56:07] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2023-03-19 08:56:07] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2023-03-19 08:56:07] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2719 ms
[2023-03-19 08:56:07] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 1 ms to minimize.
[2023-03-19 08:56:07] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 1 ms to minimize.
[2023-03-19 08:56:08] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 1 ms to minimize.
[2023-03-19 08:56:08] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 0 ms to minimize.
[2023-03-19 08:56:08] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 1 ms to minimize.
[2023-03-19 08:56:08] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 0 ms to minimize.
[2023-03-19 08:56:08] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 0 ms to minimize.
[2023-03-19 08:56:08] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 1 ms to minimize.
[2023-03-19 08:56:09] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 1 ms to minimize.
[2023-03-19 08:56:09] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 0 ms to minimize.
[2023-03-19 08:56:09] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2023-03-19 08:56:09] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 1 ms to minimize.
[2023-03-19 08:56:09] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2023-03-19 08:56:11] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 6 ms to minimize.
[2023-03-19 08:56:11] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 1 ms to minimize.
[2023-03-19 08:56:11] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 0 ms to minimize.
[2023-03-19 08:56:11] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 1 ms to minimize.
[2023-03-19 08:56:11] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 0 ms to minimize.
[2023-03-19 08:56:11] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 5 ms to minimize.
[2023-03-19 08:56:12] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2023-03-19 08:56:12] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 0 ms to minimize.
[2023-03-19 08:56:12] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 1 ms to minimize.
[2023-03-19 08:56:12] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 0 ms to minimize.
[2023-03-19 08:56:12] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2023-03-19 08:56:12] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2023-03-19 08:56:12] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 0 ms to minimize.
[2023-03-19 08:56:13] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2023-03-19 08:56:13] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5608 ms
[2023-03-19 08:56:13] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 0 ms to minimize.
[2023-03-19 08:56:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-19 08:56:13] [INFO ] After 9188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 386 ms.
[2023-03-19 08:56:13] [INFO ] After 9826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 90 ms.
Support contains 46 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 713/713 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 783 transition count 552
Reduce places removed 161 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 173 rules applied. Total rules applied 334 place count 622 transition count 540
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 345 place count 611 transition count 540
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 345 place count 611 transition count 495
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 435 place count 566 transition count 495
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 496 place count 505 transition count 434
Iterating global reduction 3 with 61 rules applied. Total rules applied 557 place count 505 transition count 434
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 557 place count 505 transition count 410
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 605 place count 481 transition count 410
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 905 place count 331 transition count 260
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 953 place count 307 transition count 260
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 956 place count 307 transition count 257
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 959 place count 304 transition count 257
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 4 with 22 rules applied. Total rules applied 981 place count 304 transition count 257
Applied a total of 981 rules in 180 ms. Remains 304 /783 variables (removed 479) and now considering 257/713 (removed 456) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 304/783 places, 257/713 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :2
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 257 rows 304 cols
[2023-03-19 08:56:14] [INFO ] Computed 111 place invariants in 5 ms
[2023-03-19 08:56:14] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 08:56:14] [INFO ] [Nat]Absence check using 111 positive place invariants in 14 ms returned sat
[2023-03-19 08:56:14] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 08:56:14] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-19 08:56:14] [INFO ] After 64ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 08:56:14] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2023-03-19 08:56:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-19 08:56:14] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-19 08:56:14] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 19 out of 304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 257/257 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 304 transition count 252
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 299 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 298 transition count 251
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 298 transition count 248
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 295 transition count 248
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 294 transition count 247
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 294 transition count 247
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 66 place count 271 transition count 224
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 271 transition count 224
Applied a total of 70 rules in 33 ms. Remains 271 /304 variables (removed 33) and now considering 224/257 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 271/304 places, 224/257 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 271 cols
[2023-03-19 08:56:14] [INFO ] Computed 111 place invariants in 1 ms
[2023-03-19 08:56:15] [INFO ] [Real]Absence check using 111 positive place invariants in 12 ms returned sat
[2023-03-19 08:56:15] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:56:15] [INFO ] [Nat]Absence check using 111 positive place invariants in 14 ms returned sat
[2023-03-19 08:56:15] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 08:56:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 08:56:15] [INFO ] After 29ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 08:56:15] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-19 08:56:15] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 224/224 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 271 transition count 220
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 267 transition count 220
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 267 transition count 218
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 265 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 264 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 264 transition count 217
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 30 place count 256 transition count 209
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 32 place count 255 transition count 209
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 255 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 254 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 253 transition count 208
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 35 place count 253 transition count 206
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 251 transition count 206
Applied a total of 39 rules in 71 ms. Remains 251 /271 variables (removed 20) and now considering 206/224 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 251/271 places, 206/224 transitions.
Finished random walk after 5269 steps, including 1 resets, run visited all 1 properties in 21 ms. (steps per millisecond=250 )
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 12990 ms.

BK_STOP 1679216176038

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ShieldPPPt-PT-010B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldPPPt-PT-010B, 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 r389-oct2-167903713800622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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