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.r312-tall-165472281600020.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 BugTracking-PT-q3m008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281600020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 10K Jun 7 16:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 16:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Jun 7 16:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 7 16:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Jun 6 15:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.8K Jun 7 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 7 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 7 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Jun 7 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q3m008-LTLFireability-00
FORMULA_NAME BugTracking-PT-q3m008-LTLFireability-01
FORMULA_NAME BugTracking-PT-q3m008-LTLFireability-02
FORMULA_NAME BugTracking-PT-q3m008-LTLFireability-03
FORMULA_NAME BugTracking-PT-q3m008-LTLFireability-04
FORMULA_NAME BugTracking-PT-q3m008-LTLFireability-05
FORMULA_NAME BugTracking-PT-q3m008-LTLFireability-06
FORMULA_NAME BugTracking-PT-q3m008-LTLFireability-07
FORMULA_NAME BugTracking-PT-q3m008-LTLFireability-08
FORMULA_NAME BugTracking-PT-q3m008-LTLFireability-09
FORMULA_NAME BugTracking-PT-q3m008-LTLFireability-10
FORMULA_NAME BugTracking-PT-q3m008-LTLFireability-11
FORMULA_NAME BugTracking-PT-q3m008-LTLFireability-12
FORMULA_NAME BugTracking-PT-q3m008-LTLFireability-13
FORMULA_NAME BugTracking-PT-q3m008-LTLFireability-14
FORMULA_NAME BugTracking-PT-q3m008-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654727225789

Running Version 202205111006
[2022-06-08 22:27:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-08 22:27:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 22:27:07] [INFO ] Load time of PNML (sax parser for PT used): 776 ms
[2022-06-08 22:27:07] [INFO ] Transformed 754 places.
[2022-06-08 22:27:07] [INFO ] Transformed 27370 transitions.
[2022-06-08 22:27:07] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 989 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 117 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q3m008-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 87 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2022-06-08 22:27:08] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2022-06-08 22:27:08] [INFO ] Computed 8 place invariants in 39 ms
[2022-06-08 22:27:08] [INFO ] Implicit Places using invariants in 504 ms returned []
[2022-06-08 22:27:08] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2022-06-08 22:27:08] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-08 22:27:09] [INFO ] State equation strengthened by 240 read => feed constraints.
[2022-06-08 22:27:10] [INFO ] Implicit Places using invariants and state equation in 1857 ms returned []
Implicit Place search using SMT with State Equation took 2388 ms to find 0 implicit places.
[2022-06-08 22:27:10] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2022-06-08 22:27:10] [INFO ] Computed 8 place invariants in 20 ms
[2022-06-08 22:27:11] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2750/2769 transitions.
Finished structural reductions, in 1 iterations. Remains : 237/240 places, 2750/2769 transitions.
Support contains 6 out of 237 places after structural reductions.
[2022-06-08 22:27:12] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2022-06-08 22:27:12] [INFO ] Flatten gal took : 271 ms
FORMULA BugTracking-PT-q3m008-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-08 22:27:12] [INFO ] Flatten gal took : 194 ms
[2022-06-08 22:27:12] [INFO ] Input system was already deterministic with 2750 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 129861 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129861 steps, saw 74579 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-08 22:27:16] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2022-06-08 22:27:16] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-08 22:27:16] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 22:27:16] [INFO ] After 647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-08 22:27:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 22:27:17] [INFO ] After 553ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-08 22:27:17] [INFO ] State equation strengthened by 240 read => feed constraints.
[2022-06-08 22:27:17] [INFO ] After 340ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-08 22:27:18] [INFO ] Deduced a trap composed of 11 places in 289 ms of which 6 ms to minimize.
[2022-06-08 22:27:18] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 1 ms to minimize.
[2022-06-08 22:27:18] [INFO ] Deduced a trap composed of 62 places in 205 ms of which 4 ms to minimize.
[2022-06-08 22:27:18] [INFO ] Deduced a trap composed of 63 places in 221 ms of which 1 ms to minimize.
[2022-06-08 22:27:19] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 0 ms to minimize.
[2022-06-08 22:27:19] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 1 ms to minimize.
[2022-06-08 22:27:19] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 1 ms to minimize.
[2022-06-08 22:27:20] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 0 ms to minimize.
[2022-06-08 22:27:20] [INFO ] Deduced a trap composed of 63 places in 214 ms of which 0 ms to minimize.
[2022-06-08 22:27:20] [INFO ] Deduced a trap composed of 63 places in 205 ms of which 1 ms to minimize.
[2022-06-08 22:27:20] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 0 ms to minimize.
[2022-06-08 22:27:21] [INFO ] Deduced a trap composed of 52 places in 186 ms of which 0 ms to minimize.
[2022-06-08 22:27:21] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 0 ms to minimize.
[2022-06-08 22:27:21] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 1 ms to minimize.
[2022-06-08 22:27:21] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 1 ms to minimize.
[2022-06-08 22:27:21] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4189 ms
[2022-06-08 22:27:22] [INFO ] After 4757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 140 ms.
[2022-06-08 22:27:22] [INFO ] After 5537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 148 ms.
Support contains 6 out of 237 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 235 transition count 2748
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 230 transition count 2748
Applied a total of 14 rules in 187 ms. Remains 230 /237 variables (removed 7) and now considering 2748/2750 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 230/237 places, 2748/2750 transitions.
Incomplete random walk after 10000 steps, including 97 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 118381 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118381 steps, saw 77964 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-08 22:27:25] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2022-06-08 22:27:25] [INFO ] Computed 8 place invariants in 19 ms
[2022-06-08 22:27:25] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 22:27:26] [INFO ] After 533ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-08 22:27:26] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-08 22:27:26] [INFO ] After 204ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-08 22:27:26] [INFO ] After 807ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-08 22:27:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 22:27:27] [INFO ] After 506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-08 22:27:27] [INFO ] After 261ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-08 22:27:27] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 1 ms to minimize.
[2022-06-08 22:27:28] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 1 ms to minimize.
[2022-06-08 22:27:28] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 0 ms to minimize.
[2022-06-08 22:27:28] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 0 ms to minimize.
[2022-06-08 22:27:28] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 1 ms to minimize.
[2022-06-08 22:27:29] [INFO ] Deduced a trap composed of 48 places in 204 ms of which 1 ms to minimize.
[2022-06-08 22:27:29] [INFO ] Deduced a trap composed of 52 places in 209 ms of which 1 ms to minimize.
[2022-06-08 22:27:29] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 1 ms to minimize.
[2022-06-08 22:27:29] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 0 ms to minimize.
[2022-06-08 22:27:30] [INFO ] Deduced a trap composed of 57 places in 169 ms of which 0 ms to minimize.
[2022-06-08 22:27:30] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 0 ms to minimize.
[2022-06-08 22:27:30] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 0 ms to minimize.
[2022-06-08 22:27:30] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 1 ms to minimize.
[2022-06-08 22:27:31] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 0 ms to minimize.
[2022-06-08 22:27:31] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3741 ms
[2022-06-08 22:27:31] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 0 ms to minimize.
[2022-06-08 22:27:31] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2022-06-08 22:27:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2022-06-08 22:27:31] [INFO ] After 4547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 201 ms.
[2022-06-08 22:27:31] [INFO ] After 5313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 67 ms.
Support contains 6 out of 230 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 47 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 230/230 places, 2748/2748 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 46 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2022-06-08 22:27:32] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2022-06-08 22:27:32] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-08 22:27:32] [INFO ] Implicit Places using invariants in 751 ms returned []
[2022-06-08 22:27:32] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2022-06-08 22:27:32] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 22:27:33] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-08 22:27:34] [INFO ] Implicit Places using invariants and state equation in 1819 ms returned []
Implicit Place search using SMT with State Equation took 2573 ms to find 0 implicit places.
[2022-06-08 22:27:35] [INFO ] Redundant transitions in 340 ms returned []
[2022-06-08 22:27:35] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2022-06-08 22:27:35] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-08 22:27:35] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 230/230 places, 2748/2748 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 230 transition count 2618
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 228 transition count 2616
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 228 transition count 2615
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 228 transition count 2611
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 224 transition count 2611
Applied a total of 143 rules in 158 ms. Remains 224 /230 variables (removed 6) and now considering 2611/2748 (removed 137) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2611 rows 224 cols
[2022-06-08 22:27:35] [INFO ] Computed 9 place invariants in 13 ms
[2022-06-08 22:27:36] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-08 22:27:36] [INFO ] After 499ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-08 22:27:36] [INFO ] After 619ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-08 22:27:36] [INFO ] After 670ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-08 22:27:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-08 22:27:37] [INFO ] After 483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-08 22:27:37] [INFO ] After 694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 125 ms.
[2022-06-08 22:27:37] [INFO ] After 875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Computed a total of 6 stabilizing places and 111 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(F(p0))))))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Applied a total of 4 rules in 75 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2022-06-08 22:27:37] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2022-06-08 22:27:37] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-08 22:27:37] [INFO ] Implicit Places using invariants in 286 ms returned []
[2022-06-08 22:27:37] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2022-06-08 22:27:38] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 22:27:38] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-08 22:27:39] [INFO ] Implicit Places using invariants and state equation in 1770 ms returned []
Implicit Place search using SMT with State Equation took 2063 ms to find 0 implicit places.
[2022-06-08 22:27:39] [INFO ] Redundant transitions in 97 ms returned []
[2022-06-08 22:27:39] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2022-06-08 22:27:39] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-08 22:27:40] [INFO ] Dead Transitions using invariants and state equation in 749 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/237 places, 2753/2750 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m008-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s42 1) (GEQ s160 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 6 ms.
FORMULA BugTracking-PT-q3m008-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q3m008-LTLFireability-00 finished in 3329 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(p0)&&G(p0)))))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Applied a total of 4 rules in 59 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2022-06-08 22:27:40] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2022-06-08 22:27:40] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 22:27:41] [INFO ] Implicit Places using invariants in 293 ms returned []
[2022-06-08 22:27:41] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2022-06-08 22:27:41] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-08 22:27:41] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-08 22:27:42] [INFO ] Implicit Places using invariants and state equation in 1663 ms returned []
Implicit Place search using SMT with State Equation took 1959 ms to find 0 implicit places.
[2022-06-08 22:27:43] [INFO ] Redundant transitions in 144 ms returned []
[2022-06-08 22:27:43] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2022-06-08 22:27:43] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-08 22:27:43] [INFO ] Dead Transitions using invariants and state equation in 785 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/237 places, 2753/2750 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m008-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s66 1) (GEQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 5 ms.
FORMULA BugTracking-PT-q3m008-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q3m008-LTLFireability-01 finished in 3038 ms.
All properties solved by simple procedures.
Total runtime 36983 ms.

BK_STOP 1654727263998

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -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="BugTracking-PT-q3m008"
export BK_EXAMINATION="LTLFireability"
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 BugTracking-PT-q3m008, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472281600020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m008.tgz
mv BugTracking-PT-q3m008 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;