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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 20:21 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 175K 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-17-ReachabilityFireability-2024-00
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-01
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-02
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-03
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-04
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-05
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-06
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-07
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-08
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-09
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-10
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-11
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-12
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-13
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-14
FORMULA_NAME HealthRecord-PT-17-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716521848120

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-24 03:37:29] [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:37:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:37:29] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-24 03:37:29] [INFO ] Transformed 624 places.
[2024-05-24 03:37:29] [INFO ] Transformed 828 transitions.
[2024-05-24 03:37:29] [INFO ] Found NUPN structural information;
[2024-05-24 03:37:29] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 03:37:30] [INFO ] Flatten gal took : 192 ms
[2024-05-24 03:37:30] [INFO ] Flatten gal took : 134 ms
[2024-05-24 03:37:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality88221330966382354.gal : 41 ms
[2024-05-24 03:37:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16961811175591886063.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/ReachabilityCardinality88221330966382354.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16961811175591886063.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (344 resets) in 2707 ms. (14 steps per ms) remains 10/16 properties
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 ...327
Loading property file /tmp/ReachabilityCardinality16961811175591886063.prop.
BEST_FIRST walk for 40003 steps (58 resets) in 401 ms. (99 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (42 resets) in 132 ms. (300 steps per ms) remains 9/10 properties
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,16 properties remain. new max is 64
BEST_FIRST walk for 40004 steps (57 resets) in 435 ms. (91 steps per ms) remains 9/9 properties
SDD size :16 after 27
Reachability property HealthRecord-PT-17-ReachabilityFireability-2024-04 is true.
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :27 after 55
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :55 after 57
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :57 after 669
BEST_FIRST walk for 40004 steps (56 resets) in 433 ms. (92 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (58 resets) in 145 ms. (274 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (57 resets) in 204 ms. (195 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (41 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (58 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (56 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
// Phase 1: matrix 828 rows 624 cols
[2024-05-24 03:37:31] [INFO ] Computed 18 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 153/310 variables, 10/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 153/320 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem HealthRecord-PT-17-ReachabilityFireability-2024-10 is UNSAT
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-17-ReachabilityFireability-2024-12 is UNSAT
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 314/624 variables, 8/328 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 314/642 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 0/642 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 828/1452 variables, 624/1266 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1452 variables, 0/1266 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1452 variables, 0/1266 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1452/1452 variables, and 1266 constraints, problems are : Problem set: 2 solved, 7 unsolved in 1477 ms.
Refiners :[Domain max(s): 624/624 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem HealthRecord-PT-17-ReachabilityFireability-2024-14 is UNSAT
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 168/262 variables, 10/104 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 168/272 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-24 03:37:33] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 17 ms to minimize.
[2024-05-24 03:37:33] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:37:33] [INFO ] Deduced a trap composed of 93 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:37:33] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:37:33] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:37:33] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:37:33] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:37:33] [INFO ] Deduced a trap composed of 96 places in 65 ms of which 1 ms to minimize.
Problem HealthRecord-PT-17-ReachabilityFireability-2024-08 is UNSAT
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-24 03:37:33] [INFO ] Deduced a trap composed of 108 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 9/281 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/281 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 362/624 variables, 8/289 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 362/651 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-24 03:37:34] [INFO ] Deduced a trap composed of 126 places in 141 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/624 variables, 1/652 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-24 03:37:34] [INFO ] Deduced a trap composed of 116 places in 111 ms of which 2 ms to minimize.
[2024-05-24 03:37:34] [INFO ] Deduced a trap composed of 135 places in 125 ms of which 2 ms to minimize.
[2024-05-24 03:37:34] [INFO ] Deduced a trap composed of 135 places in 110 ms of which 3 ms to minimize.
[2024-05-24 03:37:34] [INFO ] Deduced a trap composed of 135 places in 147 ms of which 3 ms to minimize.
[2024-05-24 03:37:34] [INFO ] Deduced a trap composed of 118 places in 162 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/624 variables, 5/657 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/624 variables, 0/657 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 828/1452 variables, 624/1281 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1452 variables, 5/1286 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-24 03:37:35] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-05-24 03:37:36] [INFO ] Deduced a trap composed of 121 places in 163 ms of which 3 ms to minimize.
[2024-05-24 03:37:36] [INFO ] Deduced a trap composed of 137 places in 80 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1452 variables, 3/1289 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-24 03:37:36] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:37:36] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 3 ms to minimize.
[2024-05-24 03:37:36] [INFO ] Deduced a trap composed of 136 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:37:37] [INFO ] Deduced a trap composed of 117 places in 113 ms of which 3 ms to minimize.
[2024-05-24 03:37:37] [INFO ] Deduced a trap composed of 118 places in 131 ms of which 3 ms to minimize.
[2024-05-24 03:37:37] [INFO ] Deduced a trap composed of 131 places in 75 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1452 variables, 6/1295 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1452 variables, 0/1295 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1452/1452 variables, and 1295 constraints, problems are : Problem set: 4 solved, 5 unsolved in 5011 ms.
Refiners :[Domain max(s): 624/624 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 24/24 constraints]
After SMT, in 6714ms problems are : Problem set: 4 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 538 edges and 624 vertex of which 32 / 624 are part of one of the 16 SCC in 4 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 1264 edges and 608 vertex of which 593 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.2 ms
Discarding 15 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 199 place count 593 transition count 593
Reduce places removed 197 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 218 rules applied. Total rules applied 417 place count 396 transition count 572
Reduce places removed 8 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 2 with 37 rules applied. Total rules applied 454 place count 388 transition count 543
Reduce places removed 29 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 31 rules applied. Total rules applied 485 place count 359 transition count 541
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 486 place count 358 transition count 541
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 486 place count 358 transition count 532
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 504 place count 349 transition count 532
Discarding 100 places :
Symmetric choice reduction at 5 with 100 rule applications. Total rules 604 place count 249 transition count 410
Iterating global reduction 5 with 100 rules applied. Total rules applied 704 place count 249 transition count 410
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 714 place count 249 transition count 400
Discarding 37 places :
Symmetric choice reduction at 6 with 37 rule applications. Total rules 751 place count 212 transition count 327
Iterating global reduction 6 with 37 rules applied. Total rules applied 788 place count 212 transition count 327
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 793 place count 207 transition count 317
Iterating global reduction 6 with 5 rules applied. Total rules applied 798 place count 207 transition count 317
Performed 43 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 884 place count 164 transition count 271
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 891 place count 164 transition count 264
Performed 10 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 911 place count 154 transition count 338
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 917 place count 154 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 920 place count 154 transition count 329
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 921 place count 153 transition count 328
Iterating global reduction 8 with 1 rules applied. Total rules applied 922 place count 153 transition count 328
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 930 place count 153 transition count 320
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 938 place count 145 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 939 place count 145 transition count 319
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 953 place count 145 transition count 319
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 954 place count 144 transition count 317
Iterating global reduction 9 with 1 rules applied. Total rules applied 955 place count 144 transition count 317
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 956 place count 143 transition count 316
Iterating global reduction 9 with 1 rules applied. Total rules applied 957 place count 143 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 958 place count 143 transition count 315
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 959 place count 143 transition count 315
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 960 place count 142 transition count 314
Applied a total of 960 rules in 217 ms. Remains 142 /624 variables (removed 482) and now considering 314/828 (removed 514) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 142/624 places, 314/828 transitions.
RANDOM walk for 40000 steps (1702 resets) in 338 ms. (117 steps per ms) remains 3/5 properties
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (338 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (335 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (345 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
[2024-05-24 03:37:38] [INFO ] Flow matrix only has 308 transitions (discarded 6 similar events)
// Phase 1: matrix 308 rows 142 cols
[2024-05-24 03:37:38] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:37:38] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/142 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 308/450 variables, 142/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 155 constraints, problems are : Problem set: 0 solved, 3 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 142/142 constraints, ReadFeed: 4/4 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/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/142 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 03:37:38] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2024-05-24 03:37:38] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-24 03:37:38] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-05-24 03:37:39] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:37:39] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:37:39] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:37:39] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:37:39] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:37:39] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 03:37:39] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 4 ms to minimize.
[2024-05-24 03:37:39] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:37:39] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:37:39] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:37:39] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 03:37:39] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:37:39] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 308/450 variables, 142/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 03:37:40] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/450 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/450 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/450 variables, and 175 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1874 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 142/142 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 17/17 constraints]
After SMT, in 2095ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 607 ms.
Support contains 23 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 314/314 transitions.
Graph (trivial) has 72 edges and 142 vertex of which 6 / 142 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 497 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 138 transition count 301
Reduce places removed 6 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 132 transition count 297
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 22 place count 128 transition count 297
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 22 place count 128 transition count 294
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 125 transition count 294
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 33 place count 120 transition count 285
Iterating global reduction 3 with 5 rules applied. Total rules applied 38 place count 120 transition count 285
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 56 place count 111 transition count 276
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 66 place count 111 transition count 266
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 74 place count 107 transition count 272
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 77 place count 104 transition count 260
Iterating global reduction 4 with 3 rules applied. Total rules applied 80 place count 104 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 104 transition count 259
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 84 place count 101 transition count 252
Iterating global reduction 5 with 3 rules applied. Total rules applied 87 place count 101 transition count 252
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 89 place count 101 transition count 250
Free-agglomeration rule applied 11 times.
Iterating global reduction 6 with 11 rules applied. Total rules applied 100 place count 101 transition count 239
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 112 place count 90 transition count 238
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 116 place count 90 transition count 238
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 117 place count 89 transition count 233
Iterating global reduction 7 with 1 rules applied. Total rules applied 118 place count 89 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 121 place count 89 transition count 230
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 122 place count 88 transition count 229
Iterating global reduction 8 with 1 rules applied. Total rules applied 123 place count 88 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 124 place count 88 transition count 228
Applied a total of 124 rules in 73 ms. Remains 88 /142 variables (removed 54) and now considering 228/314 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 88/142 places, 228/314 transitions.
RANDOM walk for 40000 steps (65 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (22 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (74 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 879459 steps, run visited all 2 properties in 1727 ms. (steps per millisecond=509 )
Probabilistic random walk after 879459 steps, saw 183417 distinct states, run finished after 1738 ms. (steps per millisecond=506 ) properties seen :2
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-17-ReachabilityFireability-2024-02 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 13845 ms.

BK_STOP 1716521863160

--------------------
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-17"
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-17, 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-171640604300831"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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