Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 74M
-rw-r--r-- 1 mcc users 9.7K Jun 7 17:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 7 17:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 7 17:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 6 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 13K Jun 7 17:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Jun 7 17:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 7 17:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Jun 7 17:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 73M Jun 6 12:11 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 RERS2020-PT-pb108-ReachabilityFireability-00
FORMULA_NAME RERS2020-PT-pb108-ReachabilityFireability-01
FORMULA_NAME RERS2020-PT-pb108-ReachabilityFireability-02
FORMULA_NAME RERS2020-PT-pb108-ReachabilityFireability-03
FORMULA_NAME RERS2020-PT-pb108-ReachabilityFireability-04
FORMULA_NAME RERS2020-PT-pb108-ReachabilityFireability-05
FORMULA_NAME RERS2020-PT-pb108-ReachabilityFireability-06
FORMULA_NAME RERS2020-PT-pb108-ReachabilityFireability-07
FORMULA_NAME RERS2020-PT-pb108-ReachabilityFireability-08
FORMULA_NAME RERS2020-PT-pb108-ReachabilityFireability-09
FORMULA_NAME RERS2020-PT-pb108-ReachabilityFireability-10
FORMULA_NAME RERS2020-PT-pb108-ReachabilityFireability-11
FORMULA_NAME RERS2020-PT-pb108-ReachabilityFireability-12
FORMULA_NAME RERS2020-PT-pb108-ReachabilityFireability-13
FORMULA_NAME RERS2020-PT-pb108-ReachabilityFireability-14
FORMULA_NAME RERS2020-PT-pb108-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654922088057

Running Version 202205111006
[2022-06-11 04:34:49] [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]
[2022-06-11 04:34:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 04:34:52] [INFO ] Load time of PNML (sax parser for PT used): 2534 ms
[2022-06-11 04:34:52] [INFO ] Transformed 2339 places.
[2022-06-11 04:34:52] [INFO ] Transformed 132214 transitions.
[2022-06-11 04:34:52] [INFO ] Found NUPN structural information;
[2022-06-11 04:34:52] [INFO ] Parsed PT model containing 2339 places and 132214 transitions in 3120 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 55 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 7505 transitions
Reduce redundant transitions removed 7505 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1688 ms. (steps per millisecond=5 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 5689 steps, run timeout after 6003 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 5689 steps, saw 2154 distinct states, run finished after 6008 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 16 properties.
[2022-06-11 04:35:01] [INFO ] Flow matrix only has 90843 transitions (discarded 33866 similar events)
// Phase 1: matrix 90843 rows 2339 cols
[2022-06-11 04:35:02] [INFO ] Computed 29 place invariants in 535 ms
[2022-06-11 04:35:03] [INFO ] After 1223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-06-11 04:35:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 28 ms returned sat
[2022-06-11 04:35:04] [INFO ] [Nat]Absence check using 15 positive and 14 generalized place invariants in 4 ms returned sat
[2022-06-11 04:35:28] [INFO ] After 23438ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :13
[2022-06-11 04:35:30] [INFO ] State equation strengthened by 5501 read => feed constraints.
[2022-06-11 04:35:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 04:35:30] [INFO ] After 26902ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
FORMULA RERS2020-PT-pb108-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RERS2020-PT-pb108-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 289 out of 2339 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2339/2339 places, 124709/124709 transitions.
Ensure Unique test removed 14 places
Drop transitions removed 3022 transitions
Reduce isomorphic transitions removed 3022 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 3041 rules applied. Total rules applied 3041 place count 2325 transition count 121682
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 3049 place count 2320 transition count 121679
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3049 place count 2320 transition count 121677
Deduced a syphon composed of 2 places in 109 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 3053 place count 2318 transition count 121677
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3054 place count 2317 transition count 121582
Iterating global reduction 2 with 1 rules applied. Total rules applied 3055 place count 2317 transition count 121582
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 79 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 3157 place count 2266 transition count 121531
Ensure Unique test removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Iterating post reduction 2 with 169 rules applied. Total rules applied 3326 place count 2266 transition count 121362
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 17 places in 96 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3360 place count 2249 transition count 121384
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 3375 place count 2249 transition count 121369
Free-agglomeration rule applied 55 times.
Iterating global reduction 4 with 55 rules applied. Total rules applied 3430 place count 2249 transition count 121314
Reduce places removed 55 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 188 transitions
Reduce isomorphic transitions removed 191 transitions.
Iterating post reduction 4 with 246 rules applied. Total rules applied 3676 place count 2194 transition count 121123
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 3679 place count 2194 transition count 121120
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 3683 place count 2191 transition count 121119
Free-agglomeration rule (complex) applied 161 times with reduction of 11800 identical transitions.
Iterating global reduction 6 with 161 rules applied. Total rules applied 3844 place count 2191 transition count 154245
Reduce places removed 161 places and 0 transitions.
Drop transitions removed 175 transitions
Ensure Unique test removed 7871 transitions
Reduce isomorphic transitions removed 8046 transitions.
Iterating post reduction 6 with 8207 rules applied. Total rules applied 12051 place count 2030 transition count 146199
Applied a total of 12051 rules in 9861 ms. Remains 2030 /2339 variables (removed 309) and now considering 146199/124709 (removed -21490) transitions.
Finished structural reductions, in 1 iterations. Remains : 2030/2339 places, 146199/124709 transitions.
Interrupted random walk after 236829 steps, including 8 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 0
Interrupted Best-First random walk after 261901 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=52 ) properties seen 0
Interrupted Best-First random walk after 284836 steps, including 3 resets, run timeout after 5001 ms. (steps per millisecond=56 ) properties seen 0
Interrupted Best-First random walk after 269867 steps, including 4 resets, run timeout after 5001 ms. (steps per millisecond=53 ) properties seen 0
Interrupted Best-First random walk after 235807 steps, including 22 resets, run timeout after 5002 ms. (steps per millisecond=47 ) properties seen 0
Interrupted Best-First random walk after 300057 steps, including 25 resets, run timeout after 5001 ms. (steps per millisecond=59 ) properties seen 0
Interrupted Best-First random walk after 271670 steps, including 7 resets, run timeout after 5001 ms. (steps per millisecond=54 ) properties seen 0
Interrupted Best-First random walk after 315819 steps, including 3 resets, run timeout after 5001 ms. (steps per millisecond=63 ) properties seen 0
Interrupted Best-First random walk after 290357 steps, including 4 resets, run timeout after 5001 ms. (steps per millisecond=58 ) properties seen 0
Interrupted Best-First random walk after 231291 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=46 ) properties seen 0
Interrupted Best-First random walk after 357934 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=71 ) properties seen 0
Interrupted Best-First random walk after 311803 steps, including 17 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted Best-First random walk after 329359 steps, including 8 resets, run timeout after 5001 ms. (steps per millisecond=65 ) properties seen 0
Interrupted Best-First random walk after 333754 steps, including 4 resets, run timeout after 5001 ms. (steps per millisecond=66 ) properties seen 0
Interrupted Best-First random walk after 344126 steps, including 13 resets, run timeout after 5001 ms. (steps per millisecond=68 ) properties seen 0
Interrupted probabilistic random walk after 339970 steps, run timeout after 300004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 339970 steps, saw 54374 distinct states, run finished after 300005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 14 properties.
[2022-06-11 04:42:20] [INFO ] Flow matrix only has 114535 transitions (discarded 31664 similar events)
// Phase 1: matrix 114535 rows 2030 cols
[2022-06-11 04:42:21] [INFO ] Computed 15 place invariants in 895 ms
[2022-06-11 04:42:22] [INFO ] After 680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-06-11 04:42:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 25 ms returned sat
[2022-06-11 04:43:19] [INFO ] After 56315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-06-11 04:43:21] [INFO ] State equation strengthened by 6685 read => feed constraints.
[2022-06-11 04:43:56] [INFO ] After 35681ms SMT Verify possible using 6685 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2022-06-11 04:44:11] [INFO ] Deduced a trap composed of 21 places in 12294 ms of which 36 ms to minimize.
[2022-06-11 04:44:26] [INFO ] Deduced a trap composed of 57 places in 13394 ms of which 3 ms to minimize.
[2022-06-11 04:44:38] [INFO ] Deduced a trap composed of 281 places in 11286 ms of which 2 ms to minimize.
[2022-06-11 04:44:51] [INFO ] Deduced a trap composed of 69 places in 11174 ms of which 4 ms to minimize.
[2022-06-11 04:45:04] [INFO ] Deduced a trap composed of 135 places in 11461 ms of which 2 ms to minimize.
[2022-06-11 04:45:17] [INFO ] Deduced a trap composed of 53 places in 11465 ms of which 1 ms to minimize.
[2022-06-11 04:45:30] [INFO ] Deduced a trap composed of 62 places in 11353 ms of which 2 ms to minimize.
[2022-06-11 04:45:42] [INFO ] Deduced a trap composed of 282 places in 10131 ms of which 2 ms to minimize.
[2022-06-11 04:45:55] [INFO ] Deduced a trap composed of 229 places in 11594 ms of which 3 ms to minimize.
[2022-06-11 04:46:09] [INFO ] Deduced a trap composed of 213 places in 11839 ms of which 2 ms to minimize.
[2022-06-11 04:46:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 04:46:09] [INFO ] After 226634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 289 out of 2030 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2030/2030 places, 146199/146199 transitions.
Applied a total of 0 rules in 757 ms. Remains 2030 /2030 variables (removed 0) and now considering 146199/146199 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2030/2030 places, 146199/146199 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2030/2030 places, 146199/146199 transitions.
Applied a total of 0 rules in 735 ms. Remains 2030 /2030 variables (removed 0) and now considering 146199/146199 (removed 0) transitions.
[2022-06-11 04:46:10] [INFO ] Flow matrix only has 114535 transitions (discarded 31664 similar events)
// Phase 1: matrix 114535 rows 2030 cols
[2022-06-11 04:46:11] [INFO ] Computed 15 place invariants in 789 ms
[2022-06-11 04:46:15] [INFO ] Implicit Places using invariants in 5181 ms returned []
Implicit Place search using SMT only with invariants took 5183 ms to find 0 implicit places.
[2022-06-11 04:46:15] [INFO ] Flow matrix only has 114535 transitions (discarded 31664 similar events)
// Phase 1: matrix 114535 rows 2030 cols
[2022-06-11 04:46:16] [INFO ] Computed 15 place invariants in 957 ms
[2022-06-11 04:46:46] [INFO ] Performed 79218/146199 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 04:47:10] [INFO ] Dead Transitions using invariants and state equation in 54838 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2030/2030 places, 146199/146199 transitions.
Interrupted random walk after 258435 steps, including 9 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 356606 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=71 ) properties seen 0
Interrupted Best-First random walk after 346704 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=69 ) properties seen 0
Interrupted Best-First random walk after 322151 steps, including 15 resets, run timeout after 5001 ms. (steps per millisecond=64 ) properties seen 0
Interrupted Best-First random walk after 241059 steps, including 15 resets, run timeout after 5001 ms. (steps per millisecond=48 ) properties seen 0
Interrupted Best-First random walk after 372990 steps, including 6 resets, run timeout after 5001 ms. (steps per millisecond=74 ) properties seen 0
Interrupted Best-First random walk after 310882 steps, including 6 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted Best-First random walk after 380255 steps, including 14 resets, run timeout after 5002 ms. (steps per millisecond=76 ) properties seen 0
Interrupted Best-First random walk after 434531 steps, including 4 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen 0
Interrupted Best-First random walk after 262523 steps, including 15 resets, run timeout after 5001 ms. (steps per millisecond=52 ) properties seen 0
Interrupted Best-First random walk after 360813 steps, including 17 resets, run timeout after 5001 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 312062 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted Best-First random walk after 339853 steps, including 33 resets, run timeout after 5002 ms. (steps per millisecond=67 ) properties seen 0
Interrupted Best-First random walk after 313214 steps, including 14 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted Best-First random walk after 311380 steps, including 7 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted probabilistic random walk after 325257 steps, run timeout after 300007 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 325257 steps, saw 52385 distinct states, run finished after 300010 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 14 properties.
[2022-06-11 04:53:50] [INFO ] Flow matrix only has 114535 transitions (discarded 31664 similar events)
// Phase 1: matrix 114535 rows 2030 cols
[2022-06-11 04:53:51] [INFO ] Computed 15 place invariants in 879 ms
[2022-06-11 04:53:52] [INFO ] After 652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-06-11 04:53:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 21 ms returned sat
[2022-06-11 04:54:50] [INFO ] After 56543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-06-11 04:54:50] [INFO ] State equation strengthened by 6685 read => feed constraints.
[2022-06-11 04:55:26] [INFO ] After 35809ms SMT Verify possible using 6685 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2022-06-11 04:55:40] [INFO ] Deduced a trap composed of 21 places in 12253 ms of which 2 ms to minimize.
[2022-06-11 04:55:53] [INFO ] Deduced a trap composed of 57 places in 11662 ms of which 2 ms to minimize.
[2022-06-11 04:56:06] [INFO ] Deduced a trap composed of 281 places in 11012 ms of which 2 ms to minimize.
[2022-06-11 04:56:19] [INFO ] Deduced a trap composed of 69 places in 11985 ms of which 2 ms to minimize.
[2022-06-11 04:56:34] [INFO ] Deduced a trap composed of 135 places in 12858 ms of which 3 ms to minimize.
[2022-06-11 04:56:47] [INFO ] Deduced a trap composed of 53 places in 11291 ms of which 2 ms to minimize.
[2022-06-11 04:57:01] [INFO ] Deduced a trap composed of 62 places in 12744 ms of which 2 ms to minimize.
[2022-06-11 04:57:14] [INFO ] Deduced a trap composed of 282 places in 11360 ms of which 2 ms to minimize.
[2022-06-11 04:57:27] [INFO ] Deduced a trap composed of 229 places in 10828 ms of which 9 ms to minimize.
[2022-06-11 04:57:39] [INFO ] Deduced a trap composed of 213 places in 11108 ms of which 2 ms to minimize.
[2022-06-11 04:57:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 04:57:39] [INFO ] After 227563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 289 out of 2030 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2030/2030 places, 146199/146199 transitions.
Applied a total of 0 rules in 944 ms. Remains 2030 /2030 variables (removed 0) and now considering 146199/146199 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2030/2030 places, 146199/146199 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2030/2030 places, 146199/146199 transitions.
Applied a total of 0 rules in 810 ms. Remains 2030 /2030 variables (removed 0) and now considering 146199/146199 (removed 0) transitions.
[2022-06-11 04:57:41] [INFO ] Flow matrix only has 114535 transitions (discarded 31664 similar events)
// Phase 1: matrix 114535 rows 2030 cols
[2022-06-11 04:57:42] [INFO ] Computed 15 place invariants in 781 ms
[2022-06-11 04:57:47] [INFO ] Implicit Places using invariants in 5371 ms returned []
Implicit Place search using SMT only with invariants took 5381 ms to find 0 implicit places.
[2022-06-11 04:57:47] [INFO ] Flow matrix only has 114535 transitions (discarded 31664 similar events)
// Phase 1: matrix 114535 rows 2030 cols
[2022-06-11 04:57:48] [INFO ] Computed 15 place invariants in 886 ms
[2022-06-11 04:58:18] [INFO ] Performed 83796/146199 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 04:58:39] [INFO ] Dead Transitions using invariants and state equation in 52833 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2030/2030 places, 146199/146199 transitions.
Graph (trivial) has 23382 edges and 2030 vertex of which 1326 / 2030 are part of one of the 256 SCC in 12 ms
Free SCC test removed 1070 places
Drop transitions removed 15944 transitions
Ensure Unique test removed 76442 transitions
Reduce isomorphic transitions removed 92386 transitions.
Graph (complete) has 38299 edges and 960 vertex of which 953 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.30 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 9 rules applied. Total rules applied 11 place count 953 transition count 53804
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 952 transition count 53803
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 17 place count 948 transition count 53717
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 948 transition count 53717
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 35 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 946 transition count 53715
Ensure Unique test removed 129 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 2 with 129 rules applied. Total rules applied 154 place count 946 transition count 53586
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 946 transition count 53590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 945 transition count 53590
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 945 transition count 53590
Applied a total of 158 rules in 4353 ms. Remains 945 /2030 variables (removed 1085) and now considering 53590/146199 (removed 92609) transitions.
Running SMT prover for 14 properties.
[2022-06-11 04:58:44] [INFO ] Flow matrix only has 46783 transitions (discarded 6807 similar events)
// Phase 1: matrix 46783 rows 945 cols
[2022-06-11 04:58:44] [INFO ] Computed 9 place invariants in 299 ms
[2022-06-11 04:58:45] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-06-11 04:58:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-06-11 04:59:09] [INFO ] After 24145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-06-11 04:59:09] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-11 04:59:20] [INFO ] After 10986ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2022-06-11 04:59:38] [INFO ] After 28612ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 12628 ms.
[2022-06-11 04:59:51] [INFO ] After 66006ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
[2022-06-11 04:59:56] [INFO ] Flatten gal took : 4619 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6569979306857671602
[2022-06-11 04:59:59] [INFO ] Too many transitions (146199) to apply POR reductions. Disabling POR matrices.
[2022-06-11 05:00:03] [INFO ] Built C files in 4117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6569979306857671602
Running compilation step : cd /tmp/ltsmin6569979306857671602;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '51' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 05:00:06] [INFO ] Applying decomposition
[2022-06-11 05:00:11] [INFO ] Flatten gal took : 12141 ms
[2022-06-11 05:00:16] [INFO ] Flatten gal took : 10400 ms
[2022-06-11 05:00:22] [INFO ] Input system was already deterministic with 146199 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3897590430353172132.txt' '-o' '/tmp/graph3897590430353172132.bin' '-w' '/tmp/graph3897590430353172132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3897590430353172132.bin' '-l' '-1' '-v' '-w' '/tmp/graph3897590430353172132.weights' '-q' '0' '-e' '0.001'
[2022-06-11 05:00:29] [INFO ] Decomposing Gal with order
[2022-06-11 05:00:29] [INFO ] Rewriting arrays to variables to allow decomposition.
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6569979306857671602;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '51' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 51 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6569979306857671602;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '51' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 51 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 05:01:05] [INFO ] Ran tautology test, simplified 0 / 14 in 53565 ms.
[2022-06-11 05:01:05] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-00(UNSAT) depth K=0 took 47 ms
[2022-06-11 05:01:05] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-01(UNSAT) depth K=0 took 1 ms
[2022-06-11 05:01:05] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-02(UNSAT) depth K=0 took 1 ms
[2022-06-11 05:01:05] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-03(UNSAT) depth K=0 took 1 ms
[2022-06-11 05:01:05] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-04(UNSAT) depth K=0 took 0 ms
[2022-06-11 05:01:05] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-05(UNSAT) depth K=0 took 0 ms
[2022-06-11 05:01:05] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-07(UNSAT) depth K=0 took 1 ms
[2022-06-11 05:01:05] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-08(UNSAT) depth K=0 took 0 ms
[2022-06-11 05:01:05] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-09(UNSAT) depth K=0 took 2 ms
[2022-06-11 05:01:05] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-10(UNSAT) depth K=0 took 1 ms
[2022-06-11 05:01:05] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-11(UNSAT) depth K=0 took 0 ms
[2022-06-11 05:01:05] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-12(UNSAT) depth K=0 took 1 ms
[2022-06-11 05:01:05] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-13(UNSAT) depth K=0 took 12 ms
[2022-06-11 05:01:05] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-15(UNSAT) depth K=0 took 0 ms
[2022-06-11 05:01:06] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-00(UNSAT) depth K=1 took 27 ms
[2022-06-11 05:01:06] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-01(UNSAT) depth K=1 took 6 ms
[2022-06-11 05:01:06] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-02(UNSAT) depth K=1 took 3 ms
[2022-06-11 05:01:06] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-03(UNSAT) depth K=1 took 5 ms
[2022-06-11 05:01:06] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-04(UNSAT) depth K=1 took 3 ms
[2022-06-11 05:01:06] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-05(UNSAT) depth K=1 took 9 ms
[2022-06-11 05:01:06] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-07(UNSAT) depth K=1 took 2 ms
[2022-06-11 05:01:06] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-08(UNSAT) depth K=1 took 1 ms
[2022-06-11 05:01:06] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-09(UNSAT) depth K=1 took 6 ms
[2022-06-11 05:01:06] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-10(UNSAT) depth K=1 took 2 ms
[2022-06-11 05:01:06] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-11(UNSAT) depth K=1 took 3 ms
[2022-06-11 05:01:06] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-12(UNSAT) depth K=1 took 2 ms
[2022-06-11 05:01:06] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-13(UNSAT) depth K=1 took 1 ms
[2022-06-11 05:01:06] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-15(UNSAT) depth K=1 took 4 ms
[2022-06-11 05:01:10] [INFO ] Removed a total of 278951 redundant transitions.
[2022-06-11 05:01:14] [INFO ] Flatten gal took : 39833 ms
[2022-06-11 05:01:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 8596 labels/synchronizations in 7219 ms.
[2022-06-11 05:01:29] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11924413897183942481.gal : 547 ms
[2022-06-11 05:01:29] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16149729124249954900.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability11924413897183942481.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16149729124249954900.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
[2022-06-11 05:02:44] [INFO ] BMC solution for property RERS2020-PT-pb108-ReachabilityFireability-00(UNSAT) depth K=2 took 94954 ms
Loading property file /tmp/ReachabilityFireability16149729124249954900.prop.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 114535 out of 146199 initially.
// Phase 1: matrix 114535 rows 2030 cols
[2022-06-11 05:03:01] [INFO ] Computed 15 place invariants in 1554 ms
[2022-06-11 05:03:01] [INFO ] Computed 15 place invariants in 1560 ms
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :9 after 14
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :14 after 70

BK_STOP 1654923864615

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="RERS2020-PT-pb108"
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 RERS2020-PT-pb108, 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 r312-tall-165472282600687"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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