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

About the Execution of ITS-Tools for Parking-PT-416

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
441.508 14854.00 39635.00 417.20 FFTFFFFFFFFTTFFT 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.r261-smll-167863536300430.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 Parking-PT-416, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536300430
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 15:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 14:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 107K 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 Parking-PT-416-ReachabilityCardinality-00
FORMULA_NAME Parking-PT-416-ReachabilityCardinality-01
FORMULA_NAME Parking-PT-416-ReachabilityCardinality-02
FORMULA_NAME Parking-PT-416-ReachabilityCardinality-03
FORMULA_NAME Parking-PT-416-ReachabilityCardinality-04
FORMULA_NAME Parking-PT-416-ReachabilityCardinality-05
FORMULA_NAME Parking-PT-416-ReachabilityCardinality-06
FORMULA_NAME Parking-PT-416-ReachabilityCardinality-07
FORMULA_NAME Parking-PT-416-ReachabilityCardinality-08
FORMULA_NAME Parking-PT-416-ReachabilityCardinality-09
FORMULA_NAME Parking-PT-416-ReachabilityCardinality-10
FORMULA_NAME Parking-PT-416-ReachabilityCardinality-11
FORMULA_NAME Parking-PT-416-ReachabilityCardinality-12
FORMULA_NAME Parking-PT-416-ReachabilityCardinality-13
FORMULA_NAME Parking-PT-416-ReachabilityCardinality-14
FORMULA_NAME Parking-PT-416-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678924595216

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=Parking-PT-416
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-15 23:56:38] [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-15 23:56:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 23:56:38] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2023-03-15 23:56:38] [INFO ] Transformed 305 places.
[2023-03-15 23:56:38] [INFO ] Transformed 433 transitions.
[2023-03-15 23:56:38] [INFO ] Found NUPN structural information;
[2023-03-15 23:56:38] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 345 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
FORMULA Parking-PT-416-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 23:56:39] [INFO ] Flatten gal took : 242 ms
[2023-03-15 23:56:39] [INFO ] Flatten gal took : 67 ms
[2023-03-15 23:56:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1894981355997632055.gal : 46 ms
[2023-03-15 23:56:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7090949386575120670.prop : 6 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/ReachabilityCardinality1894981355997632055.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7090949386575120670.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/ReachabilityCardinality7090949386575120670.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :3 after 65
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :65 after 2117
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :2117 after 2129
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :2129 after 2477
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :2477 after 3525
Incomplete random walk after 10000 steps, including 130 resets, run finished after 1413 ms. (steps per millisecond=7 ) properties (out of 14) seen :7
FORMULA Parking-PT-416-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :1
FORMULA Parking-PT-416-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :3525 after 11713
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :1
FORMULA Parking-PT-416-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :11713 after 39161
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 257 rows 305 cols
[2023-03-15 23:56:40] [INFO ] Computed 76 place invariants in 15 ms
[2023-03-15 23:56:41] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
Invariant property Parking-PT-416-ReachabilityCardinality-04 does not hold.
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :39161 after 67249
[2023-03-15 23:56:41] [INFO ] [Nat]Absence check using 72 positive place invariants in 25 ms returned sat
[2023-03-15 23:56:41] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 2 ms returned sat
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :67249 after 99969
[2023-03-15 23:56:41] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-15 23:56:41] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-15 23:56:41] [INFO ] After 146ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-15 23:56:42] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 7 ms to minimize.
[2023-03-15 23:56:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-15 23:56:42] [INFO ] After 453ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 127 ms.
[2023-03-15 23:56:42] [INFO ] After 1132ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA Parking-PT-416-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
FORMULA Parking-PT-416-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 43 ms.
Support contains 20 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 257/257 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 305 transition count 251
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 299 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 298 transition count 250
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 14 place count 298 transition count 244
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 26 place count 292 transition count 244
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 29 place count 289 transition count 241
Iterating global reduction 3 with 3 rules applied. Total rules applied 32 place count 289 transition count 241
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 3 with 18 rules applied. Total rules applied 50 place count 280 transition count 232
Free-agglomeration rule applied 42 times.
Iterating global reduction 3 with 42 rules applied. Total rules applied 92 place count 280 transition count 190
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 134 place count 238 transition count 190
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 238 transition count 190
Applied a total of 135 rules in 146 ms. Remains 238 /305 variables (removed 67) and now considering 190/257 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 238/305 places, 190/257 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :1
FORMULA Parking-PT-416-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 190 rows 238 cols
[2023-03-15 23:56:42] [INFO ] Computed 76 place invariants in 4 ms
[2023-03-15 23:56:43] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 23:56:43] [INFO ] [Nat]Absence check using 72 positive place invariants in 23 ms returned sat
[2023-03-15 23:56:43] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 23:56:43] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 23:56:43] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 23:56:43] [INFO ] After 75ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 23:56:43] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-15 23:56:43] [INFO ] After 597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 19 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 190/190 transitions.
Applied a total of 0 rules in 19 ms. Remains 238 /238 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 238/238 places, 190/190 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Invariant property Parking-PT-416-ReachabilityCardinality-14 does not hold.
Interrupted probabilistic random walk after 457972 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 457972 steps, saw 86392 distinct states, run finished after 3002 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 23:56:46] [INFO ] Invariant cache hit.
[2023-03-15 23:56:47] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 23:56:47] [INFO ] [Nat]Absence check using 72 positive place invariants in 24 ms returned sat
[2023-03-15 23:56:47] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 23:56:47] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 23:56:47] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 23:56:47] [INFO ] After 79ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 23:56:47] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-15 23:56:47] [INFO ] After 541ms 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 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 190/190 transitions.
Applied a total of 0 rules in 15 ms. Remains 238 /238 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 238/238 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 190/190 transitions.
Applied a total of 0 rules in 14 ms. Remains 238 /238 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2023-03-15 23:56:47] [INFO ] Invariant cache hit.
[2023-03-15 23:56:48] [INFO ] Implicit Places using invariants in 379 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 27, 34, 40, 46, 62, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 80, 87, 93, 99, 117, 122, 123, 124, 127, 128, 129, 130, 138, 145, 151, 158, 174, 176, 177, 178, 181, 182, 185, 188, 195, 202, 208, 216, 232, 234]
Discarding 65 places :
Implicit Place search using SMT only with invariants took 385 ms to find 65 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 173/238 places, 190/190 transitions.
Graph (trivial) has 123 edges and 173 vertex of which 32 / 173 are part of one of the 1 SCC in 5 ms
Free SCC test removed 31 places
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 142 transition count 105
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 93 transition count 94
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 122 place count 83 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 82 transition count 92
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 123 place count 82 transition count 89
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 129 place count 79 transition count 89
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 140 place count 68 transition count 78
Iterating global reduction 4 with 11 rules applied. Total rules applied 151 place count 68 transition count 78
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 154 place count 65 transition count 75
Iterating global reduction 4 with 3 rules applied. Total rules applied 157 place count 65 transition count 75
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 159 place count 63 transition count 72
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 63 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 162 place count 63 transition count 71
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 163 place count 62 transition count 70
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 62 transition count 70
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 5 with 8 rules applied. Total rules applied 172 place count 58 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 175 place count 58 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 177 place count 57 transition count 78
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 178 place count 57 transition count 77
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 181 place count 57 transition count 74
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 184 place count 54 transition count 74
Applied a total of 184 rules in 78 ms. Remains 54 /173 variables (removed 119) and now considering 74/190 (removed 116) transitions.
// Phase 1: matrix 74 rows 54 cols
[2023-03-15 23:56:48] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 23:56:48] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-15 23:56:48] [INFO ] Invariant cache hit.
[2023-03-15 23:56:48] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-15 23:56:48] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 54/238 places, 74/190 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 620 ms. Remains : 54/238 places, 74/190 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :1
FORMULA Parking-PT-416-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 23:56:48] [INFO ] Invariant cache hit.
[2023-03-15 23:56:48] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 23:56:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 23:56:48] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 23:56:48] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-15 23:56:48] [INFO ] After 17ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 23:56:48] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
[2023-03-15 23:56:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-15 23:56:48] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-15 23:56:48] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 11 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 74/74 transitions.
Graph (trivial) has 14 edges and 54 vertex of which 4 / 54 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 68
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 50 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 49 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 place count 47 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 46 transition count 78
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 46 transition count 77
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 24 place count 46 transition count 65
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 27 place count 46 transition count 62
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 30 place count 43 transition count 62
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 32 place count 43 transition count 60
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 33 place count 43 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 34 place count 42 transition count 59
Applied a total of 34 rules in 43 ms. Remains 42 /54 variables (removed 12) and now considering 59/74 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 42/54 places, 59/74 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2495 steps, run visited all 1 properties in 13 ms. (steps per millisecond=191 )
Probabilistic random walk after 2495 steps, saw 1022 distinct states, run finished after 13 ms. (steps per millisecond=191 ) properties seen :1
FORMULA Parking-PT-416-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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 10277 ms.

BK_STOP 1678924610070

--------------------
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="Parking-PT-416"
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 Parking-PT-416, 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 r261-smll-167863536300430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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