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-171640604300823.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-16, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604300823
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:22 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 125K 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-16-ReachabilityFireability-2024-00
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-01
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-02
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-03
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-04
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-05
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-06
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-07
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-08
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-09
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-10
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-11
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-12
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-13
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-14
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716521265190

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-24 03:27:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:27:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:27:46] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-24 03:27:46] [INFO ] Transformed 453 places.
[2024-05-24 03:27:46] [INFO ] Transformed 594 transitions.
[2024-05-24 03:27:46] [INFO ] Found NUPN structural information;
[2024-05-24 03:27:46] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 03:27:47] [INFO ] Flatten gal took : 185 ms
[2024-05-24 03:27:47] [INFO ] Flatten gal took : 55 ms
RANDOM walk for 40000 steps (386 resets) in 2031 ms. (19 steps per ms) remains 13/16 properties
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-24 03:27:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4677288813234808749.gal : 45 ms
[2024-05-24 03:27:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6518464048412897935.prop : 3 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/ReachabilityCardinality4677288813234808749.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6518464048412897935.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 ...328
BEST_FIRST walk for 40004 steps (53 resets) in 448 ms. (89 steps per ms) remains 13/13 properties
Loading property file /tmp/ReachabilityCardinality6518464048412897935.prop.
BEST_FIRST walk for 40004 steps (73 resets) in 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (78 resets) in 177 ms. (224 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (70 resets) in 244 ms. (163 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (68 resets) in 59 ms. (666 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (54 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :11 after 24
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :24 after 48
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :48 after 138
BEST_FIRST walk for 40004 steps (67 resets) in 288 ms. (138 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :138 after 2550
BEST_FIRST walk for 40003 steps (66 resets) in 293 ms. (136 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (68 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (68 resets) in 72 ms. (547 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (67 resets) in 166 ms. (239 steps per ms) remains 11/13 properties
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (84 resets) in 109 ms. (363 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (67 resets) in 122 ms. (325 steps per ms) remains 11/11 properties
// Phase 1: matrix 594 rows 453 cols
[2024-05-24 03:27:48] [INFO ] Computed 14 invariants in 26 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 119/318 variables, 8/207 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 119/326 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 135/453 variables, 6/332 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 135/467 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 594/1047 variables, 453/920 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1047 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/1047 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 920 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1729 ms.
Refiners :[Domain max(s): 453/453 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem HealthRecord-PT-16-ReachabilityFireability-2024-13 is UNSAT
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 119/318 variables, 8/207 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 119/326 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-24 03:27:50] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 17 ms to minimize.
[2024-05-24 03:27:50] [INFO ] Deduced a trap composed of 109 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:27:50] [INFO ] Deduced a trap composed of 96 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:27:50] [INFO ] Deduced a trap composed of 107 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:27:50] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 1 ms to minimize.
[2024-05-24 03:27:51] [INFO ] Deduced a trap composed of 103 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:27:51] [INFO ] Deduced a trap composed of 105 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 7/333 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-24 03:27:51] [INFO ] Deduced a trap composed of 106 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 1/334 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/334 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem HealthRecord-PT-16-ReachabilityFireability-2024-00 is UNSAT
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 135/453 variables, 6/340 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 135/475 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-24 03:27:52] [INFO ] Deduced a trap composed of 118 places in 356 ms of which 3 ms to minimize.
[2024-05-24 03:27:52] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 2 ms to minimize.
Problem HealthRecord-PT-16-ReachabilityFireability-2024-02 is UNSAT
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-24 03:27:52] [INFO ] Deduced a trap composed of 110 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:27:52] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:27:52] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 2 ms to minimize.
[2024-05-24 03:27:52] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 3 ms to minimize.
[2024-05-24 03:27:52] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 7/482 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-05-24 03:27:53] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-05-24 03:27:53] [INFO ] Deduced a trap composed of 103 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:27:53] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-05-24 03:27:53] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 2 ms to minimize.
[2024-05-24 03:27:53] [INFO ] Deduced a trap composed of 116 places in 98 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 5/487 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 0/487 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 594/1047 variables, 453/940 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1047 variables, 8/948 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-05-24 03:27:54] [INFO ] Deduced a trap composed of 154 places in 105 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1047/1047 variables, and 949 constraints, problems are : Problem set: 3 solved, 8 unsolved in 5008 ms.
Refiners :[Domain max(s): 453/453 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 8/11 constraints, Known Traps: 21/21 constraints]
After SMT, in 6915ms problems are : Problem set: 3 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 122 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 238 edges and 453 vertex of which 22 / 453 are part of one of the 11 SCC in 3 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 850 edges and 442 vertex of which 432 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 432 transition count 477
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 98 rules applied. Total rules applied 192 place count 340 transition count 471
Reduce places removed 2 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 2 with 33 rules applied. Total rules applied 225 place count 338 transition count 440
Reduce places removed 31 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 3 with 33 rules applied. Total rules applied 258 place count 307 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 259 place count 306 transition count 438
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 259 place count 306 transition count 430
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 275 place count 298 transition count 430
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 310 place count 263 transition count 384
Iterating global reduction 5 with 35 rules applied. Total rules applied 345 place count 263 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 347 place count 263 transition count 382
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 351 place count 259 transition count 374
Iterating global reduction 6 with 4 rules applied. Total rules applied 355 place count 259 transition count 374
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 383 place count 245 transition count 360
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 387 place count 243 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 395 place count 243 transition count 363
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 6 with 2 rules applied. Total rules applied 397 place count 242 transition count 362
Free-agglomeration rule applied 18 times.
Iterating global reduction 6 with 18 rules applied. Total rules applied 415 place count 242 transition count 344
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 433 place count 224 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 434 place count 224 transition count 343
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 442 place count 224 transition count 343
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 445 place count 221 transition count 337
Iterating global reduction 7 with 3 rules applied. Total rules applied 448 place count 221 transition count 337
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 449 place count 221 transition count 336
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 450 place count 221 transition count 336
Applied a total of 450 rules in 194 ms. Remains 221 /453 variables (removed 232) and now considering 336/594 (removed 258) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 221/453 places, 336/594 transitions.
RANDOM walk for 40000 steps (875 resets) in 410 ms. (97 steps per ms) remains 7/8 properties
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (178 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (175 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (182 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (178 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (182 resets) in 30 ms. (1290 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (184 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (151 resets) in 138 ms. (287 steps per ms) remains 6/7 properties
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 336 rows 221 cols
[2024-05-24 03:27:55] [INFO ] Computed 7 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 123/220 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 335/555 variables, 220/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/557 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/557 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 228 constraints, problems are : Problem set: 0 solved, 6 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 123/220 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:27:56] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:27:56] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:27:56] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
[2024-05-24 03:27:56] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:27:56] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 2 ms to minimize.
[2024-05-24 03:27:56] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:27:56] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:27:56] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
[2024-05-24 03:27:56] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:27:56] [INFO ] Deduced a trap composed of 124 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:27:57] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:27:57] [INFO ] Deduced a trap composed of 104 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:27:57] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 1 ms to minimize.
[2024-05-24 03:27:57] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:27:57] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:27:57] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 335/555 variables, 220/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 5/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/557 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/557 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 250 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2494 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 16/16 constraints]
After SMT, in 2899ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 989 ms.
Support contains 87 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 336/336 transitions.
Graph (trivial) has 89 edges and 221 vertex of which 2 / 221 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 510 edges and 220 vertex of which 218 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 218 transition count 319
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 205 transition count 316
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 202 transition count 316
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 34 place count 202 transition count 313
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 40 place count 199 transition count 313
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 47 place count 192 transition count 301
Iterating global reduction 3 with 7 rules applied. Total rules applied 54 place count 192 transition count 301
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 72 place count 183 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 183 transition count 291
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
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 83 place count 178 transition count 294
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 91 place count 178 transition count 286
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 92 place count 177 transition count 285
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 177 transition count 285
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 177 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 176 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 176 transition count 283
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 97 place count 176 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 98 place count 175 transition count 284
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 104 place count 175 transition count 284
Applied a total of 104 rules in 60 ms. Remains 175 /221 variables (removed 46) and now considering 284/336 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 175/221 places, 284/336 transitions.
RANDOM walk for 40000 steps (1182 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (232 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (228 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (237 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 766426 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :0 out of 3
Probabilistic random walk after 766426 steps, saw 129515 distinct states, run finished after 3013 ms. (steps per millisecond=254 ) properties seen :0
// Phase 1: matrix 284 rows 175 cols
[2024-05-24 03:28:02] [INFO ] Computed 7 invariants in 2 ms
[2024-05-24 03:28:02] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 88/175 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 284/459 variables, 175/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/459 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 184 constraints, problems are : Problem set: 0 solved, 3 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 175/175 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 88/175 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 03:28:03] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:28:03] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:28:03] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 2 ms to minimize.
[2024-05-24 03:28:03] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:28:03] [INFO ] Deduced a trap composed of 53 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:28:03] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 03:28:03] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:28:03] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 284/459 variables, 175/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/459 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 195 constraints, problems are : Problem set: 0 solved, 3 unsolved in 994 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 175/175 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 1262ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 202 ms.
Support contains 40 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 284/284 transitions.
Graph (trivial) has 114 edges and 175 vertex of which 7 / 175 are part of one of the 2 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 170 transition count 261
Reduce places removed 15 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 18 rules applied. Total rules applied 34 place count 155 transition count 258
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 153 transition count 258
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 36 place count 153 transition count 253
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 46 place count 148 transition count 253
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 59 place count 135 transition count 234
Iterating global reduction 3 with 13 rules applied. Total rules applied 72 place count 135 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 72 place count 135 transition count 233
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 74 place count 134 transition count 233
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 131 transition count 226
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 131 transition count 226
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 129 transition count 220
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 129 transition count 220
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 106 place count 118 transition count 209
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 110 place count 118 transition count 205
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 126 place count 110 transition count 226
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 127 place count 109 transition count 221
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 109 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 131 place count 109 transition count 218
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 139 place count 109 transition count 210
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 147 place count 101 transition count 210
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 151 place count 101 transition count 206
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 101 transition count 206
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 153 place count 101 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 100 transition count 205
Applied a total of 154 rules in 57 ms. Remains 100 /175 variables (removed 75) and now considering 205/284 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 100/175 places, 205/284 transitions.
RANDOM walk for 40000 steps (1858 resets) in 401 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (384 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 477455 steps, run visited all 1 properties in 685 ms. (steps per millisecond=697 )
Probabilistic random walk after 477455 steps, saw 94038 distinct states, run finished after 688 ms. (steps per millisecond=693 ) properties seen :1
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-09 FALSE 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 18895 ms.

BK_STOP 1716521285305

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-16"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-16, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640604300823"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-16.tgz
mv HealthRecord-PT-16 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;