fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r180-tall-171640604200782
Last Updated
July 7, 2024

About the Execution of ITS-Tools for HealthRecord-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
458.271 17305.00 50507.00 91.00 TTFTFFTTTTFTFFTT 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.r180-tall-171640604200782.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 HealthRecord-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604200782
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:42 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 HealthRecord-PT-11-ReachabilityCardinality-2024-00
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-01
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-02
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-03
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-04
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-05
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-06
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-07
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-08
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-09
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-10
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-11
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-12
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-13
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-14
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716520467148

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-24 03:14:28] [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-05-24 03:14:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:14:28] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-24 03:14:28] [INFO ] Transformed 159 places.
[2024-05-24 03:14:28] [INFO ] Transformed 334 transitions.
[2024-05-24 03:14:28] [INFO ] Found NUPN structural information;
[2024-05-24 03:14:28] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:14:28] [INFO ] Flatten gal took : 126 ms
[2024-05-24 03:14:29] [INFO ] Flatten gal took : 53 ms
[2024-05-24 03:14:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16198365117058977438.gal : 37 ms
RANDOM walk for 40000 steps (2671 resets) in 1795 ms. (22 steps per ms) remains 12/13 properties
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-24 03:14:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8841400118771148643.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16198365117058977438.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8841400118771148643.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8841400118771148643.prop.
BEST_FIRST walk for 40002 steps (498 resets) in 436 ms. (91 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :4 after 13
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :13 after 17
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :17 after 865
BEST_FIRST walk for 40003 steps (383 resets) in 269 ms. (148 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (392 resets) in 405 ms. (98 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :865 after 11665
BEST_FIRST walk for 40004 steps (372 resets) in 176 ms. (226 steps per ms) remains 11/12 properties
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :11665 after 14257
BEST_FIRST walk for 40004 steps (403 resets) in 147 ms. (270 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (368 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (383 resets) in 55 ms. (714 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (408 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :14257 after 21889
BEST_FIRST walk for 40003 steps (393 resets) in 114 ms. (347 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (392 resets) in 109 ms. (363 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (396 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (297 resets) in 54 ms. (727 steps per ms) remains 10/11 properties
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Reachability property HealthRecord-PT-11-ReachabilityCardinality-2024-15 is true.
[2024-05-24 03:14:29] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2024-05-24 03:14:30] [INFO ] Computed 18 invariants in 20 ms
[2024-05-24 03:14:30] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :21889 after 96097
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem HealthRecord-PT-11-ReachabilityCardinality-2024-10 is UNSAT
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 30/123 variables, 10/103 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 30/133 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 36/159 variables, 8/141 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 36/177 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 294/453 variables, 159/336 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/336 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1/454 variables, 1/337 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:14:30] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 15 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :96097 after 102793
[2024-05-24 03:14:30] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-05-24 03:14:31] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:14:31] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:14:31] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:14:31] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 6/343 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/343 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :102793 after 115105
At refinement iteration 13 (OVERLAPS) 0/454 variables, 0/343 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 343 constraints, problems are : Problem set: 1 solved, 9 unsolved in 1342 ms.
Refiners :[Domain max(s): 159/159 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 159/159 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 37/115 variables, 10/88 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 37/125 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:14:31] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:14:31] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:14:31] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
[2024-05-24 03:14:31] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:14:31] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:14:31] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:14:31] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 7 ms to minimize.
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 13/138 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 0 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :115105 after 174181
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 1/139 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 44/159 variables, 8/147 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 44/191 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 6/197 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 4 ms to minimize.
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 2 ms to minimize.
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 20/217 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:14:34] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:14:34] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 2 ms to minimize.
[2024-05-24 03:14:34] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:14:34] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:14:34] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:14:34] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 10/227 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:14:34] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:14:34] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:14:34] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:14:34] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 4/231 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:14:34] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:14:34] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:14:34] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:14:35] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:14:35] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:14:35] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:14:35] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/159 variables, 7/238 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:14:35] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:14:35] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:14:35] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:14:35] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/159 variables, 4/242 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:14:35] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/159 variables, 1/243 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:14:35] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:14:35] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/159 variables, 2/245 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:14:35] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:14:35] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/159 variables, 2/247 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 03:14:36] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/159 variables, 1/248 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/159 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 294/453 variables, 159/407 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/453 variables, 9/416 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/454 variables, and 416 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5020 ms.
Refiners :[Domain max(s): 159/159 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 159/159 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 71/71 constraints]
After SMT, in 6526ms problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 78 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 307/307 transitions.
Graph (trivial) has 75 edges and 159 vertex of which 4 / 159 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 673 edges and 157 vertex of which 153 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) 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 3 place count 153 transition count 289
Reduce places removed 1 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 1 with 3 rules applied. Total rules applied 6 place count 152 transition count 287
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 151 transition count 286
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 151 transition count 285
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 10 place count 150 transition count 285
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 45 place count 115 transition count 215
Iterating global reduction 3 with 35 rules applied. Total rules applied 80 place count 115 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 114 transition count 214
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 90 place count 110 transition count 232
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 110 transition count 232
Applied a total of 91 rules in 87 ms. Remains 110 /159 variables (removed 49) and now considering 232/307 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 110/159 places, 232/307 transitions.
RANDOM walk for 40000 steps (4672 resets) in 940 ms. (42 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1298 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (875 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (872 resets) in 256 ms. (155 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (809 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (852 resets) in 148 ms. (268 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (846 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (873 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (849 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (846 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
Invariant property HealthRecord-PT-11-ReachabilityCardinality-2024-05 does not hold.
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :174181 after 506497
Interrupted probabilistic random walk after 840684 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :1 out of 9
Probabilistic random walk after 840684 steps, saw 109837 distinct states, run finished after 3007 ms. (steps per millisecond=279 ) properties seen :1
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-24 03:14:40] [INFO ] Flow matrix only has 229 transitions (discarded 3 similar events)
// Phase 1: matrix 229 rows 110 cols
[2024-05-24 03:14:40] [INFO ] Computed 14 invariants in 4 ms
[2024-05-24 03:14:40] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 16/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 16/110 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 03:14:40] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 03:14:40] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 229/339 variables, 110/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 15/141 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/339 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 141 constraints, problems are : Problem set: 0 solved, 8 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 16/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 03:14:40] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 0 ms to minimize.
[2024-05-24 03:14:40] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 03:14:41] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:14:41] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 16/110 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 03:14:41] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:14:41] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:14:41] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:14:41] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:14:41] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:14:41] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:14:41] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:14:41] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:14:41] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 03:14:41] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:14:41] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:14:41] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 03:14:41] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:14:41] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 229/339 variables, 110/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/339 variables, 15/159 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/339 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/339 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 03:14:42] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 2 ms to minimize.
[2024-05-24 03:14:42] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-05-24 03:14:42] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:14:42] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:14:42] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:14:42] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:14:42] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/339 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 03:14:42] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/339 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 03:14:43] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:14:43] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/339 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/339 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/339 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 177 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2853 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 30/30 constraints]
After SMT, in 3327ms problems are : Problem set: 0 solved, 8 unsolved
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 605 ms.
Support contains 20 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 232/232 transitions.
Graph (trivial) has 72 edges and 110 vertex of which 2 / 110 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 498 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) 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 3 place count 104 transition count 229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 103 transition count 226
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 101 transition count 225
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 39 place count 72 transition count 167
Iterating global reduction 3 with 29 rules applied. Total rules applied 68 place count 72 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 72 transition count 165
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 71 transition count 163
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 71 transition count 163
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 82 place count 66 transition count 184
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 66 transition count 182
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 66 transition count 182
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 65 transition count 180
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 65 transition count 180
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 64 transition count 178
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 64 transition count 178
Applied a total of 89 rules in 45 ms. Remains 64 /110 variables (removed 46) and now considering 178/232 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 64/110 places, 178/232 transitions.
RANDOM walk for 40000 steps (5257 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1382 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16162 steps, run visited all 1 properties in 26 ms. (steps per millisecond=621 )
Probabilistic random walk after 16162 steps, saw 3457 distinct states, run finished after 30 ms. (steps per millisecond=538 ) properties seen :1
FORMULA HealthRecord-PT-11-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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 16165 ms.

BK_STOP 1716520484453

--------------------
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="HealthRecord-PT-11"
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 HealthRecord-PT-11, 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 r180-tall-171640604200782"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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