fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r576-smll-171734919900070
Last Updated
July 7, 2024

About the Execution of ITS-Tools for MedleyA-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
358.724 8698.00 24897.00 82.50 TFTTFTTFTTTTTFTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r576-smll-171734919900070.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919900070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 99K Jun 2 16:33 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 MedleyA-PT-09-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717359325183

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-06-02 20:15:27] [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]
[2024-06-02 20:15:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:15:27] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-06-02 20:15:27] [INFO ] Transformed 147 places.
[2024-06-02 20:15:27] [INFO ] Transformed 315 transitions.
[2024-06-02 20:15:27] [INFO ] Found NUPN structural information;
[2024-06-02 20:15:27] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 317 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 2 transitions.
FORMULA MedleyA-PT-09-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1322 resets) in 2674 ms. (14 steps per ms) remains 7/12 properties
FORMULA MedleyA-PT-09-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (296 resets) in 602 ms. (66 steps per ms) remains 7/7 properties
[2024-06-02 20:15:28] [INFO ] Flatten gal took : 265 ms
BEST_FIRST walk for 40003 steps (287 resets) in 478 ms. (83 steps per ms) remains 6/7 properties
FORMULA MedleyA-PT-09-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-02 20:15:28] [INFO ] Flatten gal took : 127 ms
[2024-06-02 20:15:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5378739289785073758.gal : 160 ms
[2024-06-02 20:15:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18355572210219838668.prop : 4 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5378739289785073758.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18355572210219838668.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (327 resets) in 965 ms. (41 steps per ms) remains 6/6 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (299 resets) in 612 ms. (65 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality18355572210219838668.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 21
SDD proceeding with computation,6 properties remain. new max is 32
BEST_FIRST walk for 40004 steps (332 resets) in 276 ms. (144 steps per ms) remains 6/6 properties
SDD size :21 after 104
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :104 after 240
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :240 after 6428
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :6428 after 6950
Invariant property MedleyA-PT-09-ReachabilityCardinality-2024-04 does not hold.
FORMULA MedleyA-PT-09-ReachabilityCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :6950 after 10150
BEST_FIRST walk for 40003 steps (271 resets) in 448 ms. (89 steps per ms) remains 6/6 properties
// Phase 1: matrix 313 rows 145 cols
[2024-06-02 20:15:29] [INFO ] Computed 12 invariants in 17 ms
Reachability property MedleyA-PT-09-ReachabilityCardinality-2024-05 is true.
FORMULA MedleyA-PT-09-ReachabilityCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :10150 after 26059
Reachability property MedleyA-PT-09-ReachabilityCardinality-2024-00 is true.
FORMULA MedleyA-PT-09-ReachabilityCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :26059 after 67863
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 50/105 variables, 7/62 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 50/112 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 40/145 variables, 5/117 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 40/157 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/157 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Reachability property MedleyA-PT-09-ReachabilityCardinality-2024-09 is true.
FORMULA MedleyA-PT-09-ReachabilityCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :67863 after 129074
At refinement iteration 8 (OVERLAPS) 313/458 variables, 145/302 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/302 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/458 variables, 0/302 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 302 constraints, problems are : Problem set: 3 solved, 2 unsolved in 827 ms.
Refiners :[Domain max(s): 145/145 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 60/90 variables, 6/36 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 60/96 constraints. Problems are: Problem set: 3 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :129074 after 132755
[2024-06-02 20:15:30] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/97 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/97 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/97 variables, 1/98 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 7/105 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-06-02 20:15:31] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 1/106 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/106 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem MedleyA-PT-09-ReachabilityCardinality-2024-14 is UNSAT
FORMULA MedleyA-PT-09-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 48/145 variables, 5/111 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 48/159 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-06-02 20:15:31] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 2 ms to minimize.
[2024-06-02 20:15:31] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 2 ms to minimize.
[2024-06-02 20:15:31] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 2 ms to minimize.
[2024-06-02 20:15:31] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 2 ms to minimize.
[2024-06-02 20:15:31] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 5/164 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-06-02 20:15:32] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 1/165 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-06-02 20:15:32] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2024-06-02 20:15:32] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/145 variables, 2/167 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-06-02 20:15:32] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 1/168 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/145 variables, 0/168 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 313/458 variables, 145/313 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/458 variables, 1/314 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/458 variables, 0/314 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-06-02 20:15:32] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 3 ms to minimize.
[2024-06-02 20:15:33] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 3 ms to minimize.
[2024-06-02 20:15:33] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/458 variables, 3/317 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/458 variables, 0/317 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/458 variables, 0/317 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 317 constraints, problems are : Problem set: 4 solved, 1 unsolved in 2746 ms.
Refiners :[Domain max(s): 145/145 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 14/14 constraints]
After SMT, in 3744ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 6 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 313/313 transitions.
Graph (complete) has 480 edges and 145 vertex of which 140 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.12 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 140 transition count 285
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 28 rules applied. Total rules applied 54 place count 116 transition count 281
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 58 place count 114 transition count 279
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 58 place count 114 transition count 275
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 66 place count 110 transition count 275
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 95 place count 81 transition count 239
Iterating global reduction 3 with 29 rules applied. Total rules applied 124 place count 81 transition count 239
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 124 place count 81 transition count 238
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 80 transition count 238
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 166 place count 60 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 168 place count 60 transition count 214
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 176 place count 56 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 181 place count 56 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 183 place count 55 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 185 place count 54 transition count 230
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 191 place count 54 transition count 224
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 197 place count 48 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 201 place count 48 transition count 220
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 48 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 203 place count 47 transition count 219
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 207 place count 47 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 208 place count 46 transition count 218
Applied a total of 208 rules in 408 ms. Remains 46 /145 variables (removed 99) and now considering 218/313 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 450 ms. Remains : 46/145 places, 218/313 transitions.
RANDOM walk for 83 steps (4 resets) in 9 ms. (8 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-09-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 6709 ms.

BK_STOP 1717359333881

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="MedleyA-PT-09"
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-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-09, 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 r576-smll-171734919900070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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