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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16220.092 3600000.00 7020488.00 153943.20 TTTFFTFFTFF?F?FF 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-167903713600447.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 ShieldPPPs-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713600447
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 02:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 02:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 02:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 02:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 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 172K 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 ShieldPPPs-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679200464234

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-19 04:34:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 04:34:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 04:34:26] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-19 04:34:26] [INFO ] Transformed 683 places.
[2023-03-19 04:34:26] [INFO ] Transformed 633 transitions.
[2023-03-19 04:34:26] [INFO ] Found NUPN structural information;
[2023-03-19 04:34:26] [INFO ] Parsed PT model containing 683 places and 633 transitions and 1746 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 04:34:26] [INFO ] Flatten gal took : 132 ms
[2023-03-19 04:34:26] [INFO ] Flatten gal took : 47 ms
[2023-03-19 04:34:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15380401780292637702.gal : 34 ms
[2023-03-19 04:34:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3331347932181910645.prop : 1 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/ReachabilityCardinality15380401780292637702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3331347932181910645.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
Incomplete random walk after 10000 steps, including 6 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 16) seen :8
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Loading property file /tmp/ReachabilityCardinality3331347932181910645.prop.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :12 after 19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :19 after 576
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :576 after 11916
Invariant property ShieldPPPs-PT-010B-ReachabilityFireability-10 does not hold.
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :11916 after 3.63285e+08
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :3.63285e+08 after 3.90677e+12
Running SMT prover for 5 properties.
// Phase 1: matrix 633 rows 683 cols
[2023-03-19 04:34:27] [INFO ] Computed 111 place invariants in 12 ms
[2023-03-19 04:34:27] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 04:34:27] [INFO ] [Nat]Absence check using 111 positive place invariants in 28 ms returned sat
[2023-03-19 04:34:28] [INFO ] After 630ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 04:34:29] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 5 ms to minimize.
[2023-03-19 04:34:29] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2023-03-19 04:34:29] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2023-03-19 04:34:29] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2023-03-19 04:34:29] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2023-03-19 04:34:30] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 1 ms to minimize.
[2023-03-19 04:34:30] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2023-03-19 04:34:30] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2023-03-19 04:34:30] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 0 ms to minimize.
[2023-03-19 04:34:30] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 1 ms to minimize.
[2023-03-19 04:34:30] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2023-03-19 04:34:30] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 1 ms to minimize.
[2023-03-19 04:34:31] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2023-03-19 04:34:31] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2221 ms
[2023-03-19 04:34:31] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 0 ms to minimize.
[2023-03-19 04:34:31] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 0 ms to minimize.
[2023-03-19 04:34:31] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2023-03-19 04:34:31] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2023-03-19 04:34:31] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 1 ms to minimize.
[2023-03-19 04:34:32] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2023-03-19 04:34:32] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2023-03-19 04:34:32] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2023-03-19 04:34:32] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2023-03-19 04:34:32] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2023-03-19 04:34:32] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
[2023-03-19 04:34:33] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2023-03-19 04:34:33] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 1 ms to minimize.
[2023-03-19 04:34:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2169 ms
[2023-03-19 04:34:33] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2023-03-19 04:34:33] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2023-03-19 04:34:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 361 ms
[2023-03-19 04:34:34] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 1 ms to minimize.
[2023-03-19 04:34:34] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 0 ms to minimize.
[2023-03-19 04:34:34] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 1 ms to minimize.
[2023-03-19 04:34:35] [INFO ] Deduced a trap composed of 23 places in 309 ms of which 0 ms to minimize.
[2023-03-19 04:34:35] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 1 ms to minimize.
[2023-03-19 04:34:35] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 11 ms to minimize.
[2023-03-19 04:34:35] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 1 ms to minimize.
[2023-03-19 04:34:35] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 0 ms to minimize.
[2023-03-19 04:34:36] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2023-03-19 04:34:36] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 1 ms to minimize.
[2023-03-19 04:34:36] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 1 ms to minimize.
[2023-03-19 04:34:37] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 0 ms to minimize.
[2023-03-19 04:34:37] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 1 ms to minimize.
[2023-03-19 04:34:37] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 9 ms to minimize.
[2023-03-19 04:34:37] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 1 ms to minimize.
[2023-03-19 04:34:38] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2023-03-19 04:34:38] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 0 ms to minimize.
[2023-03-19 04:34:38] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 0 ms to minimize.
[2023-03-19 04:34:38] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2023-03-19 04:34:38] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 1 ms to minimize.
[2023-03-19 04:34:39] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2023-03-19 04:34:39] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 2 ms to minimize.
[2023-03-19 04:34:39] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 2 ms to minimize.
[2023-03-19 04:34:39] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 0 ms to minimize.
[2023-03-19 04:34:39] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2023-03-19 04:34:40] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 0 ms to minimize.
[2023-03-19 04:34:40] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2023-03-19 04:34:40] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 20 ms to minimize.
[2023-03-19 04:34:40] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 0 ms to minimize.
[2023-03-19 04:34:41] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 14 ms to minimize.
[2023-03-19 04:34:41] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2023-03-19 04:34:41] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2023-03-19 04:34:41] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2023-03-19 04:34:41] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2023-03-19 04:34:41] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 7684 ms
[2023-03-19 04:34:41] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 0 ms to minimize.
[2023-03-19 04:34:42] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 14 ms to minimize.
[2023-03-19 04:34:42] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 15 ms to minimize.
[2023-03-19 04:34:42] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2023-03-19 04:34:42] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2023-03-19 04:34:42] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2023-03-19 04:34:42] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 17 ms to minimize.
[2023-03-19 04:34:43] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2023-03-19 04:34:43] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 0 ms to minimize.
[2023-03-19 04:34:43] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 0 ms to minimize.
[2023-03-19 04:34:43] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
[2023-03-19 04:34:43] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2023-03-19 04:34:43] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 1 ms to minimize.
[2023-03-19 04:34:43] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2023-03-19 04:34:44] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2023-03-19 04:34:44] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2023-03-19 04:34:44] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 0 ms to minimize.
[2023-03-19 04:34:44] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 1 ms to minimize.
[2023-03-19 04:34:44] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2023-03-19 04:34:44] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 0 ms to minimize.
[2023-03-19 04:34:45] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2023-03-19 04:34:45] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2023-03-19 04:34:45] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2023-03-19 04:34:45] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 0 ms to minimize.
[2023-03-19 04:34:45] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3785 ms
[2023-03-19 04:34:45] [INFO ] After 17609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 831 ms.
[2023-03-19 04:34:46] [INFO ] After 18713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 101 ms.
Support contains 102 out of 683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 683/683 places, 633/633 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 683 transition count 581
Reduce places removed 52 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 60 rules applied. Total rules applied 112 place count 631 transition count 573
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 120 place count 623 transition count 573
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 120 place count 623 transition count 530
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 206 place count 580 transition count 530
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 262 place count 524 transition count 474
Iterating global reduction 3 with 56 rules applied. Total rules applied 318 place count 524 transition count 474
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 318 place count 524 transition count 461
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 344 place count 511 transition count 461
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 552 place count 407 transition count 357
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 3 with 60 rules applied. Total rules applied 612 place count 407 transition count 357
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 613 place count 406 transition count 356
Applied a total of 613 rules in 130 ms. Remains 406 /683 variables (removed 277) and now considering 356/633 (removed 277) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 406/683 places, 356/633 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 5) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 356 rows 406 cols
[2023-03-19 04:34:47] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-19 04:34:47] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 04:34:47] [INFO ] [Nat]Absence check using 111 positive place invariants in 16 ms returned sat
[2023-03-19 04:34:47] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 04:34:47] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2023-03-19 04:34:47] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2023-03-19 04:34:48] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2023-03-19 04:34:48] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2023-03-19 04:34:48] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2023-03-19 04:34:48] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2023-03-19 04:34:48] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2023-03-19 04:34:48] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2023-03-19 04:34:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 931 ms
[2023-03-19 04:34:48] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2023-03-19 04:34:48] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2023-03-19 04:34:49] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2023-03-19 04:34:49] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 0 ms to minimize.
[2023-03-19 04:34:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 547 ms
[2023-03-19 04:34:49] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2023-03-19 04:34:49] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2023-03-19 04:34:49] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-19 04:34:49] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2023-03-19 04:34:50] [INFO ] Deduced a trap composed of 9 places in 350 ms of which 0 ms to minimize.
[2023-03-19 04:34:50] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2023-03-19 04:34:50] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-19 04:34:50] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2023-03-19 04:34:50] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2023-03-19 04:34:50] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2023-03-19 04:34:50] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 1 ms to minimize.
[2023-03-19 04:34:50] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2023-03-19 04:34:51] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2023-03-19 04:34:51] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 1 ms to minimize.
[2023-03-19 04:34:51] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1903 ms
[2023-03-19 04:34:51] [INFO ] After 4028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 341 ms.
[2023-03-19 04:34:51] [INFO ] After 4478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 73 ms.
Support contains 50 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 356/356 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 406 transition count 352
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 402 transition count 351
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 401 transition count 351
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 10 place count 401 transition count 341
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 30 place count 391 transition count 341
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 389 transition count 339
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 389 transition count 339
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 98 place count 357 transition count 307
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 113 place count 357 transition count 307
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 356 transition count 306
Applied a total of 114 rules in 71 ms. Remains 356 /406 variables (removed 50) and now considering 306/356 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 356/406 places, 306/356 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 4) 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 4) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 306 rows 356 cols
[2023-03-19 04:34:52] [INFO ] Computed 111 place invariants in 8 ms
[2023-03-19 04:34:52] [INFO ] [Real]Absence check using 107 positive place invariants in 18 ms returned sat
[2023-03-19 04:34:52] [INFO ] [Real]Absence check using 107 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-19 04:34:52] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 04:34:52] [INFO ] [Nat]Absence check using 107 positive place invariants in 22 ms returned sat
[2023-03-19 04:34:52] [INFO ] [Nat]Absence check using 107 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-19 04:34:52] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 04:34:52] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2023-03-19 04:34:52] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
[2023-03-19 04:34:53] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 1 ms to minimize.
[2023-03-19 04:34:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 463 ms
[2023-03-19 04:34:53] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2023-03-19 04:34:53] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2023-03-19 04:34:53] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2023-03-19 04:34:53] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2023-03-19 04:34:54] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2023-03-19 04:34:54] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 26 ms to minimize.
[2023-03-19 04:34:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 892 ms
[2023-03-19 04:34:54] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 0 ms to minimize.
[2023-03-19 04:34:54] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2023-03-19 04:34:54] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2023-03-19 04:34:54] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2023-03-19 04:34:54] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2023-03-19 04:34:55] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-19 04:34:55] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2023-03-19 04:34:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 698 ms
[2023-03-19 04:34:55] [INFO ] After 2785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 357 ms.
[2023-03-19 04:34:55] [INFO ] After 3254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 43 ms.
Support contains 40 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 306/306 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 356 transition count 304
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 354 transition count 304
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 350 transition count 300
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 350 transition count 300
Applied a total of 13 rules in 27 ms. Remains 350 /356 variables (removed 6) and now considering 300/306 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 350/356 places, 300/306 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 300 rows 350 cols
[2023-03-19 04:34:55] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-19 04:34:55] [INFO ] [Real]Absence check using 108 positive place invariants in 119 ms returned sat
[2023-03-19 04:34:55] [INFO ] [Real]Absence check using 108 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 04:34:55] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 04:34:56] [INFO ] [Nat]Absence check using 108 positive place invariants in 14 ms returned sat
[2023-03-19 04:34:56] [INFO ] [Nat]Absence check using 108 positive and 3 generalized place invariants in 8 ms returned sat
[2023-03-19 04:34:56] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 04:34:56] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2023-03-19 04:34:56] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2023-03-19 04:34:56] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2023-03-19 04:34:56] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2023-03-19 04:34:56] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2023-03-19 04:34:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 641 ms
[2023-03-19 04:34:57] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2023-03-19 04:34:57] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2023-03-19 04:34:57] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2023-03-19 04:34:57] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2023-03-19 04:34:57] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2023-03-19 04:34:57] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 2 ms to minimize.
[2023-03-19 04:34:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 756 ms
[2023-03-19 04:34:57] [INFO ] After 1899ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-19 04:34:58] [INFO ] After 2171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 27 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 300/300 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 350 transition count 297
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 347 transition count 297
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 24 place count 338 transition count 288
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 338 transition count 288
Applied a total of 27 rules in 40 ms. Remains 338 /350 variables (removed 12) and now considering 288/300 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 338/350 places, 288/300 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 113 ms. (steps per millisecond=88 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 576608 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :{}
Probabilistic random walk after 576608 steps, saw 107012 distinct states, run finished after 3004 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 288 rows 338 cols
[2023-03-19 04:35:01] [INFO ] Computed 111 place invariants in 7 ms
[2023-03-19 04:35:01] [INFO ] [Real]Absence check using 104 positive place invariants in 17 ms returned sat
[2023-03-19 04:35:01] [INFO ] [Real]Absence check using 104 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-19 04:35:01] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 04:35:01] [INFO ] [Nat]Absence check using 104 positive place invariants in 28 ms returned sat
[2023-03-19 04:35:01] [INFO ] [Nat]Absence check using 104 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-19 04:35:01] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 04:35:02] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2023-03-19 04:35:02] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 0 ms to minimize.
[2023-03-19 04:35:02] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2023-03-19 04:35:02] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 0 ms to minimize.
[2023-03-19 04:35:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 459 ms
[2023-03-19 04:35:02] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2023-03-19 04:35:02] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-19 04:35:02] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2023-03-19 04:35:03] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2023-03-19 04:35:03] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2023-03-19 04:35:03] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2023-03-19 04:35:03] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2023-03-19 04:35:03] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 1 ms to minimize.
[2023-03-19 04:35:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 948 ms
[2023-03-19 04:35:03] [INFO ] After 1990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 264 ms.
[2023-03-19 04:35:03] [INFO ] After 2400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 27 out of 338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 288/288 transitions.
Applied a total of 0 rules in 28 ms. Remains 338 /338 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 338/338 places, 288/288 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 288/288 transitions.
Applied a total of 0 rules in 9 ms. Remains 338 /338 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-19 04:35:03] [INFO ] Invariant cache hit.
[2023-03-19 04:35:04] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-19 04:35:04] [INFO ] Invariant cache hit.
[2023-03-19 04:35:04] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2023-03-19 04:35:04] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-19 04:35:04] [INFO ] Invariant cache hit.
[2023-03-19 04:35:04] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 727 ms. Remains : 338/338 places, 288/288 transitions.
Applied a total of 0 rules in 6 ms. Remains 338 /338 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 04:35:04] [INFO ] Invariant cache hit.
[2023-03-19 04:35:04] [INFO ] [Real]Absence check using 104 positive place invariants in 44 ms returned sat
[2023-03-19 04:35:04] [INFO ] [Real]Absence check using 104 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-19 04:35:04] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 04:35:04] [INFO ] [Nat]Absence check using 104 positive place invariants in 19 ms returned sat
[2023-03-19 04:35:04] [INFO ] [Nat]Absence check using 104 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-19 04:35:05] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 04:35:05] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 0 ms to minimize.
[2023-03-19 04:35:05] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
[2023-03-19 04:35:05] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2023-03-19 04:35:05] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-19 04:35:05] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2023-03-19 04:35:05] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 0 ms to minimize.
[2023-03-19 04:35:05] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2023-03-19 04:35:06] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 0 ms to minimize.
[2023-03-19 04:35:06] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2023-03-19 04:35:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1021 ms
[2023-03-19 04:35:06] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2023-03-19 04:35:06] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2023-03-19 04:35:06] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-19 04:35:06] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2023-03-19 04:35:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 548 ms
[2023-03-19 04:35:06] [INFO ] After 2085ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 325 ms.
[2023-03-19 04:35:07] [INFO ] After 2540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-19 04:35:07] [INFO ] Flatten gal took : 63 ms
[2023-03-19 04:35:07] [INFO ] Flatten gal took : 31 ms
[2023-03-19 04:35:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4475734462233874260.gal : 4 ms
[2023-03-19 04:35:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7284111647027988118.prop : 1 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/ReachabilityCardinality4475734462233874260.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7284111647027988118.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 ...328
Loading property file /tmp/ReachabilityCardinality7284111647027988118.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 504
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :504 after 5471
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5471 after 5661
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5661 after 6067
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6067 after 7546
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :7546 after 1.28888e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.28888e+06 after 2.42299e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.42299e+06 after 5.80567e+07
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5.80567e+07 after 1.71176e+09
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.71176e+09 after 1.17762e+10
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.17762e+10 after 1.04288e+11
Detected timeout of ITS tools.
[2023-03-19 04:35:22] [INFO ] Flatten gal took : 18 ms
[2023-03-19 04:35:22] [INFO ] Applying decomposition
[2023-03-19 04:35:22] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2913706775969797072.txt' '-o' '/tmp/graph2913706775969797072.bin' '-w' '/tmp/graph2913706775969797072.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2913706775969797072.bin' '-l' '-1' '-v' '-w' '/tmp/graph2913706775969797072.weights' '-q' '0' '-e' '0.001'
[2023-03-19 04:35:22] [INFO ] Decomposing Gal with order
[2023-03-19 04:35:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 04:35:22] [INFO ] Removed a total of 148 redundant transitions.
[2023-03-19 04:35:22] [INFO ] Flatten gal took : 71 ms
[2023-03-19 04:35:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 25 ms.
[2023-03-19 04:35:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5934971691277573771.gal : 9 ms
[2023-03-19 04:35:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14971892023323811581.prop : 0 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/ReachabilityCardinality5934971691277573771.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14971892023323811581.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality14971892023323811581.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 4
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :4 after 54
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :22176 after 2.62069e+11
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.62069e+11 after 9.36589e+14
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :9.36589e+14 after 2.01114e+17
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9449647182587997543
[2023-03-19 04:35:38] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9449647182587997543
Running compilation step : cd /tmp/ltsmin9449647182587997543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 576 ms.
Running link step : cd /tmp/ltsmin9449647182587997543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin9449647182587997543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldPPPsPT010BReachabilityFireability11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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)
[2023-03-19 04:35:53] [INFO ] Flatten gal took : 48 ms
[2023-03-19 04:35:53] [INFO ] Applying decomposition
[2023-03-19 04:35:53] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10761987952690044355.txt' '-o' '/tmp/graph10761987952690044355.bin' '-w' '/tmp/graph10761987952690044355.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10761987952690044355.bin' '-l' '-1' '-v' '-w' '/tmp/graph10761987952690044355.weights' '-q' '0' '-e' '0.001'
[2023-03-19 04:35:53] [INFO ] Decomposing Gal with order
[2023-03-19 04:35:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 04:35:53] [INFO ] Removed a total of 90 redundant transitions.
[2023-03-19 04:35:53] [INFO ] Flatten gal took : 36 ms
[2023-03-19 04:35:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-19 04:35:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1737162046234542114.gal : 7 ms
[2023-03-19 04:35:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1000995796550386429.prop : 1 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/ReachabilityCardinality1737162046234542114.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1000995796550386429.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality1000995796550386429.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 4567
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :4567 after 3.28992e+12
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3.28992e+12 after 4.16386e+28
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4.16386e+28 after 1.96448e+32
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.96448e+32 after 8.83712e+37
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :8.83712e+37 after 8.84848e+37
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-19 05:06:08] [INFO ] Flatten gal took : 408 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1880833956973862810
[2023-03-19 05:06:09] [INFO ] Computing symmetric may disable matrix : 288 transitions.
[2023-03-19 05:06:09] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 05:06:09] [INFO ] Computing symmetric may enable matrix : 288 transitions.
[2023-03-19 05:06:09] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 05:06:10] [INFO ] Applying decomposition
[2023-03-19 05:06:10] [INFO ] Computing Do-Not-Accords matrix : 288 transitions.
[2023-03-19 05:06:10] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 05:06:10] [INFO ] Built C files in 1599ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1880833956973862810
[2023-03-19 05:06:10] [INFO ] Flatten gal took : 413 ms
Running compilation step : cd /tmp/ltsmin1880833956973862810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9725837557287523577.txt' '-o' '/tmp/graph9725837557287523577.bin' '-w' '/tmp/graph9725837557287523577.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9725837557287523577.bin' '-l' '-1' '-v' '-w' '/tmp/graph9725837557287523577.weights' '-q' '0' '-e' '0.001'
[2023-03-19 05:06:12] [INFO ] Decomposing Gal with order
[2023-03-19 05:06:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 05:06:12] [INFO ] Removed a total of 138 redundant transitions.
[2023-03-19 05:06:12] [INFO ] Flatten gal took : 51 ms
Compilation finished in 1647 ms.
Running link step : cd /tmp/ltsmin1880833956973862810;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 109 ms.
Running LTSmin : cd /tmp/ltsmin1880833956973862810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT010BReachabilityFireability11==true'
[2023-03-19 05:06:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 244 ms.
[2023-03-19 05:06:12] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16447321065525499310.gal : 26 ms
[2023-03-19 05:06:12] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2002578724900961393.prop : 12 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/ReachabilityFireability16447321065525499310.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2002578724900961393.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityFireability2002578724900961393.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 54
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :88704 after 700272
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :700272 after 2.01477e+15
pins2lts-mc-linux64, 0.009: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Initializing POR dependencies: labels 290, guards 288
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.041: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.041: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.997: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 2/ 8), 1.003: "ShieldPPPsPT010BReachabilityFireability11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 1.003: "ShieldPPPsPT010BReachabilityFireability11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 1.003: "ShieldPPPsPT010BReachabilityFireability11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 1.003: "ShieldPPPsPT010BReachabilityFireability11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 1.004: "ShieldPPPsPT010BReachabilityFireability11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 1.005: "ShieldPPPsPT010BReachabilityFireability11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 1.005: There are 290 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.005: State length is 338, there are 288 groups
pins2lts-mc-linux64( 0/ 8), 1.005: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.005: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 3/ 8), 1.004: "ShieldPPPsPT010BReachabilityFireability11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 1.004: "ShieldPPPsPT010BReachabilityFireability11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 1.005: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 1.006: Visible groups: 0 / 288, labels: 1 / 290
pins2lts-mc-linux64( 0/ 8), 1.006: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 1.006: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 1.050: ~15 levels ~960 states ~2320 transitions
pins2lts-mc-linux64( 0/ 8), 1.064: ~17 levels ~1920 states ~5280 transitions
pins2lts-mc-linux64( 0/ 8), 1.090: ~19 levels ~3840 states ~11472 transitions
pins2lts-mc-linux64( 0/ 8), 1.148: ~21 levels ~7680 states ~26072 transitions
pins2lts-mc-linux64( 0/ 8), 1.339: ~22 levels ~15360 states ~62568 transitions
pins2lts-mc-linux64( 0/ 8), 1.858: ~24 levels ~30720 states ~139080 transitions
pins2lts-mc-linux64( 0/ 8), 2.660: ~25 levels ~61440 states ~300696 transitions
pins2lts-mc-linux64( 0/ 8), 4.068: ~27 levels ~122880 states ~631848 transitions
pins2lts-mc-linux64( 0/ 8), 6.818: ~28 levels ~245760 states ~1319736 transitions
pins2lts-mc-linux64( 7/ 8), 11.707: ~13 levels ~491520 states ~2620280 transitions
pins2lts-mc-linux64( 6/ 8), 21.608: ~17 levels ~983040 states ~5549808 transitions
pins2lts-mc-linux64( 6/ 8), 41.196: ~18 levels ~1966080 states ~11489304 transitions
pins2lts-mc-linux64( 7/ 8), 81.035: ~18 levels ~3932160 states ~24809992 transitions
pins2lts-mc-linux64( 7/ 8), 161.023: ~19 levels ~7864320 states ~50399528 transitions
pins2lts-mc-linux64( 7/ 8), 347.067: ~21 levels ~15728640 states ~111238224 transitions
pins2lts-mc-linux64( 7/ 8), 559.257: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 559.297:
pins2lts-mc-linux64( 0/ 8), 559.297: mean standard work distribution: 6.9% (states) 1.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 559.297:
pins2lts-mc-linux64( 0/ 8), 559.297: Explored 22292175 states 180771772 transitions, fanout: 8.109
pins2lts-mc-linux64( 0/ 8), 559.297: Total exploration time 558.280 sec (558.250 sec minimum, 558.271 sec on average)
pins2lts-mc-linux64( 0/ 8), 559.297: States per second: 39930, Transitions per second: 323801
pins2lts-mc-linux64( 0/ 8), 559.298: Ignoring proviso: 16783129
pins2lts-mc-linux64( 0/ 8), 559.298:
pins2lts-mc-linux64( 0/ 8), 559.298: Queue width: 8B, total height: 14159220, memory: 108.03MB
pins2lts-mc-linux64( 0/ 8), 559.298: Tree memory: 533.8MB, 15.4 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 559.298: Tree fill ratio (roots/leafs): 27.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 559.298: Stored 290 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 559.298: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 559.298: Est. total memory use: 641.8MB (~1132.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1880833956973862810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT010BReachabilityFireability11==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1880833956973862810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT010BReachabilityFireability11==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 159812 kB
After kill :
MemTotal: 16393220 kB
MemFree: 12752376 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="ShieldPPPs-PT-010B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldPPPs-PT-010B, 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 r389-oct2-167903713600447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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