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.r303-tall-162124171300192.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 gold2020
Input is HealthRecord-PT-16, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171300192
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 127K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K 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 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.2K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 11 15:48 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 84K 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 1621342355973

[2021-05-18 12:52:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 12:52:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:52:38] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2021-05-18 12:52:38] [INFO ] Transformed 453 places.
[2021-05-18 12:52:38] [INFO ] Transformed 594 transitions.
[2021-05-18 12:52:38] [INFO ] Found NUPN structural information;
[2021-05-18 12:52:38] [INFO ] Parsed PT model containing 453 places and 594 transitions in 110 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 43 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 97 resets, run finished after 80 ms. (steps per millisecond=125 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA net-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA net-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 594 rows 453 cols
[2021-05-18 12:52:39] [INFO ] Computed 14 place invariants in 50 ms
[2021-05-18 12:52:39] [INFO ] [Real]Absence check using 8 positive place invariants in 75 ms returned sat
[2021-05-18 12:52:39] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 12 ms returned sat
[2021-05-18 12:52:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:52:39] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2021-05-18 12:52:40] [INFO ] Computed and/alt/rep : 593/1692/593 causal constraints in 48 ms.
[2021-05-18 12:52:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:52:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 173 ms returned sat
[2021-05-18 12:52:40] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 17 ms returned sat
[2021-05-18 12:52:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:52:41] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2021-05-18 12:52:41] [INFO ] Computed and/alt/rep : 593/1692/593 causal constraints in 31 ms.
[2021-05-18 12:52:45] [INFO ] Added : 436 causal constraints over 88 iterations in 3658 ms. Result :sat
[2021-05-18 12:52:45] [INFO ] Deduced a trap composed of 95 places in 173 ms
[2021-05-18 12:52:45] [INFO ] Deduced a trap composed of 95 places in 145 ms
[2021-05-18 12:52:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s89 s90 s91 s92 s214 s215 s216 s295 s296 s297 s298 s299 s300 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s319 s320 s321 s325 s326 s327 s334 s335 s339 s340 s341 s345 s346 s347 s370 s371 s372 s373 s374 s375 s376 s377 s378 s379 s380 s381 s382 s383 s384 s385 s393 s401 s403 s404 s409 s410 s413 s414 s415 s416 s417 s418 s419 s420 s423 s428 s429 s430 s434 s435 s436 s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s447) 0)") while checking expression at index 0
[2021-05-18 12:52:45] [INFO ] [Real]Absence check using 8 positive place invariants in 21 ms returned sat
[2021-05-18 12:52:45] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-18 12:52:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:52:46] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2021-05-18 12:52:46] [INFO ] Deduced a trap composed of 94 places in 166 ms
[2021-05-18 12:52:46] [INFO ] Deduced a trap composed of 109 places in 218 ms
[2021-05-18 12:52:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 438 ms
[2021-05-18 12:52:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:52:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 672 ms returned sat
[2021-05-18 12:52:47] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-18 12:52:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:52:47] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2021-05-18 12:52:48] [INFO ] Deduced a trap composed of 109 places in 139 ms
[2021-05-18 12:52:48] [INFO ] Deduced a trap composed of 187 places in 146 ms
[2021-05-18 12:52:48] [INFO ] Deduced a trap composed of 120 places in 137 ms
[2021-05-18 12:52:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 487 ms
[2021-05-18 12:52:48] [INFO ] Computed and/alt/rep : 593/1692/593 causal constraints in 37 ms.
[2021-05-18 12:52:51] [INFO ] Added : 429 causal constraints over 86 iterations in 2764 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2021-05-18 12:52:51] [INFO ] [Real]Absence check using 8 positive place invariants in 22 ms returned sat
[2021-05-18 12:52:51] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned unsat
[2021-05-18 12:52:51] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned sat
[2021-05-18 12:52:51] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2021-05-18 12:52:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:52:52] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2021-05-18 12:52:52] [INFO ] Computed and/alt/rep : 593/1692/593 causal constraints in 37 ms.
[2021-05-18 12:52:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:52:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 489 ms returned sat
[2021-05-18 12:52:52] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2021-05-18 12:52:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:52:53] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2021-05-18 12:52:53] [INFO ] Computed and/alt/rep : 593/1692/593 causal constraints in 30 ms.
[2021-05-18 12:52:56] [INFO ] Added : 409 causal constraints over 82 iterations in 2797 ms. Result :sat
[2021-05-18 12:52:56] [INFO ] Deduced a trap composed of 91 places in 142 ms
[2021-05-18 12:52:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
[2021-05-18 12:52:56] [INFO ] [Real]Absence check using 8 positive place invariants in 21 ms returned sat
[2021-05-18 12:52:56] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 12 ms returned sat
[2021-05-18 12:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:52:57] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2021-05-18 12:52:57] [INFO ] Deduced a trap composed of 129 places in 155 ms
[2021-05-18 12:52:57] [INFO ] Deduced a trap composed of 115 places in 134 ms
[2021-05-18 12:52:57] [INFO ] Deduced a trap composed of 123 places in 120 ms
[2021-05-18 12:52:58] [INFO ] Deduced a trap composed of 89 places in 123 ms
[2021-05-18 12:52:58] [INFO ] Deduced a trap composed of 95 places in 123 ms
[2021-05-18 12:52:58] [INFO ] Deduced a trap composed of 109 places in 121 ms
[2021-05-18 12:52:58] [INFO ] Deduced a trap composed of 102 places in 129 ms
[2021-05-18 12:52:58] [INFO ] Deduced a trap composed of 101 places in 126 ms
[2021-05-18 12:52:58] [INFO ] Deduced a trap composed of 99 places in 124 ms
[2021-05-18 12:52:58] [INFO ] Deduced a trap composed of 97 places in 124 ms
[2021-05-18 12:52:59] [INFO ] Deduced a trap composed of 96 places in 126 ms
[2021-05-18 12:52:59] [INFO ] Deduced a trap composed of 97 places in 127 ms
[2021-05-18 12:52:59] [INFO ] Deduced a trap composed of 102 places in 125 ms
[2021-05-18 12:52:59] [INFO ] Deduced a trap composed of 92 places in 124 ms
[2021-05-18 12:52:59] [INFO ] Deduced a trap composed of 95 places in 124 ms
[2021-05-18 12:52:59] [INFO ] Deduced a trap composed of 94 places in 124 ms
[2021-05-18 12:52:59] [INFO ] Deduced a trap composed of 92 places in 125 ms
[2021-05-18 12:53:00] [INFO ] Deduced a trap composed of 87 places in 124 ms
[2021-05-18 12:53:00] [INFO ] Deduced a trap composed of 94 places in 122 ms
[2021-05-18 12:53:00] [INFO ] Deduced a trap composed of 100 places in 121 ms
[2021-05-18 12:53:00] [INFO ] Deduced a trap composed of 96 places in 123 ms
[2021-05-18 12:53:00] [INFO ] Deduced a trap composed of 121 places in 120 ms
[2021-05-18 12:53:00] [INFO ] Deduced a trap composed of 100 places in 113 ms
[2021-05-18 12:53:00] [INFO ] Deduced a trap composed of 99 places in 116 ms
[2021-05-18 12:53:01] [INFO ] Deduced a trap composed of 97 places in 123 ms
[2021-05-18 12:53:01] [INFO ] Deduced a trap composed of 96 places in 123 ms
[2021-05-18 12:53:01] [INFO ] Deduced a trap composed of 97 places in 122 ms
[2021-05-18 12:53:01] [INFO ] Deduced a trap composed of 94 places in 125 ms
[2021-05-18 12:53:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s8 s9 s10 s278 s279 s292 s293 s294 s307 s308 s309 s310 s311 s312 s316 s317 s318 s319 s320 s321 s325 s326 s327 s334 s335 s339 s340 s341 s345 s346 s347 s367 s370 s371 s372 s373 s374 s375 s376 s377 s378 s381 s382 s383 s384 s385 s387 s388 s393 s395 s396 s401 s402 s403 s404 s405 s406 s407 s408 s409 s411 s412 s417 s418 s419 s420 s423 s428 s429 s430 s434 s435 s436 s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452) 0)") while checking expression at index 4
[2021-05-18 12:53:01] [INFO ] [Real]Absence check using 8 positive place invariants in 21 ms returned sat
[2021-05-18 12:53:01] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-18 12:53:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:53:02] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2021-05-18 12:53:02] [INFO ] Deduced a trap composed of 120 places in 161 ms
[2021-05-18 12:53:02] [INFO ] Deduced a trap composed of 93 places in 130 ms
[2021-05-18 12:53:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2021-05-18 12:53:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:53:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 677 ms returned sat
[2021-05-18 12:53:03] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-18 12:53:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:53:03] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2021-05-18 12:53:04] [INFO ] Deduced a trap composed of 93 places in 142 ms
[2021-05-18 12:53:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2021-05-18 12:53:04] [INFO ] Computed and/alt/rep : 593/1692/593 causal constraints in 39 ms.
[2021-05-18 12:53:06] [INFO ] Added : 424 causal constraints over 85 iterations in 2919 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2021-05-18 12:53:07] [INFO ] [Real]Absence check using 8 positive place invariants in 20 ms returned sat
[2021-05-18 12:53:07] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2021-05-18 12:53:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:53:07] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2021-05-18 12:53:07] [INFO ] Computed and/alt/rep : 593/1692/593 causal constraints in 28 ms.
[2021-05-18 12:53:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:53:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 521 ms returned sat
[2021-05-18 12:53:08] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2021-05-18 12:53:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:53:09] [INFO ] [Nat]Absence check using state equation in 615 ms returned sat
[2021-05-18 12:53:09] [INFO ] Deduced a trap composed of 122 places in 93 ms
[2021-05-18 12:53:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2021-05-18 12:53:09] [INFO ] Computed and/alt/rep : 593/1692/593 causal constraints in 28 ms.
[2021-05-18 12:53:12] [INFO ] Added : 416 causal constraints over 84 iterations in 2797 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
[2021-05-18 12:53:12] [INFO ] [Real]Absence check using 8 positive place invariants in 21 ms returned sat
[2021-05-18 12:53:12] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 11 ms returned sat
[2021-05-18 12:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:53:12] [INFO ] [Real]Absence check using state equation in 737 ms returned sat
[2021-05-18 12:53:13] [INFO ] Deduced a trap composed of 95 places in 110 ms
[2021-05-18 12:53:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 125 ms
[2021-05-18 12:53:13] [INFO ] [Real]Absence check using 8 positive place invariants in 20 ms returned sat
[2021-05-18 12:53:13] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 12:53:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:53:13] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2021-05-18 12:53:13] [INFO ] Computed and/alt/rep : 593/1692/593 causal constraints in 27 ms.
[2021-05-18 12:53:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:53:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 553 ms returned sat
[2021-05-18 12:53:14] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 12:53:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:53:14] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2021-05-18 12:53:15] [INFO ] Computed and/alt/rep : 593/1692/593 causal constraints in 30 ms.
[2021-05-18 12:53:18] [INFO ] Added : 471 causal constraints over 95 iterations in 3288 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2021-05-18 12:53:18] [INFO ] [Real]Absence check using 8 positive place invariants in 21 ms returned sat
[2021-05-18 12:53:18] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-18 12:53:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:53:18] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2021-05-18 12:53:19] [INFO ] Computed and/alt/rep : 593/1692/593 causal constraints in 28 ms.
[2021-05-18 12:53:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:53:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 546 ms returned sat
[2021-05-18 12:53:19] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 12:53:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:53:20] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2021-05-18 12:53:20] [INFO ] Computed and/alt/rep : 593/1692/593 causal constraints in 27 ms.
[2021-05-18 12:53:23] [INFO ] Added : 423 causal constraints over 85 iterations in 2609 ms. Result :sat
[2021-05-18 12:53:23] [INFO ] Deduced a trap composed of 123 places in 115 ms
[2021-05-18 12:53:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-18 12:53:23] [INFO ] [Real]Absence check using 8 positive place invariants in 20 ms returned sat
[2021-05-18 12:53:23] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-18 12:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:53:23] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2021-05-18 12:53:23] [INFO ] Computed and/alt/rep : 593/1692/593 causal constraints in 34 ms.
[2021-05-18 12:53:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:53:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 665 ms returned sat
[2021-05-18 12:53:24] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 12:53:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:53:25] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2021-05-18 12:53:25] [INFO ] Deduced a trap composed of 107 places in 138 ms
[2021-05-18 12:53:25] [INFO ] Deduced a trap composed of 94 places in 105 ms
[2021-05-18 12:53:25] [INFO ] Deduced a trap composed of 99 places in 130 ms
[2021-05-18 12:53:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 437 ms
[2021-05-18 12:53:25] [INFO ] Computed and/alt/rep : 593/1692/593 causal constraints in 31 ms.
[2021-05-18 12:53:29] [INFO ] Added : 433 causal constraints over 87 iterations in 3314 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-18 12:53:29] [INFO ] [Real]Absence check using 8 positive place invariants in 20 ms returned sat
[2021-05-18 12:53:29] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 13 ms returned sat
[2021-05-18 12:53:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:53:30] [INFO ] [Real]Absence check using state equation in 928 ms returned sat
[2021-05-18 12:53:30] [INFO ] Deduced a trap composed of 128 places in 142 ms
[2021-05-18 12:53:30] [INFO ] Deduced a trap composed of 93 places in 140 ms
[2021-05-18 12:53:30] [INFO ] Deduced a trap composed of 124 places in 138 ms
[2021-05-18 12:53:30] [INFO ] Deduced a trap composed of 102 places in 136 ms
[2021-05-18 12:53:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 664 ms
[2021-05-18 12:53:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:53:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 623 ms returned sat
[2021-05-18 12:53:31] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 12 ms returned sat
[2021-05-18 12:53:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:53:32] [INFO ] [Nat]Absence check using state equation in 929 ms returned sat
[2021-05-18 12:53:32] [INFO ] Deduced a trap composed of 99 places in 133 ms
[2021-05-18 12:53:32] [INFO ] Deduced a trap composed of 101 places in 132 ms
[2021-05-18 12:53:32] [INFO ] Deduced a trap composed of 96 places in 106 ms
[2021-05-18 12:53:32] [INFO ] Deduced a trap composed of 117 places in 101 ms
[2021-05-18 12:53:33] [INFO ] Deduced a trap composed of 98 places in 142 ms
[2021-05-18 12:53:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 735 ms
[2021-05-18 12:53:33] [INFO ] Computed and/alt/rep : 593/1692/593 causal constraints in 30 ms.
[2021-05-18 12:53:35] [INFO ] Added : 421 causal constraints over 85 iterations in 2595 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
[2021-05-18 12:53:35] [INFO ] [Real]Absence check using 8 positive place invariants in 20 ms returned unsat
[2021-05-18 12:53:35] [INFO ] [Real]Absence check using 8 positive place invariants in 20 ms returned sat
[2021-05-18 12:53:35] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 12:53:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:53:36] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2021-05-18 12:53:36] [INFO ] Deduced a trap composed of 91 places in 160 ms
[2021-05-18 12:53:36] [INFO ] Deduced a trap composed of 96 places in 110 ms
[2021-05-18 12:53:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2021-05-18 12:53:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:53:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 671 ms returned sat
[2021-05-18 12:53:37] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 12:53:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:53:38] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2021-05-18 12:53:38] [INFO ] Deduced a trap composed of 96 places in 107 ms
[2021-05-18 12:53:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2021-05-18 12:53:38] [INFO ] Computed and/alt/rep : 593/1692/593 causal constraints in 31 ms.
[2021-05-18 12:53:40] [INFO ] Added : 434 causal constraints over 87 iterations in 2714 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
FORMULA net-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA net-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 77900 steps, including 678 resets, run finished after 246 ms. (steps per millisecond=316 ) properties seen :[0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1] could not realise parikh vector
FORMULA net-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 66400 steps, including 581 resets, run finished after 163 ms. (steps per millisecond=407 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 83800 steps, including 744 resets, run finished after 201 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 67900 steps, including 588 resets, run finished after 162 ms. (steps per millisecond=419 ) properties seen :[0, 1, 0, 0, 0] could not realise parikh vector
FORMULA net-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 32900 steps, including 221 resets, run finished after 74 ms. (steps per millisecond=444 ) properties seen :[1, 0, 0, 0] could not realise parikh vector
FORMULA net-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 30900 steps, including 300 resets, run finished after 66 ms. (steps per millisecond=468 ) properties seen :[1, 0, 0] could not realise parikh vector
FORMULA net-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 77200 steps, including 675 resets, run finished after 159 ms. (steps per millisecond=485 ) properties seen :[0, 1] could not realise parikh vector
FORMULA net-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 453 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 533 edges and 453 vertex of which 47 / 453 are part of one of the 16 SCC in 5 ms
Free SCC test removed 31 places
Discarding 14 places :
Also discarding 22 output transitions
Drop transitions removed 22 transitions
Graph (complete) has 822 edges and 422 vertex of which 408 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.17 ms
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Performed 225 Post agglomeration using F-continuation condition.Transition count delta: 225
Iterating post reduction 0 with 259 rules applied. Total rules applied 261 place count 408 transition count 313
Reduce places removed 225 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 256 rules applied. Total rules applied 517 place count 183 transition count 282
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 530 place count 170 transition count 282
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 530 place count 170 transition count 273
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 548 place count 161 transition count 273
Symmetric choice reduction at 3 with 60 rule applications. Total rules 608 place count 161 transition count 273
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 119 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 728 place count 101 transition count 154
Symmetric choice reduction at 3 with 10 rule applications. Total rules 738 place count 101 transition count 154
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 20 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 758 place count 91 transition count 134
Symmetric choice reduction at 3 with 8 rule applications. Total rules 766 place count 91 transition count 134
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 782 place count 83 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 785 place count 83 transition count 123
Symmetric choice reduction at 4 with 3 rule applications. Total rules 788 place count 83 transition count 123
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 794 place count 80 transition count 117
Symmetric choice reduction at 4 with 3 rule applications. Total rules 797 place count 80 transition count 117
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 803 place count 77 transition count 111
Symmetric choice reduction at 4 with 3 rule applications. Total rules 806 place count 77 transition count 111
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 812 place count 74 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 814 place count 74 transition count 103
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 862 place count 50 transition count 78
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 867 place count 50 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 875 place count 46 transition count 113
Free-agglomeration rule applied 16 times with reduction of 2 identical transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 891 place count 46 transition count 95
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 907 place count 30 transition count 95
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 908 place count 30 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 909 place count 29 transition count 94
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 914 place count 29 transition count 94
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 915 place count 29 transition count 93
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 916 place count 29 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 917 place count 28 transition count 92
Applied a total of 917 rules in 117 ms. Remains 28 /453 variables (removed 425) and now considering 92/594 (removed 502) transitions.
[2021-05-18 12:53:42] [INFO ] Flow matrix only has 75 transitions (discarded 17 similar events)
// Phase 1: matrix 75 rows 28 cols
[2021-05-18 12:53:42] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-18 12:53:42] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned [84, 85, 86, 87, 88, 89]
Found 6 dead transitions using SMT.
Drop transitions removed 6 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 6 transitions :[89, 88, 87, 86, 85, 84]
Starting structural reductions, iteration 1 : 28/453 places, 86/594 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 107 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 26 transition count 85
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 26 transition count 85
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 26 transition count 85
Applied a total of 10 rules in 7 ms. Remains 26 /28 variables (removed 2) and now considering 85/86 (removed 1) transitions.
Finished structural reductions, in 2 iterations. Remains : 26/453 places, 85/594 transitions.
Finished random walk after 17082 steps, including 3342 resets, run visited all 1 properties in 61 ms. (steps per millisecond=280 )
FORMULA net-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621342424042

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-16"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is HealthRecord-PT-16, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r303-tall-162124171300192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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