fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r292-tall-162124156300319
Last Updated
Jun 28, 2021

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
254.796 7898.00 15587.00 95.50 TFTFFTFFTTTTFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156300319.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HealthRecord-PT-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156300319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.0K May 11 18:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 49K May 12 08:13 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 net-ReachabilityFireability-00
FORMULA_NAME net-ReachabilityFireability-01
FORMULA_NAME net-ReachabilityFireability-02
FORMULA_NAME net-ReachabilityFireability-03
FORMULA_NAME net-ReachabilityFireability-04
FORMULA_NAME net-ReachabilityFireability-05
FORMULA_NAME net-ReachabilityFireability-06
FORMULA_NAME net-ReachabilityFireability-07
FORMULA_NAME net-ReachabilityFireability-08
FORMULA_NAME net-ReachabilityFireability-09
FORMULA_NAME net-ReachabilityFireability-10
FORMULA_NAME net-ReachabilityFireability-11
FORMULA_NAME net-ReachabilityFireability-12
FORMULA_NAME net-ReachabilityFireability-13
FORMULA_NAME net-ReachabilityFireability-14
FORMULA_NAME net-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621281565127

Running Version 0
[2021-05-17 19:59:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 19:59:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 19:59:26] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-17 19:59:26] [INFO ] Transformed 156 places.
[2021-05-17 19:59:26] [INFO ] Transformed 326 transitions.
[2021-05-17 19:59:26] [INFO ] Found NUPN structural information;
[2021-05-17 19:59:26] [INFO ] Parsed PT model containing 156 places and 326 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Incomplete random walk after 10000 steps, including 546 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :3
FORMULA net-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 121 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :1
FORMULA net-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 121 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :2
FORMULA net-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA net-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2021-05-17 19:59:27] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
// Phase 1: matrix 288 rows 156 cols
[2021-05-17 19:59:27] [INFO ] Computed 18 place invariants in 15 ms
[2021-05-17 19:59:27] [INFO ] [Real]Absence check using 10 positive place invariants in 25 ms returned sat
[2021-05-17 19:59:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-17 19:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:27] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-17 19:59:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:59:27] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:59:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:59:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 19:59:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-17 19:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:27] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-17 19:59:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-17 19:59:27] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 28 ms.
[2021-05-17 19:59:27] [INFO ] Added : 82 causal constraints over 17 iterations in 291 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-17 19:59:27] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 19:59:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:27] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-17 19:59:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:59:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 19:59:28] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:59:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:28] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-17 19:59:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:59:28] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 26 ms.
[2021-05-17 19:59:28] [INFO ] Added : 86 causal constraints over 18 iterations in 263 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-17 19:59:28] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 19:59:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:28] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-17 19:59:28] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:59:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:59:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 19:59:28] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:59:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:28] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2021-05-17 19:59:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:59:28] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2021-05-17 19:59:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2021-05-17 19:59:28] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 19 ms.
[2021-05-17 19:59:28] [INFO ] Added : 83 causal constraints over 18 iterations in 255 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-17 19:59:28] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 19:59:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned unsat
[2021-05-17 19:59:29] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 19:59:29] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:59:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:29] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-17 19:59:29] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 19:59:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:59:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 19:59:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:29] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-17 19:59:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:59:29] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 16 ms.
[2021-05-17 19:59:29] [INFO ] Added : 85 causal constraints over 17 iterations in 241 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-17 19:59:29] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 19:59:29] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:59:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:29] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-17 19:59:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:59:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 19:59:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:29] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-17 19:59:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:59:29] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 18 ms.
[2021-05-17 19:59:29] [INFO ] Added : 89 causal constraints over 19 iterations in 276 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-17 19:59:30] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:30] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:59:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:59:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:30] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:59:30] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 18 ms.
[2021-05-17 19:59:30] [INFO ] Added : 84 causal constraints over 17 iterations in 228 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-17 19:59:30] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:30] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-17 19:59:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:59:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:30] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-17 19:59:30] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 0 ms to minimize.
[2021-05-17 19:59:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2021-05-17 19:59:30] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:30] [INFO ] [Real]Absence check using state equation in 41 ms returned unsat
[2021-05-17 19:59:30] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:30] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-17 19:59:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:59:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:59:30] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2021-05-17 19:59:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:59:30] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 17 ms.
[2021-05-17 19:59:31] [INFO ] Added : 92 causal constraints over 19 iterations in 269 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
FORMULA net-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 7 different solutions.
Incomplete Parikh walk after 18200 steps, including 990 resets, run finished after 81 ms. (steps per millisecond=224 ) properties (out of 7) seen :5 could not realise parikh vector
FORMULA net-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 19600 steps, including 738 resets, run finished after 75 ms. (steps per millisecond=261 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA net-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 19000 steps, including 426 resets, run finished after 60 ms. (steps per millisecond=316 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 19100 steps, including 930 resets, run finished after 61 ms. (steps per millisecond=313 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 19600 steps, including 701 resets, run finished after 58 ms. (steps per millisecond=337 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 18700 steps, including 865 resets, run finished after 60 ms. (steps per millisecond=311 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 20400 steps, including 705 resets, run finished after 59 ms. (steps per millisecond=345 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 13 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 300/300 transitions.
Graph (trivial) has 159 edges and 156 vertex of which 12 / 156 are part of one of the 6 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 650 edges and 150 vertex of which 141 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions 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 141 transition count 269
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 135 transition count 263
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 20 place count 135 transition count 260
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 130 transition count 260
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 102 place count 56 transition count 113
Iterating global reduction 2 with 74 rules applied. Total rules applied 176 place count 56 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 177 place count 56 transition count 112
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 186 place count 47 transition count 94
Iterating global reduction 3 with 9 rules applied. Total rules applied 195 place count 47 transition count 94
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 203 place count 47 transition count 86
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 205 place count 45 transition count 80
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 45 transition count 80
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 209 place count 43 transition count 76
Iterating global reduction 4 with 2 rules applied. Total rules applied 211 place count 43 transition count 76
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 217 place count 43 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 221 place count 41 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 225 place count 39 transition count 76
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 226 place count 39 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 227 place count 38 transition count 75
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 237 place count 38 transition count 75
Applied a total of 237 rules in 53 ms. Remains 38 /156 variables (removed 118) and now considering 75/300 (removed 225) transitions.
Finished structural reductions, in 1 iterations. Remains : 38/156 places, 75/300 transitions.
[2021-05-17 19:59:31] [INFO ] Flatten gal took : 39 ms
[2021-05-17 19:59:31] [INFO ] Flatten gal took : 12 ms
[2021-05-17 19:59:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10272904465590081311.gal : 8 ms
[2021-05-17 19:59:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16928828201481699436.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality10272904465590081311.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16928828201481699436.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality10272904465590081311.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16928828201481699436.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16928828201481699436.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 21
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :21 after 87
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :87 after 239
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :239 after 547
Reachability property net-ReachabilityFireability-13 is true.
FORMULA net-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4811,0.0516,4888,2,485,12,4459,6,0,226,4054,0
Total reachable state count : 4811

Verifying 1 reachability properties.
Reachability property net-ReachabilityFireability-13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
net-ReachabilityFireability-13,8,0.058114,5152,2,68,12,4459,7,0,262,4054,0
All properties solved without resorting to model-checking.

BK_STOP 1621281573025

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-08"
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-4028"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-08, 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 r292-tall-162124156300319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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