Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918700551.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 CANConstruction-PT-080, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918700551
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.9M
-rw-r--r-- 1 mcc users 11K Apr 29 12:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 29 12:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 12:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 12:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 12:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 29 12:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 12:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 9.5M May 10 09:33 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 CANConstruction-PT-080-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654201633784

Running Version 202205111006
[2022-06-02 20:27:14] [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-02 20:27:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:27:15] [INFO ] Load time of PNML (sax parser for PT used): 765 ms
[2022-06-02 20:27:15] [INFO ] Transformed 13762 places.
[2022-06-02 20:27:15] [INFO ] Transformed 26240 transitions.
[2022-06-02 20:27:15] [INFO ] Parsed PT model containing 13762 places and 26240 transitions in 967 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 790 ms. (steps per millisecond=12 ) properties (out of 16) seen :8
FORMULA CANConstruction-PT-080-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 26240 rows 13762 cols
[2022-06-02 20:27:17] [INFO ] Computed 161 place invariants in 372 ms
[2022-06-02 20:27:20] [INFO ] [Real]Absence check using 81 positive place invariants in 273 ms returned sat
[2022-06-02 20:27:20] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 109 ms returned sat
[2022-06-02 20:27:21] [INFO ] After 3794ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-02 20:27:24] [INFO ] [Nat]Absence check using 81 positive place invariants in 272 ms returned sat
[2022-06-02 20:27:24] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 106 ms returned sat
[2022-06-02 20:27:46] [INFO ] After 20739ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-06-02 20:27:46] [INFO ] State equation strengthened by 12720 read => feed constraints.
[2022-06-02 20:27:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 20:27:46] [INFO ] After 25167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 111 out of 13762 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Drop transitions removed 509 transitions
Trivial Post-agglo rules discarded 509 transitions
Performed 509 trivial Post agglomeration. Transition count delta: 509
Iterating post reduction 0 with 509 rules applied. Total rules applied 509 place count 13762 transition count 25731
Reduce places removed 509 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 513 rules applied. Total rules applied 1022 place count 13253 transition count 25727
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1026 place count 13249 transition count 25727
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 1026 place count 13249 transition count 25709
Deduced a syphon composed of 18 places in 9 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 1062 place count 13231 transition count 25709
Discarding 6196 places :
Symmetric choice reduction at 3 with 6196 rule applications. Total rules 7258 place count 7035 transition count 13317
Iterating global reduction 3 with 6196 rules applied. Total rules applied 13454 place count 7035 transition count 13317
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 6 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 13576 place count 6974 transition count 13256
Free-agglomeration rule applied 89 times.
Iterating global reduction 3 with 89 rules applied. Total rules applied 13665 place count 6974 transition count 13167
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 3 with 89 rules applied. Total rules applied 13754 place count 6885 transition count 13167
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 4 with 28 rules applied. Total rules applied 13782 place count 6885 transition count 13139
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 13810 place count 6857 transition count 13139
Partial Free-agglomeration rule applied 83 times.
Drop transitions removed 83 transitions
Iterating global reduction 5 with 83 rules applied. Total rules applied 13893 place count 6857 transition count 13139
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 13900 place count 6857 transition count 13139
Applied a total of 13900 rules in 13561 ms. Remains 6857 /13762 variables (removed 6905) and now considering 13139/26240 (removed 13101) transitions.
Finished structural reductions, in 1 iterations. Remains : 6857/13762 places, 13139/26240 transitions.
Incomplete random walk after 1000000 steps, including 1715 resets, run finished after 27369 ms. (steps per millisecond=36 ) properties (out of 8) seen :6
FORMULA CANConstruction-PT-080-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 3032 ms. (steps per millisecond=329 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3305 ms. (steps per millisecond=302 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 13139 rows 6857 cols
[2022-06-02 20:28:34] [INFO ] Computed 161 place invariants in 113 ms
[2022-06-02 20:28:35] [INFO ] [Real]Absence check using 81 positive place invariants in 162 ms returned sat
[2022-06-02 20:28:35] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 84 ms returned sat
[2022-06-02 20:28:35] [INFO ] After 1147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 20:28:36] [INFO ] [Nat]Absence check using 81 positive place invariants in 153 ms returned sat
[2022-06-02 20:28:36] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 86 ms returned sat
[2022-06-02 20:28:45] [INFO ] After 8973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 20:28:45] [INFO ] State equation strengthened by 12828 read => feed constraints.
[2022-06-02 20:28:50] [INFO ] After 4603ms SMT Verify possible using 12828 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 20:28:52] [INFO ] After 7159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1266 ms.
[2022-06-02 20:28:54] [INFO ] After 18698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 582 ms.
Support contains 61 out of 6857 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6857/6857 places, 13139/13139 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6855 transition count 13135
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6855 transition count 13135
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 5 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 50 place count 6832 transition count 13112
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 6830 transition count 13112
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 6830 transition count 13110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 6828 transition count 13110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 6827 transition count 13108
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 6827 transition count 13108
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 6827 transition count 13108
Applied a total of 61 rules in 12694 ms. Remains 6827 /6857 variables (removed 30) and now considering 13108/13139 (removed 31) transitions.
Finished structural reductions, in 1 iterations. Remains : 6827/6857 places, 13108/13139 transitions.
Incomplete random walk after 1000000 steps, including 1756 resets, run finished after 24873 ms. (steps per millisecond=40 ) properties (out of 2) seen :1
FORMULA CANConstruction-PT-080-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 3038 ms. (steps per millisecond=329 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 13108 rows 6827 cols
[2022-06-02 20:29:35] [INFO ] Computed 161 place invariants in 95 ms
[2022-06-02 20:29:36] [INFO ] [Real]Absence check using 81 positive place invariants in 133 ms returned sat
[2022-06-02 20:29:36] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 90 ms returned sat
[2022-06-02 20:29:36] [INFO ] After 998ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:29:37] [INFO ] [Nat]Absence check using 81 positive place invariants in 135 ms returned sat
[2022-06-02 20:29:37] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 93 ms returned sat
[2022-06-02 20:29:46] [INFO ] After 8746ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:29:46] [INFO ] State equation strengthened by 12851 read => feed constraints.
[2022-06-02 20:29:48] [INFO ] After 2567ms SMT Verify possible using 12851 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:29:49] [INFO ] After 3314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 881 ms.
[2022-06-02 20:29:50] [INFO ] After 14074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 55 ms.
Support contains 25 out of 6827 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6827/6827 places, 13108/13108 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 6804 transition count 13085
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 47 place count 6804 transition count 13084
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 48 place count 6803 transition count 13084
Applied a total of 48 rules in 5219 ms. Remains 6803 /6827 variables (removed 24) and now considering 13084/13108 (removed 24) transitions.
Finished structural reductions, in 1 iterations. Remains : 6803/6827 places, 13084/13108 transitions.
Incomplete random walk after 1000000 steps, including 1785 resets, run finished after 23714 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 3077 ms. (steps per millisecond=324 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1185440 steps, run timeout after 78001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 1185440 steps, saw 673057 distinct states, run finished after 78002 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 13084 rows 6803 cols
[2022-06-02 20:31:40] [INFO ] Computed 161 place invariants in 77 ms
[2022-06-02 20:31:41] [INFO ] [Real]Absence check using 81 positive place invariants in 129 ms returned sat
[2022-06-02 20:31:41] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 81 ms returned sat
[2022-06-02 20:31:41] [INFO ] After 994ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:31:42] [INFO ] [Nat]Absence check using 81 positive place invariants in 131 ms returned sat
[2022-06-02 20:31:42] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 81 ms returned sat
[2022-06-02 20:31:50] [INFO ] After 7366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:31:50] [INFO ] State equation strengthened by 12869 read => feed constraints.
[2022-06-02 20:31:52] [INFO ] After 2797ms SMT Verify possible using 12869 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:31:53] [INFO ] After 3581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 546 ms.
[2022-06-02 20:31:54] [INFO ] After 12562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 55 ms.
Support contains 25 out of 6803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6803/6803 places, 13084/13084 transitions.
Applied a total of 0 rules in 1709 ms. Remains 6803 /6803 variables (removed 0) and now considering 13084/13084 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6803/6803 places, 13084/13084 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6803/6803 places, 13084/13084 transitions.
Applied a total of 0 rules in 1680 ms. Remains 6803 /6803 variables (removed 0) and now considering 13084/13084 (removed 0) transitions.
// Phase 1: matrix 13084 rows 6803 cols
[2022-06-02 20:31:57] [INFO ] Computed 161 place invariants in 78 ms
[2022-06-02 20:32:03] [INFO ] Implicit Places using invariants in 5671 ms returned []
Implicit Place search using SMT only with invariants took 5672 ms to find 0 implicit places.
// Phase 1: matrix 13084 rows 6803 cols
[2022-06-02 20:32:03] [INFO ] Computed 161 place invariants in 75 ms
[2022-06-02 20:32:12] [INFO ] Dead Transitions using invariants and state equation in 8671 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6803/6803 places, 13084/13084 transitions.
Incomplete random walk after 1000000 steps, including 1790 resets, run finished after 22918 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 21 resets, run finished after 3092 ms. (steps per millisecond=323 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1179800 steps, run timeout after 78001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 1179800 steps, saw 671653 distinct states, run finished after 78001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 13084 rows 6803 cols
[2022-06-02 20:33:56] [INFO ] Computed 161 place invariants in 87 ms
[2022-06-02 20:33:57] [INFO ] [Real]Absence check using 81 positive place invariants in 134 ms returned sat
[2022-06-02 20:33:57] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 86 ms returned sat
[2022-06-02 20:33:57] [INFO ] After 1027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:33:58] [INFO ] [Nat]Absence check using 81 positive place invariants in 132 ms returned sat
[2022-06-02 20:33:58] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 86 ms returned sat
[2022-06-02 20:34:06] [INFO ] After 7831ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:34:06] [INFO ] State equation strengthened by 12869 read => feed constraints.
[2022-06-02 20:34:09] [INFO ] After 2857ms SMT Verify possible using 12869 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:34:09] [INFO ] After 3642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 528 ms.
[2022-06-02 20:34:10] [INFO ] After 13120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 54 ms.
Support contains 25 out of 6803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6803/6803 places, 13084/13084 transitions.
Applied a total of 0 rules in 1699 ms. Remains 6803 /6803 variables (removed 0) and now considering 13084/13084 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6803/6803 places, 13084/13084 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6803/6803 places, 13084/13084 transitions.
Applied a total of 0 rules in 1703 ms. Remains 6803 /6803 variables (removed 0) and now considering 13084/13084 (removed 0) transitions.
// Phase 1: matrix 13084 rows 6803 cols
[2022-06-02 20:34:13] [INFO ] Computed 161 place invariants in 80 ms
[2022-06-02 20:34:19] [INFO ] Implicit Places using invariants in 5618 ms returned []
Implicit Place search using SMT only with invariants took 5619 ms to find 0 implicit places.
// Phase 1: matrix 13084 rows 6803 cols
[2022-06-02 20:34:19] [INFO ] Computed 161 place invariants in 74 ms
[2022-06-02 20:34:28] [INFO ] Dead Transitions using invariants and state equation in 8765 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6803/6803 places, 13084/13084 transitions.
Graph (trivial) has 12456 edges and 6803 vertex of which 6174 / 6803 are part of one of the 76 SCC in 7 ms
Free SCC test removed 6098 places
Drop transitions removed 12092 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12098 transitions.
Graph (complete) has 1501 edges and 705 vertex of which 406 are kept as prefixes of interest. Removing 299 places using SCC suffix rule.3 ms
Discarding 299 places :
Also discarding 176 output transitions
Drop transitions removed 176 transitions
Ensure Unique test removed 1 places
Drop transitions removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 318
Iterating post reduction 0 with 404 rules applied. Total rules applied 406 place count 405 transition count 407
Reduce places removed 318 places and 0 transitions.
Ensure Unique test removed 309 transitions
Reduce isomorphic transitions removed 309 transitions.
Iterating post reduction 1 with 627 rules applied. Total rules applied 1033 place count 87 transition count 98
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1033 place count 87 transition count 91
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1047 place count 80 transition count 91
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1050 place count 77 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 1053 place count 77 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1054 place count 77 transition count 87
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 1056 place count 77 transition count 85
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1064 place count 77 transition count 77
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1077 place count 67 transition count 74
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1079 place count 67 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1081 place count 65 transition count 72
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1088 place count 65 transition count 72
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1095 place count 58 transition count 65
Iterating global reduction 5 with 7 rules applied. Total rules applied 1102 place count 58 transition count 65
Applied a total of 1102 rules in 86 ms. Remains 58 /6803 variables (removed 6745) and now considering 65/13084 (removed 13019) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 65 rows 58 cols
[2022-06-02 20:34:28] [INFO ] Computed 17 place invariants in 1 ms
[2022-06-02 20:34:28] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-06-02 20:34:28] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:34:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2022-06-02 20:34:28] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:34:28] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-02 20:34:28] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:34:28] [INFO ] Flatten gal took : 27 ms
[2022-06-02 20:34:28] [INFO ] Flatten gal took : 9 ms
[2022-06-02 20:34:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11241686292696741389.gal : 5 ms
[2022-06-02 20:34:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16832884997449680577.prop : 0 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/ReachabilityCardinality11241686292696741389.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16832884997449680577.prop' '--nowitness' '--gen-order' 'FOLLOW'

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...321
Loading property file /tmp/ReachabilityCardinality16832884997449680577.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 144
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :144 after 203904
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.54959e+08,0.019691,3788,2,227,9,1266,7,0,290,977,0
Total reachable state count : 354958848

Verifying 1 reachability properties.
Invariant property CANConstruction-PT-080-ReachabilityFireability-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANConstruction-PT-080-ReachabilityFireability-02,5.58547e+06,0.023425,4212,2,386,9,1548,7,0,329,977,0
[2022-06-02 20:34:29] [INFO ] Flatten gal took : 602 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4236638826340272377
[2022-06-02 20:34:29] [INFO ] Too many transitions (13084) to apply POR reductions. Disabling POR matrices.
[2022-06-02 20:34:30] [INFO ] Built C files in 228ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4236638826340272377
Running compilation step : cd /tmp/ltsmin4236638826340272377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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-02 20:34:30] [INFO ] Applying decomposition
[2022-06-02 20:34:30] [INFO ] Flatten gal took : 660 ms
[2022-06-02 20:34:30] [INFO ] Flatten gal took : 585 ms
[2022-06-02 20:34:31] [INFO ] Input system was already deterministic with 13084 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/graph5141116867913017774.txt' '-o' '/tmp/graph5141116867913017774.bin' '-w' '/tmp/graph5141116867913017774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5141116867913017774.bin' '-l' '-1' '-v' '-w' '/tmp/graph5141116867913017774.weights' '-q' '0' '-e' '0.001'
[2022-06-02 20:34:31] [INFO ] Decomposing Gal with order
[2022-06-02 20:34:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 20:34:35] [INFO ] Ran tautology test, simplified 0 / 1 in 4688 ms.
[2022-06-02 20:34:35] [INFO ] Removed a total of 12740 redundant transitions.
[2022-06-02 20:34:35] [INFO ] BMC solution for property CANConstruction-PT-080-ReachabilityFireability-02(UNSAT) depth K=0 took 175 ms
[2022-06-02 20:34:35] [INFO ] BMC solution for property CANConstruction-PT-080-ReachabilityFireability-02(UNSAT) depth K=1 took 31 ms
[2022-06-02 20:34:36] [INFO ] Flatten gal took : 3197 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 13084 rows 6803 cols
[2022-06-02 20:34:39] [INFO ] Computed 161 place invariants in 77 ms
[2022-06-02 20:34:39] [INFO ] Computed 161 place invariants in 80 ms
[2022-06-02 20:34:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 16523 labels/synchronizations in 3140 ms.
[2022-06-02 20:34:40] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2671376476276483930.gal : 131 ms
[2022-06-02 20:34:40] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8979842653887170849.prop : 0 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/ReachabilityFireability2671376476276483930.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8979842653887170849.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
Loading property file /tmp/ReachabilityFireability8979842653887170849.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 12454
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12454 after 12626
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12626 after 13174
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13174 after 42710
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :42710 after 72862
[2022-06-02 20:34:59] [INFO ] Proved 6803 variables to be positive in 20040 ms
[2022-06-02 20:35:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesCANConstruction-PT-080-ReachabilityFireability-02
[2022-06-02 20:35:17] [INFO ] KInduction solution for property CANConstruction-PT-080-ReachabilityFireability-02(SAT) depth K=0 took 18197 ms
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :72862 after 4.35397e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.35397e+07 after 7.1438e+07
Compilation finished in 112270 ms.
Running link step : cd /tmp/ltsmin4236638826340272377;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 118 ms.
Running LTSmin : cd /tmp/ltsmin4236638826340272377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT080ReachabilityFireability02==true'
[2022-06-02 20:46:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesCANConstruction-PT-080-ReachabilityFireability-02
[2022-06-02 20:46:39] [INFO ] KInduction solution for property CANConstruction-PT-080-ReachabilityFireability-02(SAT) depth K=1 took 680448 ms
Detected timeout of ITS tools.
[2022-06-02 20:57:06] [INFO ] Flatten gal took : 1182 ms
[2022-06-02 20:57:06] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7857051369262258975.gal : 145 ms
[2022-06-02 20:57:06] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12913487536314762653.prop : 1 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/ReachabilityFireability7857051369262258975.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12913487536314762653.prop' '--nowitness' '--gen-order' 'FOLLOW'

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...320
Loading property file /tmp/ReachabilityFireability12913487536314762653.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 78
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :78 after 80
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :80 after 82
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :82 after 84
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :84 after 86
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :86 after 88
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :88 after 91
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :91 after 97
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :97 after 143
[2022-06-02 21:13:18] [INFO ] BMC solution for property CANConstruction-PT-080-ReachabilityFireability-02(UNSAT) depth K=2 took 2321964 ms
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :143 after 2768
Detected timeout of ITS tools.
[2022-06-02 21:19:32] [INFO ] Flatten gal took : 945 ms
[2022-06-02 21:19:33] [INFO ] Input system was already deterministic with 13084 transitions.
[2022-06-02 21:19:33] [INFO ] Transformed 6803 places.
[2022-06-02 21:19:33] [INFO ] Transformed 13084 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-02 21:20:08] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7421650024749918532.gal : 82 ms
[2022-06-02 21:20:08] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12883262715376153962.prop : 1 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/ReachabilityFireability7421650024749918532.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12883262715376153962.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

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...365
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability12883262715376153962.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2

BK_TIME_CONFINEMENT_REACHED

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="CANConstruction-PT-080"
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 CANConstruction-PT-080, 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 r024-tall-165251918700551"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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