Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472282600662.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-pb105, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282600662
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 86M
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 7 17:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 17:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 17:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 16K Jun 6 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Jun 7 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Jun 7 17:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 7 17:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 85M 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-pb105-ReachabilityCardinality-00
FORMULA_NAME RERS2020-PT-pb105-ReachabilityCardinality-01
FORMULA_NAME RERS2020-PT-pb105-ReachabilityCardinality-02
FORMULA_NAME RERS2020-PT-pb105-ReachabilityCardinality-03
FORMULA_NAME RERS2020-PT-pb105-ReachabilityCardinality-04
FORMULA_NAME RERS2020-PT-pb105-ReachabilityCardinality-05
FORMULA_NAME RERS2020-PT-pb105-ReachabilityCardinality-06
FORMULA_NAME RERS2020-PT-pb105-ReachabilityCardinality-07
FORMULA_NAME RERS2020-PT-pb105-ReachabilityCardinality-08
FORMULA_NAME RERS2020-PT-pb105-ReachabilityCardinality-09
FORMULA_NAME RERS2020-PT-pb105-ReachabilityCardinality-10
FORMULA_NAME RERS2020-PT-pb105-ReachabilityCardinality-11
FORMULA_NAME RERS2020-PT-pb105-ReachabilityCardinality-12
FORMULA_NAME RERS2020-PT-pb105-ReachabilityCardinality-13
FORMULA_NAME RERS2020-PT-pb105-ReachabilityCardinality-14
FORMULA_NAME RERS2020-PT-pb105-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654915017087

Running Version 202205111006
[2022-06-11 02:36:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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 02:36:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 02:37:01] [INFO ] Load time of PNML (sax parser for PT used): 2755 ms
[2022-06-11 02:37:01] [INFO ] Transformed 1982 places.
[2022-06-11 02:37:01] [INFO ] Transformed 153412 transitions.
[2022-06-11 02:37:01] [INFO ] Found NUPN structural information;
[2022-06-11 02:37:01] [INFO ] Parsed PT model containing 1982 places and 153412 transitions in 3269 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 3773 transitions
Reduce redundant transitions removed 3773 transitions.
FORMULA RERS2020-PT-pb105-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1592 ms. (steps per millisecond=6 ) properties (out of 15) seen :1
FORMULA RERS2020-PT-pb105-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 14074 steps, run timeout after 9004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 14074 steps, saw 10333 distinct states, run finished after 9011 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 14 properties.
[2022-06-11 02:37:15] [INFO ] Flow matrix only has 105328 transitions (discarded 44311 similar events)
// Phase 1: matrix 105328 rows 1982 cols
[2022-06-11 02:37:16] [INFO ] Computed 21 place invariants in 521 ms
[2022-06-11 02:37:17] [INFO ] After 1315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-06-11 02:37:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2022-06-11 02:37:18] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 3 ms returned sat
[2022-06-11 02:37:42] [INFO ] After 24029ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :8
[2022-06-11 02:37:44] [INFO ] State equation strengthened by 5248 read => feed constraints.
[2022-06-11 02:37:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 02:37:44] [INFO ] After 27403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
FORMULA RERS2020-PT-pb105-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RERS2020-PT-pb105-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RERS2020-PT-pb105-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RERS2020-PT-pb105-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RERS2020-PT-pb105-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 79 out of 1982 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1982/1982 places, 149639/149639 transitions.
Graph (trivial) has 1571 edges and 1982 vertex of which 109 / 1982 are part of one of the 41 SCC in 23 ms
Free SCC test removed 68 places
Drop transitions removed 3837 transitions
Ensure Unique test removed 460 transitions
Reduce isomorphic transitions removed 4297 transitions.
Graph (complete) has 126522 edges and 1914 vertex of which 1912 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.117 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 10 places
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 16 rules applied. Total rules applied 18 place count 1902 transition count 145335
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 23 place count 1897 transition count 145335
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 23 place count 1897 transition count 145332
Deduced a syphon composed of 3 places in 74 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 29 place count 1894 transition count 145332
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 38 place count 1885 transition count 145285
Iterating global reduction 2 with 9 rules applied. Total rules applied 47 place count 1885 transition count 145285
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 56 place count 1885 transition count 145276
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 62 place count 1879 transition count 145264
Iterating global reduction 3 with 6 rules applied. Total rules applied 68 place count 1879 transition count 145264
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 74 place count 1879 transition count 145258
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 76 place count 1877 transition count 145254
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 1877 transition count 145254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 1877 transition count 145252
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 112 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 130 place count 1852 transition count 145227
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 137 place count 1852 transition count 145220
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -74
Deduced a syphon composed of 25 places in 143 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 187 place count 1827 transition count 145294
Drop transitions removed 5 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 201 place count 1827 transition count 145280
Free-agglomeration rule applied 21 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 21 rules applied. Total rules applied 222 place count 1827 transition count 145257
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 535 transitions
Reduce isomorphic transitions removed 543 transitions.
Iterating post reduction 7 with 564 rules applied. Total rules applied 786 place count 1806 transition count 144714
Free-agglomeration rule (complex) applied 111 times with reduction of 2636 identical transitions.
Iterating global reduction 8 with 111 rules applied. Total rules applied 897 place count 1806 transition count 170943
Reduce places removed 111 places and 0 transitions.
Drop transitions removed 130 transitions
Ensure Unique test removed 6824 transitions
Reduce isomorphic transitions removed 6954 transitions.
Iterating post reduction 8 with 7065 rules applied. Total rules applied 7962 place count 1695 transition count 163989
Applied a total of 7962 rules in 13575 ms. Remains 1695 /1982 variables (removed 287) and now considering 163989/149639 (removed -14350) transitions.
Finished structural reductions, in 1 iterations. Remains : 1695/1982 places, 163989/149639 transitions.
Interrupted random walk after 245636 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 425377 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=85 ) properties seen 0
Interrupted Best-First random walk after 480091 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
Interrupted Best-First random walk after 485774 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen 0
Interrupted Best-First random walk after 480089 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
Interrupted Best-First random walk after 463490 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen 0
Interrupted Best-First random walk after 436523 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 0
Interrupted Best-First random walk after 441558 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
Interrupted Best-First random walk after 370435 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=74 ) properties seen 0
Interrupted Best-First random walk after 478126 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
Interrupted probabilistic random walk after 287530 steps, run timeout after 225006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 287530 steps, saw 230609 distinct states, run finished after 225007 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 9 properties.
[2022-06-11 02:42:58] [INFO ] Flow matrix only has 121173 transitions (discarded 42816 similar events)
// Phase 1: matrix 121173 rows 1695 cols
[2022-06-11 02:42:59] [INFO ] Computed 10 place invariants in 570 ms
[2022-06-11 02:42:59] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-11 02:43:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2022-06-11 02:43:51] [INFO ] After 50882ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-11 02:43:53] [INFO ] State equation strengthened by 6000 read => feed constraints.
[2022-06-11 02:44:29] [INFO ] After 36475ms SMT Verify possible using 6000 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-06-11 02:44:47] [INFO ] Deduced a trap composed of 25 places in 15882 ms of which 17 ms to minimize.
[2022-06-11 02:45:01] [INFO ] Deduced a trap composed of 146 places in 12332 ms of which 3 ms to minimize.
[2022-06-11 02:45:16] [INFO ] Deduced a trap composed of 156 places in 13810 ms of which 2 ms to minimize.
[2022-06-11 02:45:29] [INFO ] Deduced a trap composed of 210 places in 11319 ms of which 1 ms to minimize.
[2022-06-11 02:45:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 64636 ms
[2022-06-11 02:46:11] [INFO ] After 137627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 14783 ms.
[2022-06-11 02:46:25] [INFO ] After 206093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 79 out of 1695 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1695/1695 places, 163989/163989 transitions.
Applied a total of 0 rules in 963 ms. Remains 1695 /1695 variables (removed 0) and now considering 163989/163989 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1695/1695 places, 163989/163989 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1695/1695 places, 163989/163989 transitions.
Applied a total of 0 rules in 932 ms. Remains 1695 /1695 variables (removed 0) and now considering 163989/163989 (removed 0) transitions.
[2022-06-11 02:46:27] [INFO ] Flow matrix only has 121173 transitions (discarded 42816 similar events)
// Phase 1: matrix 121173 rows 1695 cols
[2022-06-11 02:46:28] [INFO ] Computed 10 place invariants in 511 ms
[2022-06-11 02:46:37] [INFO ] Implicit Places using invariants in 9682 ms returned []
Implicit Place search using SMT only with invariants took 9687 ms to find 0 implicit places.
[2022-06-11 02:46:37] [INFO ] Flow matrix only has 121173 transitions (discarded 42816 similar events)
// Phase 1: matrix 121173 rows 1695 cols
[2022-06-11 02:46:38] [INFO ] Computed 10 place invariants in 612 ms
[2022-06-11 02:47:08] [INFO ] Performed 88105/163989 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 02:47:33] [INFO ] Dead Transitions using invariants and state equation in 55592 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1695/1695 places, 163989/163989 transitions.
Interrupted random walk after 227394 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 0
Interrupted Best-First random walk after 352790 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=70 ) properties seen 0
Interrupted Best-First random walk after 396350 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=79 ) properties seen 0
Interrupted Best-First random walk after 401248 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=80 ) properties seen 0
Interrupted Best-First random walk after 412661 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen 0
Interrupted Best-First random walk after 445905 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 450470 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 0
Interrupted Best-First random walk after 435198 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 0
Interrupted Best-First random walk after 233066 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=46 ) properties seen 0
Interrupted Best-First random walk after 441182 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
Interrupted probabilistic random walk after 344240 steps, run timeout after 225003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 344240 steps, saw 276553 distinct states, run finished after 225003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 9 properties.
[2022-06-11 02:52:33] [INFO ] Flow matrix only has 121173 transitions (discarded 42816 similar events)
// Phase 1: matrix 121173 rows 1695 cols
[2022-06-11 02:52:33] [INFO ] Computed 10 place invariants in 509 ms
[2022-06-11 02:52:34] [INFO ] After 434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-11 02:52:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2022-06-11 02:53:27] [INFO ] After 52697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-11 02:53:29] [INFO ] State equation strengthened by 6000 read => feed constraints.
[2022-06-11 02:54:04] [INFO ] After 34654ms SMT Verify possible using 6000 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-06-11 02:54:19] [INFO ] Deduced a trap composed of 25 places in 13306 ms of which 2 ms to minimize.
[2022-06-11 02:54:34] [INFO ] Deduced a trap composed of 146 places in 13901 ms of which 1 ms to minimize.
[2022-06-11 02:54:49] [INFO ] Deduced a trap composed of 156 places in 13074 ms of which 1 ms to minimize.
[2022-06-11 02:54:59] [INFO ] Deduced a trap composed of 210 places in 9058 ms of which 1 ms to minimize.
[2022-06-11 02:55:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 60356 ms
[2022-06-11 02:55:43] [INFO ] After 134574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 15523 ms.
[2022-06-11 02:55:59] [INFO ] After 205205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 79 out of 1695 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1695/1695 places, 163989/163989 transitions.
Applied a total of 0 rules in 959 ms. Remains 1695 /1695 variables (removed 0) and now considering 163989/163989 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1695/1695 places, 163989/163989 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1695/1695 places, 163989/163989 transitions.
Applied a total of 0 rules in 778 ms. Remains 1695 /1695 variables (removed 0) and now considering 163989/163989 (removed 0) transitions.
[2022-06-11 02:56:01] [INFO ] Flow matrix only has 121173 transitions (discarded 42816 similar events)
// Phase 1: matrix 121173 rows 1695 cols
[2022-06-11 02:56:01] [INFO ] Computed 10 place invariants in 560 ms
[2022-06-11 02:56:10] [INFO ] Implicit Places using invariants in 9286 ms returned []
Implicit Place search using SMT only with invariants took 9289 ms to find 0 implicit places.
[2022-06-11 02:56:10] [INFO ] Flow matrix only has 121173 transitions (discarded 42816 similar events)
// Phase 1: matrix 121173 rows 1695 cols
[2022-06-11 02:56:11] [INFO ] Computed 10 place invariants in 564 ms
[2022-06-11 02:56:41] [INFO ] Performed 86823/163989 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 02:57:06] [INFO ] Dead Transitions using invariants and state equation in 56156 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1695/1695 places, 163989/163989 transitions.
Graph (trivial) has 46276 edges and 1695 vertex of which 1353 / 1695 are part of one of the 187 SCC in 9 ms
Free SCC test removed 1166 places
Drop transitions removed 62875 transitions
Ensure Unique test removed 81960 transitions
Reduce isomorphic transitions removed 144835 transitions.
Graph (complete) has 13259 edges and 529 vertex of which 514 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.9 ms
Discarding 15 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 29 transitions
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 120 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 123 rules applied. Total rules applied 125 place count 514 transition count 19027
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 511 transition count 19027
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 133 place count 506 transition count 19007
Iterating global reduction 2 with 5 rules applied. Total rules applied 138 place count 506 transition count 19007
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 504 transition count 18987
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 504 transition count 18987
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 154 place count 498 transition count 18981
Ensure Unique test removed 335 transitions
Reduce isomorphic transitions removed 335 transitions.
Iterating post reduction 2 with 335 rules applied. Total rules applied 489 place count 498 transition count 18646
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 491 place count 497 transition count 18645
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 525 place count 497 transition count 18611
Drop transitions removed 9106 transitions
Redundant transition composition rules discarded 9106 transitions
Iterating global reduction 4 with 9106 rules applied. Total rules applied 9631 place count 497 transition count 9505
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 8749 edges and 493 vertex of which 467 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.4 ms
Discarding 26 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Iterating post reduction 4 with 18 rules applied. Total rules applied 9649 place count 467 transition count 9487
Drop transitions removed 527 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 558 transitions.
Iterating post reduction 5 with 558 rules applied. Total rules applied 10207 place count 467 transition count 8929
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 10207 place count 467 transition count 8928
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 10209 place count 466 transition count 8928
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 10212 place count 463 transition count 8922
Iterating global reduction 6 with 3 rules applied. Total rules applied 10215 place count 463 transition count 8922
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 10219 place count 459 transition count 8904
Iterating global reduction 6 with 4 rules applied. Total rules applied 10223 place count 459 transition count 8904
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 10235 place count 453 transition count 8898
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 10236 place count 453 transition count 8897
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 10277 place count 453 transition count 8856
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 10286 place count 453 transition count 8847
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 10327 place count 444 transition count 8815
Drop transitions removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 8 with 96 rules applied. Total rules applied 10423 place count 444 transition count 8719
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 10430 place count 444 transition count 8712
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 10473 place count 437 transition count 8676
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 9 with 71 rules applied. Total rules applied 10544 place count 437 transition count 8605
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 10546 place count 437 transition count 8603
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 10548 place count 435 transition count 8603
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 10 with 31 rules applied. Total rules applied 10579 place count 435 transition count 8572
Free-agglomeration rule (complex) applied 6 times with reduction of 245 identical transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 10585 place count 435 transition count 8871
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 10 with 46 rules applied. Total rules applied 10631 place count 429 transition count 8831
Drop transitions removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 11 with 145 rules applied. Total rules applied 10776 place count 429 transition count 8686
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 11 with 16 rules applied. Total rules applied 10792 place count 429 transition count 8686
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 10793 place count 429 transition count 8685
Applied a total of 10793 rules in 6322 ms. Remains 429 /1695 variables (removed 1266) and now considering 8685/163989 (removed 155304) transitions.
Running SMT prover for 9 properties.
[2022-06-11 02:57:13] [INFO ] Flow matrix only has 8541 transitions (discarded 144 similar events)
// Phase 1: matrix 8541 rows 429 cols
[2022-06-11 02:57:13] [INFO ] Computed 0 place invariants in 57 ms
[2022-06-11 02:57:13] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-11 02:57:16] [INFO ] After 3176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-11 02:57:16] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-11 02:57:19] [INFO ] After 2374ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-06-11 02:57:22] [INFO ] After 6052ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1913 ms.
[2022-06-11 02:57:24] [INFO ] After 11313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2022-06-11 02:57:30] [INFO ] Flatten gal took : 4848 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1787846900358789035
[2022-06-11 02:57:33] [INFO ] Too many transitions (163989) to apply POR reductions. Disabling POR matrices.
[2022-06-11 02:57:34] [INFO ] Built C files in 1755ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1787846900358789035
Running compilation step : cd /tmp/ltsmin1787846900358789035;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '80' '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 02:57:38] [INFO ] Applying decomposition
[2022-06-11 02:57:41] [INFO ] Flatten gal took : 7991 ms
[2022-06-11 02:57:44] [INFO ] Flatten gal took : 5773 ms
[2022-06-11 02:57:49] [INFO ] Input system was already deterministic with 163989 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/graph7524421406969967459.txt' '-o' '/tmp/graph7524421406969967459.bin' '-w' '/tmp/graph7524421406969967459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7524421406969967459.bin' '-l' '-1' '-v' '-w' '/tmp/graph7524421406969967459.weights' '-q' '0' '-e' '0.001'
[2022-06-11 02:57:57] [INFO ] Decomposing Gal with order
[2022-06-11 02:57:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 02:58:16] [INFO ] Removed a total of 303380 redundant transitions.
[2022-06-11 02:58:18] [INFO ] Flatten gal took : 16002 ms
[2022-06-11 02:58:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 8298 labels/synchronizations in 7049 ms.
[2022-06-11 02:58:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6013107755740609456.gal : 462 ms
[2022-06-11 02:58:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6113300014772411317.prop : 2 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/ReachabilityCardinality6013107755740609456.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6113300014772411317.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...298
[2022-06-11 02:58:35] [INFO ] Ran tautology test, simplified 0 / 9 in 54465 ms.
[2022-06-11 02:58:35] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-02(UNSAT) depth K=0 took 58 ms
[2022-06-11 02:58:35] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-04(UNSAT) depth K=0 took 0 ms
[2022-06-11 02:58:35] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-05(UNSAT) depth K=0 took 0 ms
[2022-06-11 02:58:35] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-09(UNSAT) depth K=0 took 1 ms
[2022-06-11 02:58:35] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-11(UNSAT) depth K=0 took 0 ms
[2022-06-11 02:58:35] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-12(UNSAT) depth K=0 took 0 ms
[2022-06-11 02:58:35] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-13(UNSAT) depth K=0 took 1 ms
[2022-06-11 02:58:35] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-14(UNSAT) depth K=0 took 0 ms
[2022-06-11 02:58:35] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-15(UNSAT) depth K=0 took 1 ms
[2022-06-11 02:58:37] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-02(UNSAT) depth K=1 took 43 ms
[2022-06-11 02:58:37] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-04(UNSAT) depth K=1 took 1 ms
[2022-06-11 02:58:37] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-05(UNSAT) depth K=1 took 0 ms
[2022-06-11 02:58:37] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-09(UNSAT) depth K=1 took 0 ms
[2022-06-11 02:58:37] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-11(UNSAT) depth K=1 took 1 ms
[2022-06-11 02:58:37] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-12(UNSAT) depth K=1 took 1 ms
[2022-06-11 02:58:37] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-13(UNSAT) depth K=1 took 1 ms
[2022-06-11 02:58:37] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-14(UNSAT) depth K=1 took 1 ms
[2022-06-11 02:58:37] [INFO ] BMC solution for property RERS2020-PT-pb105-ReachabilityCardinality-15(UNSAT) depth K=1 took 0 ms
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/ltsmin1787846900358789035;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '80' '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 80 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1787846900358789035;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '80' '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 80 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)

BK_STOP 1654916402701

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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-pb105"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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