Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:42 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 DoubleExponent-PT-003-ReachabilityFireability-2024-00
FORMULA_NAME DoubleExponent-PT-003-ReachabilityFireability-2024-01
FORMULA_NAME DoubleExponent-PT-003-ReachabilityFireability-2024-02
FORMULA_NAME DoubleExponent-PT-003-ReachabilityFireability-2024-03
FORMULA_NAME DoubleExponent-PT-003-ReachabilityFireability-2024-04
FORMULA_NAME DoubleExponent-PT-003-ReachabilityFireability-2024-05
FORMULA_NAME DoubleExponent-PT-003-ReachabilityFireability-2024-06
FORMULA_NAME DoubleExponent-PT-003-ReachabilityFireability-2024-07
FORMULA_NAME DoubleExponent-PT-003-ReachabilityFireability-2024-08
FORMULA_NAME DoubleExponent-PT-003-ReachabilityFireability-2024-09
FORMULA_NAME DoubleExponent-PT-003-ReachabilityFireability-2024-10
FORMULA_NAME DoubleExponent-PT-003-ReachabilityFireability-2024-11
FORMULA_NAME DoubleExponent-PT-003-ReachabilityFireability-2024-12
FORMULA_NAME DoubleExponent-PT-003-ReachabilityFireability-2024-13
FORMULA_NAME DoubleExponent-PT-003-ReachabilityFireability-2024-14
FORMULA_NAME DoubleExponent-PT-003-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716385608246

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-22 13:46:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 13:46:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:46:49] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-22 13:46:49] [INFO ] Transformed 163 places.
[2024-05-22 13:46:49] [INFO ] Transformed 148 transitions.
[2024-05-22 13:46:49] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-05-22 13:46:50] [INFO ] Flatten gal took : 82 ms
[2024-05-22 13:46:50] [INFO ] Flatten gal took : 42 ms
[2024-05-22 13:46:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6693123688239679908.gal : 19 ms
RANDOM walk for 40000 steps (1331 resets) in 1614 ms. (24 steps per ms) remains 16/16 properties
[2024-05-22 13:46:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10744194975091562216.prop : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6693123688239679908.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10744194975091562216.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4000 steps (122 resets) in 118 ms. (33 steps per ms) remains 16/16 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 4001 steps (113 resets) in 105 ms. (37 steps per ms) remains 16/16 properties
Loading property file /tmp/ReachabilityCardinality10744194975091562216.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
BEST_FIRST walk for 4000 steps (109 resets) in 106 ms. (37 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :12 after 25
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :25 after 32
BEST_FIRST walk for 4000 steps (115 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :32 after 73
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :73 after 149
BEST_FIRST walk for 4001 steps (111 resets) in 64 ms. (61 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :149 after 517
BEST_FIRST walk for 4001 steps (113 resets) in 70 ms. (56 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (104 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :517 after 2692
BEST_FIRST walk for 4000 steps (119 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (114 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (117 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (114 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (104 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (113 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (103 resets) in 152 ms. (26 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (116 resets) in 83 ms. (47 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
Reachability property DoubleExponent-PT-003-ReachabilityFireability-2024-11 is true.
FORMULA DoubleExponent-PT-003-ReachabilityFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property DoubleExponent-PT-003-ReachabilityFireability-2024-08 is true.
FORMULA DoubleExponent-PT-003-ReachabilityFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property DoubleExponent-PT-003-ReachabilityFireability-2024-05 does not hold.
FORMULA DoubleExponent-PT-003-ReachabilityFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property DoubleExponent-PT-003-ReachabilityFireability-2024-03 does not hold.
FORMULA DoubleExponent-PT-003-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property DoubleExponent-PT-003-ReachabilityFireability-2024-02 is true.
FORMULA DoubleExponent-PT-003-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property DoubleExponent-PT-003-ReachabilityFireability-2024-00 is true.
FORMULA DoubleExponent-PT-003-ReachabilityFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :48682 after 59745
Interrupted probabilistic random walk after 261733 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :6 out of 16
Probabilistic random walk after 261733 steps, saw 130892 distinct states, run finished after 3013 ms. (steps per millisecond=86 ) properties seen :6
// Phase 1: matrix 148 rows 163 cols
[2024-05-22 13:46:53] [INFO ] Computed 19 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem DoubleExponent-PT-003-ReachabilityFireability-2024-01 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityFireability-2024-04 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityFireability-2024-07 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityFireability-2024-10 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityFireability-2024-12 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityFireability-2024-13 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityFireability-2024-14 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityFireability-2024-15 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 15/157 variables, 3/9 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 5/14 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/14 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/163 variables, 5/19 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 148/311 variables, 163/182 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/182 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/311 variables, 0/182 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 182 constraints, problems are : Problem set: 8 solved, 2 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/148 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/6 constraints. Problems are: Problem set: 8 solved, 2 unsolved
[2024-05-22 13:46:54] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 15 ms to minimize.
[2024-05-22 13:46:54] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-05-22 13:46:54] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:46:54] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:46:54] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:46:54] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-05-22 13:46:54] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 7/13 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/13 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/163 variables, 13/26 constraints. Problems are: Problem set: 8 solved, 2 unsolved
[2024-05-22 13:46:54] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:46:55] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-05-22 13:46:55] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
[2024-05-22 13:46:55] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 4/30 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/30 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 148/311 variables, 163/193 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 2/195 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/195 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/311 variables, 0/195 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 195 constraints, problems are : Problem set: 8 solved, 2 unsolved in 1144 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/10 constraints, Known Traps: 11/11 constraints]
After SMT, in 1759ms problems are : Problem set: 8 solved, 2 unsolved
Parikh walk visited 0 properties in 984 ms.
Support contains 48 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Graph (complete) has 269 edges and 163 vertex of which 159 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 159 transition count 140
Reduce places removed 8 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 15 rules applied. Total rules applied 24 place count 151 transition count 133
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 31 place count 144 transition count 133
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 31 place count 144 transition count 127
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 43 place count 138 transition count 127
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 61 place count 129 transition count 118
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 129 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 128 transition count 117
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 73 place count 128 transition count 107
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 83 place count 118 transition count 107
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 88 place count 118 transition count 107
Applied a total of 88 rules in 69 ms. Remains 118 /163 variables (removed 45) and now considering 107/148 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 118/163 places, 107/148 transitions.
RANDOM walk for 40000 steps (2082 resets) in 449 ms. (88 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (1614 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1612 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
Reachability property DoubleExponent-PT-003-ReachabilityFireability-2024-06 is true.
FORMULA DoubleExponent-PT-003-ReachabilityFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Interrupted probabilistic random walk after 1256122 steps, run timeout after 3001 ms. (steps per millisecond=418 ) properties seen :1 out of 2
Probabilistic random walk after 1256122 steps, saw 628090 distinct states, run finished after 3001 ms. (steps per millisecond=418 ) properties seen :1
// Phase 1: matrix 107 rows 118 cols
[2024-05-22 13:46:59] [INFO ] Computed 16 invariants in 5 ms
[2024-05-22 13:46:59] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/53 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/98 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/102 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/104 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 105/209 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/224 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/225 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 13:46:59] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 11 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :318071 after 329127
[2024-05-22 13:46:59] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/225 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 118/118 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/53 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/98 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 13:47:00] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/102 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/104 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 105/209 variables, 104/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 15/224 variables, 13/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/224 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/224 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/225 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/225 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/225 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/225 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 118/118 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 381ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 107/107 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 118 transition count 99
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 110 transition count 99
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 16 place count 110 transition count 95
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 106 transition count 95
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 68 place count 84 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 81 transition count 74
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 81 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 80 transition count 73
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 84 place count 80 transition count 65
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 92 place count 72 transition count 65
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 99 place count 72 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 71 transition count 64
Applied a total of 100 rules in 31 ms. Remains 71 /118 variables (removed 47) and now considering 64/107 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 71/118 places, 64/107 transitions.
RANDOM walk for 40000 steps (5505 resets) in 621 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3595 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Probably explored full state space saw : 644258 states, properties seen :0
Probabilistic random walk after 1288547 steps, saw 644258 distinct states, run finished after 2296 ms. (steps per millisecond=561 ) properties seen :0
Interrupted probabilistic random walk after 1485553 steps, run timeout after 3001 ms. (steps per millisecond=495 ) properties seen :0 out of 1
Exhaustive walk after 1485553 steps, saw 742829 distinct states, run finished after 3001 ms. (steps per millisecond=495 ) properties seen :0
// Phase 1: matrix 64 rows 71 cols
[2024-05-22 13:47:05] [INFO ] Computed 16 invariants in 2 ms
[2024-05-22 13:47:05] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/32 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/60 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 13:47:05] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/62 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 63/125 variables, 62/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/134 variables, 8/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/134 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/134 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/135 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/135 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/135 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 71/71 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/32 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/60 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/62 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 63/125 variables, 62/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/134 variables, 8/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/134 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/134 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/134 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/135 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/135 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/135 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 71/71 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 294ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 71/71 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-22 13:47:06] [INFO ] Invariant cache hit.
[2024-05-22 13:47:06] [INFO ] Implicit Places using invariants in 176 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 190 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 70/71 places, 64/64 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 69 transition count 63
Applied a total of 2 rules in 5 ms. Remains 69 /70 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 69 cols
[2024-05-22 13:47:06] [INFO ] Computed 15 invariants in 2 ms
[2024-05-22 13:47:06] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-22 13:47:06] [INFO ] Invariant cache hit.
[2024-05-22 13:47:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 13:47:06] [INFO ] Implicit Places using invariants and state equation in 315 ms returned [38, 43, 61, 66]
[2024-05-22 13:47:06] [INFO ] Actually due to overlaps returned [43, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 421 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 67/71 places, 63/64 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 62
Applied a total of 2 rules in 4 ms. Remains 66 /67 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 66 cols
[2024-05-22 13:47:06] [INFO ] Computed 13 invariants in 2 ms
[2024-05-22 13:47:06] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 13:47:06] [INFO ] Invariant cache hit.
[2024-05-22 13:47:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 13:47:06] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [58, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 189 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 64/71 places, 62/64 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 61
Applied a total of 2 rules in 6 ms. Remains 63 /64 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 63 cols
[2024-05-22 13:47:06] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 13:47:06] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 13:47:06] [INFO ] Invariant cache hit.
[2024-05-22 13:47:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 13:47:07] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 63/71 places, 61/64 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 979 ms. Remains : 63/71 places, 61/64 transitions.
RANDOM walk for 40000 steps (6192 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3830 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1439191 steps, run visited all 1 properties in 2323 ms. (steps per millisecond=619 )
Probabilistic random walk after 1439191 steps, saw 719642 distinct states, run finished after 2329 ms. (steps per millisecond=617 ) properties seen :1
FORMULA DoubleExponent-PT-003-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 20070 ms.

BK_STOP 1716385629490

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DoubleExponent-PT-003"
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-5568"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-003, 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 r136-tall-171631132900543"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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