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-165251918600495.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-010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918600495
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.2K Apr 29 12:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 29 12:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 12:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 29 12:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 29 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:11 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 173K 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-010-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-010-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654201076620

Running Version 202205111006
[2022-06-02 20:17:57] [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:17:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:17:58] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2022-06-02 20:17:58] [INFO ] Transformed 322 places.
[2022-06-02 20:17:58] [INFO ] Transformed 480 transitions.
[2022-06-02 20:17:58] [INFO ] Parsed PT model containing 322 places and 480 transitions in 226 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 59 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 16) seen :12
FORMULA CANConstruction-PT-010-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :1
FORMULA CANConstruction-PT-010-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 480 rows 322 cols
[2022-06-02 20:17:58] [INFO ] Computed 21 place invariants in 21 ms
[2022-06-02 20:17:59] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-06-02 20:17:59] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 3 ms returned sat
[2022-06-02 20:17:59] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-02 20:17:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-06-02 20:17:59] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 4 ms returned sat
[2022-06-02 20:17:59] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-06-02 20:17:59] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-06-02 20:17:59] [INFO ] After 85ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-06-02 20:17:59] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2022-06-02 20:17:59] [INFO ] After 578ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA CANConstruction-PT-010-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 92 ms.
Support contains 35 out of 322 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 322/322 places, 480/480 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 322 transition count 441
Reduce places removed 39 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 51 rules applied. Total rules applied 90 place count 283 transition count 429
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 102 place count 271 transition count 429
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 102 place count 271 transition count 427
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 269 transition count 427
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 175 place count 200 transition count 289
Iterating global reduction 3 with 69 rules applied. Total rules applied 244 place count 200 transition count 289
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 254 place count 195 transition count 284
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 274 place count 185 transition count 343
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 277 place count 185 transition count 340
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 280 place count 182 transition count 340
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 282 place count 182 transition count 340
Applied a total of 282 rules in 107 ms. Remains 182 /322 variables (removed 140) and now considering 340/480 (removed 140) transitions.
Finished structural reductions, in 1 iterations. Remains : 182/322 places, 340/480 transitions.
Incomplete random walk after 1000000 steps, including 12224 resets, run finished after 7506 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1129 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1487 resets, run finished after 1586 ms. (steps per millisecond=630 ) properties (out of 2) seen :1
FORMULA CANConstruction-PT-010-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 340 rows 182 cols
[2022-06-02 20:18:10] [INFO ] Computed 21 place invariants in 10 ms
[2022-06-02 20:18:10] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-06-02 20:18:10] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 16 ms returned sat
[2022-06-02 20:18:10] [INFO ] After 76ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-02 20:18:10] [INFO ] State equation strengthened by 275 read => feed constraints.
[2022-06-02 20:18:10] [INFO ] After 32ms SMT Verify possible using 275 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:18:10] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:18:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-06-02 20:18:10] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 2 ms returned sat
[2022-06-02 20:18:10] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:18:10] [INFO ] After 33ms SMT Verify possible using 275 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:18:10] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-06-02 20:18:10] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 182/182 places, 340/340 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 182 transition count 330
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 172 transition count 329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 171 transition count 329
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 25 place count 168 transition count 323
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 168 transition count 323
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 48 place count 158 transition count 313
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 156 transition count 314
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 156 transition count 312
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 154 transition count 312
Applied a total of 56 rules in 57 ms. Remains 154 /182 variables (removed 28) and now considering 312/340 (removed 28) transitions.
Finished structural reductions, in 1 iterations. Remains : 154/182 places, 312/340 transitions.
Incomplete random walk after 1000000 steps, including 15128 resets, run finished after 2352 ms. (steps per millisecond=425 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1321 resets, run finished after 572 ms. (steps per millisecond=1748 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4029374 steps, run timeout after 6001 ms. (steps per millisecond=671 ) properties seen :{}
Probabilistic random walk after 4029374 steps, saw 396887 distinct states, run finished after 6002 ms. (steps per millisecond=671 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 312 rows 154 cols
[2022-06-02 20:18:19] [INFO ] Computed 21 place invariants in 8 ms
[2022-06-02 20:18:19] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-06-02 20:18:19] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 2 ms returned sat
[2022-06-02 20:18:19] [INFO ] After 62ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-02 20:18:19] [INFO ] State equation strengthened by 290 read => feed constraints.
[2022-06-02 20:18:19] [INFO ] After 33ms SMT Verify possible using 290 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:18:19] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:18:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2022-06-02 20:18:19] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 2 ms returned sat
[2022-06-02 20:18:19] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:18:19] [INFO ] After 31ms SMT Verify possible using 290 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:18:19] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-02 20:18:19] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 154/154 places, 312/312 transitions.
Applied a total of 0 rules in 17 ms. Remains 154 /154 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 154/154 places, 312/312 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 154/154 places, 312/312 transitions.
Applied a total of 0 rules in 9 ms. Remains 154 /154 variables (removed 0) and now considering 312/312 (removed 0) transitions.
// Phase 1: matrix 312 rows 154 cols
[2022-06-02 20:18:19] [INFO ] Computed 21 place invariants in 2 ms
[2022-06-02 20:18:19] [INFO ] Implicit Places using invariants in 102 ms returned [6, 12, 19, 25, 31, 37, 43, 49, 55, 61]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 105 ms to find 10 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 144/154 places, 312/312 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 311
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 38 place count 125 transition count 293
Applied a total of 38 rules in 80 ms. Remains 125 /144 variables (removed 19) and now considering 293/312 (removed 19) transitions.
// Phase 1: matrix 293 rows 125 cols
[2022-06-02 20:18:19] [INFO ] Computed 11 place invariants in 7 ms
[2022-06-02 20:18:20] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 293 rows 125 cols
[2022-06-02 20:18:20] [INFO ] Computed 11 place invariants in 7 ms
[2022-06-02 20:18:20] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-06-02 20:18:20] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 125/154 places, 293/312 transitions.
Finished structural reductions, in 2 iterations. Remains : 125/154 places, 293/312 transitions.
Incomplete random walk after 1000000 steps, including 20088 resets, run finished after 2267 ms. (steps per millisecond=441 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1563 resets, run finished after 480 ms. (steps per millisecond=2083 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4963211 steps, run timeout after 6001 ms. (steps per millisecond=827 ) properties seen :{}
Probabilistic random walk after 4963211 steps, saw 400860 distinct states, run finished after 6001 ms. (steps per millisecond=827 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 125 cols
[2022-06-02 20:18:29] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-02 20:18:29] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-06-02 20:18:29] [INFO ] After 58ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-02 20:18:29] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-06-02 20:18:29] [INFO ] After 31ms SMT Verify possible using 280 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:18:29] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:18:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-06-02 20:18:29] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:18:29] [INFO ] After 31ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:18:29] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-02 20:18:29] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 293/293 transitions.
Applied a total of 0 rules in 53 ms. Remains 125 /125 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 293/293 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 293/293 transitions.
Applied a total of 0 rules in 53 ms. Remains 125 /125 variables (removed 0) and now considering 293/293 (removed 0) transitions.
// Phase 1: matrix 293 rows 125 cols
[2022-06-02 20:18:29] [INFO ] Computed 11 place invariants in 4 ms
[2022-06-02 20:18:29] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 293 rows 125 cols
[2022-06-02 20:18:29] [INFO ] Computed 11 place invariants in 1 ms
[2022-06-02 20:18:29] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-06-02 20:18:29] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2022-06-02 20:18:29] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 293 rows 125 cols
[2022-06-02 20:18:29] [INFO ] Computed 11 place invariants in 6 ms
[2022-06-02 20:18:30] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 293/293 transitions.
Finished random walk after 358 steps, including 7 resets, run visited all 3 properties in 5 ms. (steps per millisecond=71 )
Incomplete random walk after 1000000 steps, including 20063 resets, run finished after 2571 ms. (steps per millisecond=388 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1552 resets, run finished after 475 ms. (steps per millisecond=2105 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 7509784 steps, run timeout after 9001 ms. (steps per millisecond=834 ) properties seen :{}
Probabilistic random walk after 7509784 steps, saw 576036 distinct states, run finished after 9002 ms. (steps per millisecond=834 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 125 cols
[2022-06-02 20:18:42] [INFO ] Computed 11 place invariants in 4 ms
[2022-06-02 20:18:42] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-02 20:18:42] [INFO ] After 59ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-02 20:18:42] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-06-02 20:18:42] [INFO ] After 30ms SMT Verify possible using 280 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:18:42] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:18:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-06-02 20:18:42] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:18:42] [INFO ] After 34ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:18:42] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-02 20:18:42] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 293/293 transitions.
Applied a total of 0 rules in 44 ms. Remains 125 /125 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 293/293 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 293/293 transitions.
Applied a total of 0 rules in 27 ms. Remains 125 /125 variables (removed 0) and now considering 293/293 (removed 0) transitions.
// Phase 1: matrix 293 rows 125 cols
[2022-06-02 20:18:42] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-02 20:18:42] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 293 rows 125 cols
[2022-06-02 20:18:42] [INFO ] Computed 11 place invariants in 1 ms
[2022-06-02 20:18:42] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-06-02 20:18:42] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2022-06-02 20:18:42] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 293 rows 125 cols
[2022-06-02 20:18:42] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-02 20:18:42] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 293/293 transitions.
Finished random walk after 495 steps, including 10 resets, run visited all 3 properties in 4 ms. (steps per millisecond=123 )
Graph (trivial) has 190 edges and 125 vertex of which 90 / 125 are part of one of the 9 SCC in 3 ms
Free SCC test removed 81 places
Drop transitions removed 162 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 234 transitions.
Graph (complete) has 98 edges and 44 vertex of which 19 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.6 ms
Discarding 25 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 19 transition count 25
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 10 rules applied. Total rules applied 31 place count 18 transition count 16
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 48 place count 9 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 8 transition count 7
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 8 transition count 7
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 7 transition count 6
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 7 transition count 6
Applied a total of 53 rules in 13 ms. Remains 7 /125 variables (removed 118) and now considering 6/293 (removed 287) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 7 cols
[2022-06-02 20:18:42] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-02 20:18:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-02 20:18:42] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-02 20:18:42] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-02 20:18:43] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-06-02 20:18:43] [INFO ] Flatten gal took : 15 ms
[2022-06-02 20:18:43] [INFO ] Flatten gal took : 3 ms
[2022-06-02 20:18:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4913952490910273775.gal : 3 ms
[2022-06-02 20:18:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10418121262110922521.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/ReachabilityCardinality4913952490910273775.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10418121262110922521.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/ReachabilityCardinality10418121262110922521.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
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,14,0.010081,3308,2,14,6,58,7,0,32,39,0
Total reachable state count : 14

Verifying 1 reachability properties.
Reachability property CANConstruction-PT-010-ReachabilityFireability-00 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANConstruction-PT-010-ReachabilityFireability-00,1,0.010451,3732,2,8,6,58,7,0,37,39,0
[2022-06-02 20:18:43] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5201880297231495058
[2022-06-02 20:18:43] [INFO ] Applying decomposition
[2022-06-02 20:18:43] [INFO ] Computing symmetric may disable matrix : 293 transitions.
[2022-06-02 20:18:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 20:18:43] [INFO ] Computing symmetric may enable matrix : 293 transitions.
[2022-06-02 20:18:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 20:18:43] [INFO ] Flatten gal took : 20 ms
[2022-06-02 20:18:43] [INFO ] Flatten gal took : 52 ms
[2022-06-02 20:18:43] [INFO ] Computing Do-Not-Accords matrix : 293 transitions.
[2022-06-02 20:18:43] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 20:18:43] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5201880297231495058
Running compilation step : cd /tmp/ltsmin5201880297231495058;'/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:18:43] [INFO ] Input system was already deterministic with 293 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/graph16835419560446628772.txt' '-o' '/tmp/graph16835419560446628772.bin' '-w' '/tmp/graph16835419560446628772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16835419560446628772.bin' '-l' '-1' '-v' '-w' '/tmp/graph16835419560446628772.weights' '-q' '0' '-e' '0.001'
[2022-06-02 20:18:43] [INFO ] Decomposing Gal with order
[2022-06-02 20:18:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 20:18:43] [INFO ] Ran tautology test, simplified 0 / 1 in 291 ms.
[2022-06-02 20:18:43] [INFO ] Removed a total of 347 redundant transitions.
[2022-06-02 20:18:43] [INFO ] BMC solution for property CANConstruction-PT-010-ReachabilityFireability-00(UNSAT) depth K=0 took 23 ms
[2022-06-02 20:18:43] [INFO ] BMC solution for property CANConstruction-PT-010-ReachabilityFireability-00(UNSAT) depth K=1 took 3 ms
[2022-06-02 20:18:43] [INFO ] Flatten gal took : 117 ms
[2022-06-02 20:18:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 205 labels/synchronizations in 19 ms.
[2022-06-02 20:18:43] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9995268574487291047.gal : 6 ms
[2022-06-02 20:18:43] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8567125497300482976.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/ReachabilityFireability9995268574487291047.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8567125497300482976.prop' '--nowitness'
[2022-06-02 20:18:43] [INFO ] BMC solution for property CANConstruction-PT-010-ReachabilityFireability-00(UNSAT) depth K=2 took 89 ms

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
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 293 rows 125 cols
[2022-06-02 20:18:43] [INFO ] Computed 11 place invariants in 1 ms
[2022-06-02 20:18:43] [INFO ] Computed 11 place invariants in 2 ms
Loading property file /tmp/ReachabilityFireability8567125497300482976.prop.
[2022-06-02 20:18:44] [INFO ] Proved 125 variables to be positive in 299 ms
[2022-06-02 20:18:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesCANConstruction-PT-010-ReachabilityFireability-00
[2022-06-02 20:18:44] [INFO ] KInduction solution for property CANConstruction-PT-010-ReachabilityFireability-00(SAT) depth K=0 took 11 ms
[2022-06-02 20:18:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesCANConstruction-PT-010-ReachabilityFireability-00
[2022-06-02 20:18:44] [INFO ] KInduction solution for property CANConstruction-PT-010-ReachabilityFireability-00(SAT) depth K=1 took 77 ms
Compilation finished in 993 ms.
Running link step : cd /tmp/ltsmin5201880297231495058;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5201880297231495058;'/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' 'CANConstructionPT010ReachabilityFireability00==true'
[2022-06-02 20:18:44] [INFO ] BMC solution for property CANConstruction-PT-010-ReachabilityFireability-00(UNSAT) depth K=3 took 871 ms
[2022-06-02 20:18:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesCANConstruction-PT-010-ReachabilityFireability-00
[2022-06-02 20:18:45] [INFO ] KInduction solution for property CANConstruction-PT-010-ReachabilityFireability-00(SAT) depth K=2 took 998 ms
[2022-06-02 20:18:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesCANConstruction-PT-010-ReachabilityFireability-00
[2022-06-02 20:18:56] [INFO ] KInduction solution for property CANConstruction-PT-010-ReachabilityFireability-00(SAT) depth K=3 took 10781 ms
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\_mod\_flat,3.45047e+07,6.37997,136720,8324,4245,157544,8399,530,561720,180,289917,0
Total reachable state count : 34504684

Verifying 1 reachability properties.
Reachability property CANConstruction-PT-010-ReachabilityFireability-00 does not hold.
FORMULA CANConstruction-PT-010-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : CANConstruction-PT-010-ReachabilityFireability-00

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-010-ReachabilityFireability-00,0,6.40016,136720,1,0,157544,8399,535,561720,182,289917,3
[2022-06-02 20:19:00] [WARNING] Interrupting SMT solver.
[2022-06-02 20:19:00] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2022-06-02 20:19:00] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 20:19:00] [WARNING] Unexpected error occurred while running SMT. Was verifying CANConstruction-PT-010-ReachabilityFireability-00 SMT depth 4
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 20:19:00] [INFO ] During BMC, SMT solver timed out at depth 4
[2022-06-02 20:19:00] [WARNING] Unexpected error occurred while running SMT. Was verifying CANConstruction-PT-010-ReachabilityFireability-00 K-induction depth 4
Exception in thread "Thread-7" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
[2022-06-02 20:19:00] [INFO ] BMC solving timed out (3600000 secs) at depth 4
[2022-06-02 20:19:00] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 62556 ms.

BK_STOP 1654201140456

--------------------
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-010"
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-010, 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-165251918600495"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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