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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 230K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 21:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 21:30 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 68K 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-09-ReachabilityCardinality-2024-00
FORMULA_NAME HealthRecord-PT-09-ReachabilityCardinality-2024-01
FORMULA_NAME HealthRecord-PT-09-ReachabilityCardinality-2024-02
FORMULA_NAME HealthRecord-PT-09-ReachabilityCardinality-2024-03
FORMULA_NAME HealthRecord-PT-09-ReachabilityCardinality-2024-04
FORMULA_NAME HealthRecord-PT-09-ReachabilityCardinality-2024-05
FORMULA_NAME HealthRecord-PT-09-ReachabilityCardinality-2024-06
FORMULA_NAME HealthRecord-PT-09-ReachabilityCardinality-2024-07
FORMULA_NAME HealthRecord-PT-09-ReachabilityCardinality-2024-08
FORMULA_NAME HealthRecord-PT-09-ReachabilityCardinality-2024-09
FORMULA_NAME HealthRecord-PT-09-ReachabilityCardinality-2024-10
FORMULA_NAME HealthRecord-PT-09-ReachabilityCardinality-2024-11
FORMULA_NAME HealthRecord-PT-09-ReachabilityCardinality-2024-12
FORMULA_NAME HealthRecord-PT-09-ReachabilityCardinality-2024-13
FORMULA_NAME HealthRecord-PT-09-ReachabilityCardinality-2024-14
FORMULA_NAME HealthRecord-PT-09-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716520111148

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-24 03:08:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:08:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:08:32] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-24 03:08:32] [INFO ] Transformed 157 places.
[2024-05-24 03:08:32] [INFO ] Transformed 327 transitions.
[2024-05-24 03:08:32] [INFO ] Found NUPN structural information;
[2024-05-24 03:08:32] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:08:33] [INFO ] Flatten gal took : 104 ms
[2024-05-24 03:08:33] [INFO ] Flatten gal took : 44 ms
[2024-05-24 03:08:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12062991728701763683.gal : 29 ms
[2024-05-24 03:08:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13400939103760644509.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12062991728701763683.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13400939103760644509.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 ...330
Loading property file /tmp/ReachabilityCardinality13400939103760644509.prop.
RANDOM walk for 40000 steps (2369 resets) in 2611 ms. (15 steps per ms) remains 12/15 properties
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :4 after 13
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :13 after 17
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :17 after 1153
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :1153 after 15553
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :15553 after 19009
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :19009 after 27073
BEST_FIRST walk for 40004 steps (345 resets) in 637 ms. (62 steps per ms) remains 11/12 properties
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (359 resets) in 220 ms. (181 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (350 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (344 resets) in 55 ms. (714 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (357 resets) in 581 ms. (68 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (353 resets) in 164 ms. (242 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (348 resets) in 135 ms. (294 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (336 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (365 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (27 resets) in 359 ms. (111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (356 resets) in 255 ms. (156 steps per ms) remains 11/11 properties
[2024-05-24 03:08:34] [INFO ] Flow matrix only has 289 transitions (discarded 12 similar events)
// Phase 1: matrix 289 rows 157 cols
[2024-05-24 03:08:34] [INFO ] Computed 18 invariants in 11 ms
[2024-05-24 03:08:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Reachability property HealthRecord-PT-09-ReachabilityCardinality-2024-12 is true.
Reachability property HealthRecord-PT-09-ReachabilityCardinality-2024-11 is true.
Invariant property HealthRecord-PT-09-ReachabilityCardinality-2024-09 does not hold.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem HealthRecord-PT-09-ReachabilityCardinality-2024-15 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 14/148 variables, 10/144 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 14/158 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem HealthRecord-PT-09-ReachabilityCardinality-2024-07 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 3/161 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/161 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem HealthRecord-PT-09-ReachabilityCardinality-2024-13 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-09-ReachabilityCardinality-2024-14 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 9/157 variables, 5/166 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 9/175 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/175 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 288/445 variables, 157/332 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/332 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/446 variables, 1/333 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/333 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/446 variables, 0/333 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 333 constraints, problems are : Problem set: 4 solved, 7 unsolved in 1399 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/89 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 33/122 variables, 10/99 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 33/132 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-24 03:08:36] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 12 ms to minimize.
[2024-05-24 03:08:36] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-05-24 03:08:36] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:08:36] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :27073 after 124609
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 10/142 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 3 ms to minimize.
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 3/145 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 6/151 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/151 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 35/157 variables, 8/159 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 35/194 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-24 03:08:38] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:08:38] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:08:38] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:08:38] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:08:38] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:08:38] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 6/200 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-24 03:08:38] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:08:38] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:08:38] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:08:38] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 4/204 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-24 03:08:38] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:08:38] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:08:38] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:08:38] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 3 ms to minimize.
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 6/210 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :124609 after 133825
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 7/217 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/157 variables, 1/218 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 1 ms to minimize.
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/157 variables, 3/221 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-24 03:08:40] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:08:40] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:08:40] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/157 variables, 3/224 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-24 03:08:40] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:08:40] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/157 variables, 2/226 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-24 03:08:40] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:08:40] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:08:40] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/157 variables, 3/229 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/157 variables, 0/229 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 288/445 variables, 157/386 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/445 variables, 7/393 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/445 variables, 0/393 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 1/446 variables, 1/394 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/446 variables, 0/394 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 394 constraints, problems are : Problem set: 4 solved, 7 unsolved in 5018 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/11 constraints, Known Traps: 54/54 constraints]
After SMT, in 6709ms problems are : Problem set: 4 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 89 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 301/301 transitions.
Graph (complete) has 665 edges and 157 vertex of which 153 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 153 transition count 288
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 44 place count 119 transition count 220
Iterating global reduction 1 with 34 rules applied. Total rules applied 78 place count 119 transition count 220
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 117 transition count 227
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 117 transition count 227
Applied a total of 83 rules in 64 ms. Remains 117 /157 variables (removed 40) and now considering 227/301 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 117/157 places, 227/301 transitions.
RANDOM walk for 40000 steps (2458 resets) in 512 ms. (77 steps per ms) remains 6/7 properties
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (408 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (408 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (391 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (387 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (387 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (400 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
// Phase 1: matrix 227 rows 117 cols
[2024-05-24 03:08:42] [INFO ] Computed 14 invariants in 4 ms
[2024-05-24 03:08:42] [INFO ] State equation strengthened by 4 read => feed constraints.
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :133825 after 152257
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 16/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 19/117 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 227/344 variables, 117/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/344 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 135 constraints, problems are : Problem set: 0 solved, 6 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 4/4 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/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 16/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 18 ms to minimize.
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 19/117 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:08:43] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 1 ms to minimize.
[2024-05-24 03:08:43] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2024-05-24 03:08:43] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 1 ms to minimize.
[2024-05-24 03:08:43] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2024-05-24 03:08:43] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:08:43] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:08:43] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 0 ms to minimize.
[2024-05-24 03:08:43] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:08:43] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 227/344 variables, 117/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:08:44] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:08:44] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:08:44] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 11 ms to minimize.
[2024-05-24 03:08:44] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:08:44] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/344 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:08:45] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/344 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:08:45] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
Invariant property HealthRecord-PT-09-ReachabilityCardinality-2024-01 does not hold.
[2024-05-24 03:08:45] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:08:45] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/344 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :152257 after 229441
At refinement iteration 17 (INCLUDED_ONLY) 0/344 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/344 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/344 variables, and 167 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4066 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 26/26 constraints]
After SMT, in 4368ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 779 ms.
Support contains 62 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 227/227 transitions.
Graph (trivial) has 45 edges and 117 vertex of which 6 / 117 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 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 0 with 2 rules applied. Total rules applied 3 place count 114 transition count 219
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 112 transition count 218
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 112 transition count 217
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 111 transition count 217
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 23 place count 96 transition count 187
Iterating global reduction 2 with 15 rules applied. Total rules applied 38 place count 96 transition count 187
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 43 place count 93 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 93 transition count 184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 48 place count 91 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 91 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 49 place count 91 transition count 183
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 51 place count 90 transition count 183
Applied a total of 51 rules in 46 ms. Remains 90 /117 variables (removed 27) and now considering 183/227 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 90/117 places, 183/227 transitions.
RANDOM walk for 40000 steps (4600 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (872 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (867 resets) in 156 ms. (254 steps per ms) remains 2/3 properties
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 183 rows 90 cols
[2024-05-24 03:08:47] [INFO ] Computed 13 invariants in 3 ms
[2024-05-24 03:08:47] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/77 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/90 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 183/273 variables, 90/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/273 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 110 constraints, problems are : Problem set: 0 solved, 2 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 90/90 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/77 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 03:08:47] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:08:47] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 03:08:47] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/90 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 03:08:47] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:08:47] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:08:47] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:08:47] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 03:08:47] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 183/273 variables, 90/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 7/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 03:08:48] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:08:48] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/273 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 122 constraints, problems are : Problem set: 0 solved, 2 unsolved in 848 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 90/90 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 1000ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 167 ms.
Support contains 61 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 183/183 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 90/90 places, 183/183 transitions.
RANDOM walk for 40000 steps (4581 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (855 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (850 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 937267 steps, run visited all 2 properties in 1395 ms. (steps per millisecond=671 )
Probabilistic random walk after 937267 steps, saw 123914 distinct states, run finished after 1399 ms. (steps per millisecond=669 ) properties seen :2
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-05 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 17748 ms.

BK_STOP 1716520130123

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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