About the Execution of ITS-Tools for DoubleExponent-PT-004
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6396.296 | 3600000.00 | 10591786.00 | 6705.30 | FT?T?FTFTTTTFTTT | normal |
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.r078-tall-165260110000190.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 DoubleExponent-PT-004, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110000190
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 8.9K Apr 29 13:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 29 13:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 29 13:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 13:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 29 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 29 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 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 67K 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 DoubleExponent-PT-004-ReachabilityCardinality-00
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-01
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-02
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-03
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-04
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-05
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-06
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-07
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-08
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-09
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-10
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-11
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-12
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-13
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-14
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1654186258717
Running Version 202205111006
[2022-06-02 16:10:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 16:10:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:11:00] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2022-06-02 16:11:00] [INFO ] Transformed 216 places.
[2022-06-02 16:11:00] [INFO ] Transformed 198 transitions.
[2022-06-02 16:11:00] [INFO ] Parsed PT model containing 216 places and 198 transitions in 178 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 328 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 204190 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 204190 steps, saw 102108 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 198 rows 216 cols
[2022-06-02 16:11:04] [INFO ] Computed 24 place invariants in 25 ms
[2022-06-02 16:11:04] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-06-02 16:11:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-02 16:11:04] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2022-06-02 16:11:04] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :6
[2022-06-02 16:11:04] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 5 ms to minimize.
[2022-06-02 16:11:04] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2022-06-02 16:11:04] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2022-06-02 16:11:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 241 ms
[2022-06-02 16:11:05] [INFO ] Deduced a trap composed of 96 places in 62 ms of which 1 ms to minimize.
[2022-06-02 16:11:05] [INFO ] Deduced a trap composed of 86 places in 61 ms of which 1 ms to minimize.
[2022-06-02 16:11:05] [INFO ] Deduced a trap composed of 103 places in 58 ms of which 0 ms to minimize.
[2022-06-02 16:11:05] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 0 ms to minimize.
[2022-06-02 16:11:05] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2022-06-02 16:11:05] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 0 ms to minimize.
[2022-06-02 16:11:05] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2022-06-02 16:11:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 566 ms
[2022-06-02 16:11:05] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 0 ms to minimize.
[2022-06-02 16:11:05] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 0 ms to minimize.
[2022-06-02 16:11:05] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 0 ms to minimize.
[2022-06-02 16:11:05] [INFO ] Deduced a trap composed of 97 places in 48 ms of which 0 ms to minimize.
[2022-06-02 16:11:05] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 0 ms to minimize.
[2022-06-02 16:11:06] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 0 ms to minimize.
[2022-06-02 16:11:06] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 1 ms to minimize.
[2022-06-02 16:11:06] [INFO ] Deduced a trap composed of 99 places in 53 ms of which 1 ms to minimize.
[2022-06-02 16:11:06] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 0 ms to minimize.
[2022-06-02 16:11:06] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 0 ms to minimize.
[2022-06-02 16:11:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 675 ms
[2022-06-02 16:11:06] [INFO ] After 1815ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :6
Attempting to minimize the solution found.
Minimization took 146 ms.
[2022-06-02 16:11:06] [INFO ] After 2154ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :6
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 5648 ms.
Support contains 27 out of 216 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 216/216 places, 198/198 transitions.
Graph (complete) has 360 edges and 216 vertex of which 213 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 213 transition count 169
Reduce places removed 29 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 34 rules applied. Total rules applied 64 place count 184 transition count 164
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 69 place count 179 transition count 164
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 69 place count 179 transition count 158
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 81 place count 173 transition count 158
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 145 place count 141 transition count 126
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 149 place count 139 transition count 126
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 164 place count 139 transition count 111
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 179 place count 124 transition count 111
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 192 place count 124 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 123 transition count 110
Applied a total of 193 rules in 62 ms. Remains 123 /216 variables (removed 93) and now considering 110/198 (removed 88) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/216 places, 110/198 transitions.
Incomplete random walk after 1000000 steps, including 94238 resets, run finished after 10759 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 581149 steps, including 39539 resets, run timeout after 5001 ms. (steps per millisecond=116 ) properties seen 0
Interrupted Best-First random walk after 575781 steps, including 39023 resets, run timeout after 5001 ms. (steps per millisecond=115 ) properties seen 0
Interrupted Best-First random walk after 563781 steps, including 38346 resets, run timeout after 5001 ms. (steps per millisecond=112 ) properties seen 0
Interrupted Best-First random walk after 657755 steps, including 44641 resets, run timeout after 5001 ms. (steps per millisecond=131 ) properties seen 0
Interrupted Best-First random walk after 650435 steps, including 44051 resets, run timeout after 5001 ms. (steps per millisecond=130 ) properties seen 0
Interrupted Best-First random walk after 648241 steps, including 43836 resets, run timeout after 5001 ms. (steps per millisecond=129 ) properties seen 0
Probably explored full state space saw : 639200 states, properties seen :0
Probabilistic random walk after 1278443 steps, saw 639200 distinct states, run finished after 13295 ms. (steps per millisecond=96 ) properties seen :0
Interrupted probabilistic random walk after 17560476 steps, run timeout after 120001 ms. (steps per millisecond=146 ) properties seen :{2=1, 3=1, 4=1, 5=1}
Exhaustive walk after 17560476 steps, saw 8780279 distinct states, run finished after 120001 ms. (steps per millisecond=146 ) properties seen :4
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 110 rows 123 cols
[2022-06-02 16:14:06] [INFO ] Computed 21 place invariants in 3 ms
[2022-06-02 16:14:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-02 16:14:06] [INFO ] [Real]Absence check using 2 positive and 19 generalized place invariants in 4 ms returned sat
[2022-06-02 16:14:06] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 16:14:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-02 16:14:06] [INFO ] [Nat]Absence check using 2 positive and 19 generalized place invariants in 4 ms returned sat
[2022-06-02 16:14:06] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 16:14:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-02 16:14:06] [INFO ] After 32ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 16:14:06] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2022-06-02 16:14:06] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2022-06-02 16:14:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2022-06-02 16:14:06] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2022-06-02 16:14:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2022-06-02 16:14:06] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-06-02 16:14:06] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 943 ms.
Support contains 22 out of 123 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 110/110 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 122 transition count 109
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 122 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 120 transition count 107
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 120 transition count 107
Applied a total of 8 rules in 21 ms. Remains 120 /123 variables (removed 3) and now considering 107/110 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 120/123 places, 107/110 transitions.
Incomplete random walk after 1000000 steps, including 94221 resets, run finished after 6271 ms. (steps per millisecond=159 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 67694 resets, run finished after 4819 ms. (steps per millisecond=207 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 67647 resets, run finished after 4655 ms. (steps per millisecond=214 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 9148095 steps, run timeout after 45001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 9148095 steps, saw 4573142 distinct states, run finished after 45001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 107 rows 120 cols
[2022-06-02 16:15:08] [INFO ] Computed 21 place invariants in 6 ms
[2022-06-02 16:15:08] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-02 16:15:08] [INFO ] [Real]Absence check using 2 positive and 19 generalized place invariants in 4 ms returned sat
[2022-06-02 16:15:08] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 16:15:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-06-02 16:15:08] [INFO ] [Nat]Absence check using 2 positive and 19 generalized place invariants in 4 ms returned sat
[2022-06-02 16:15:08] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 16:15:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-02 16:15:08] [INFO ] After 51ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 16:15:08] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2022-06-02 16:15:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-06-02 16:15:08] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2022-06-02 16:15:08] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2022-06-02 16:15:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2022-06-02 16:15:08] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-02 16:15:08] [INFO ] After 390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1000 ms.
Support contains 22 out of 120 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 120/120 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 120 /120 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 107/107 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 120/120 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 120 /120 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 120 cols
[2022-06-02 16:15:09] [INFO ] Computed 21 place invariants in 7 ms
[2022-06-02 16:15:09] [INFO ] Implicit Places using invariants in 67 ms returned [48, 49]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 118/120 places, 107/107 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 105
Applied a total of 4 rules in 11 ms. Remains 116 /118 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 116 cols
[2022-06-02 16:15:09] [INFO ] Computed 19 place invariants in 4 ms
[2022-06-02 16:15:10] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 105 rows 116 cols
[2022-06-02 16:15:10] [INFO ] Computed 19 place invariants in 2 ms
[2022-06-02 16:15:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-02 16:15:10] [INFO ] Implicit Places using invariants and state equation in 186 ms returned [21, 30, 78, 85, 105]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 250 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 111/120 places, 105/107 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 111 transition count 105
Applied a total of 4 rules in 11 ms. Remains 111 /111 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 111 cols
[2022-06-02 16:15:10] [INFO ] Computed 14 place invariants in 4 ms
[2022-06-02 16:15:10] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 105 rows 111 cols
[2022-06-02 16:15:10] [INFO ] Computed 14 place invariants in 7 ms
[2022-06-02 16:15:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-02 16:15:10] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 111/120 places, 105/107 transitions.
Finished structural reductions, in 3 iterations. Remains : 111/120 places, 105/107 transitions.
Incomplete random walk after 1000000 steps, including 101979 resets, run finished after 6697 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71878 resets, run finished after 4608 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71646 resets, run finished after 4736 ms. (steps per millisecond=211 ) properties (out of 2) seen :0
Probably explored full state space saw : 526995 states, properties seen :0
Probabilistic random walk after 1054030 steps, saw 526995 distinct states, run finished after 4946 ms. (steps per millisecond=213 ) properties seen :0
Interrupted probabilistic random walk after 9109390 steps, run timeout after 48001 ms. (steps per millisecond=189 ) properties seen :{}
Exhaustive walk after 9109390 steps, saw 4554818 distinct states, run finished after 48001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 105 rows 111 cols
[2022-06-02 16:16:19] [INFO ] Computed 14 place invariants in 6 ms
[2022-06-02 16:16:19] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-02 16:16:19] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2022-06-02 16:16:19] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 16:16:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-02 16:16:19] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2022-06-02 16:16:19] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 16:16:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-02 16:16:19] [INFO ] After 45ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 16:16:19] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2022-06-02 16:16:19] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2022-06-02 16:16:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2022-06-02 16:16:19] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-02 16:16:19] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 641 ms.
Support contains 22 out of 111 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 111/111 places, 105/105 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 111/111 places, 105/105 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 111/111 places, 105/105 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 111 cols
[2022-06-02 16:16:20] [INFO ] Computed 14 place invariants in 4 ms
[2022-06-02 16:16:20] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 105 rows 111 cols
[2022-06-02 16:16:20] [INFO ] Computed 14 place invariants in 2 ms
[2022-06-02 16:16:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-02 16:16:20] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2022-06-02 16:16:20] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 105 rows 111 cols
[2022-06-02 16:16:20] [INFO ] Computed 14 place invariants in 2 ms
[2022-06-02 16:16:20] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/111 places, 105/105 transitions.
Incomplete random walk after 1000000 steps, including 101909 resets, run finished after 6561 ms. (steps per millisecond=152 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71555 resets, run finished after 4543 ms. (steps per millisecond=220 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71748 resets, run finished after 4662 ms. (steps per millisecond=214 ) properties (out of 2) seen :0
Probably explored full state space saw : 526995 states, properties seen :0
Probabilistic random walk after 1054030 steps, saw 526995 distinct states, run finished after 4788 ms. (steps per millisecond=220 ) properties seen :0
Interrupted probabilistic random walk after 9072692 steps, run timeout after 45001 ms. (steps per millisecond=201 ) properties seen :{}
Exhaustive walk after 9072692 steps, saw 4536473 distinct states, run finished after 45001 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 105 rows 111 cols
[2022-06-02 16:17:26] [INFO ] Computed 14 place invariants in 5 ms
[2022-06-02 16:17:26] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-02 16:17:26] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2022-06-02 16:17:26] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 16:17:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-02 16:17:26] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2022-06-02 16:17:26] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 16:17:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-02 16:17:26] [INFO ] After 43ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 16:17:26] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2022-06-02 16:17:26] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2022-06-02 16:17:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2022-06-02 16:17:26] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-06-02 16:17:26] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 974 ms.
Support contains 22 out of 111 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 111/111 places, 105/105 transitions.
Applied a total of 0 rules in 8 ms. Remains 111 /111 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 111/111 places, 105/105 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 111/111 places, 105/105 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 111 cols
[2022-06-02 16:17:27] [INFO ] Computed 14 place invariants in 1 ms
[2022-06-02 16:17:27] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 105 rows 111 cols
[2022-06-02 16:17:27] [INFO ] Computed 14 place invariants in 3 ms
[2022-06-02 16:17:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-02 16:17:27] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2022-06-02 16:17:27] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 105 rows 111 cols
[2022-06-02 16:17:27] [INFO ] Computed 14 place invariants in 2 ms
[2022-06-02 16:17:28] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/111 places, 105/105 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 109 transition count 103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 109 transition count 101
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 107 transition count 101
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 107 transition count 101
Applied a total of 9 rules in 12 ms. Remains 107 /111 variables (removed 4) and now considering 101/105 (removed 4) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 101 rows 107 cols
[2022-06-02 16:17:28] [INFO ] Computed 14 place invariants in 3 ms
[2022-06-02 16:17:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-02 16:17:28] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2022-06-02 16:17:28] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 16:17:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-02 16:17:28] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2022-06-02 16:17:28] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 16:17:28] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-02 16:17:28] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-02 16:17:28] [INFO ] Flatten gal took : 35 ms
[2022-06-02 16:17:28] [INFO ] Flatten gal took : 13 ms
[2022-06-02 16:17:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10771146236771849581.gal : 6 ms
[2022-06-02 16:17:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15720886438481248577.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/ReachabilityCardinality10771146236771849581.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15720886438481248577.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15720886438481248577.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 39
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :39 after 97
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :97 after 198
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :198 after 529
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :529 after 1747
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1747 after 4903
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4903 after 19029
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :19029 after 94177
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :94177 after 791778
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :791778 after 1.77127e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.77127e+06 after 7.87138e+06
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :7.87138e+06 after 2.77133e+07
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :2.77133e+07 after 1.07794e+08
Detected timeout of ITS tools.
[2022-06-02 16:17:43] [INFO ] Flatten gal took : 11 ms
[2022-06-02 16:17:43] [INFO ] Applying decomposition
[2022-06-02 16:17:43] [INFO ] Flatten gal took : 8 ms
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/graph13902206747936981184.txt' '-o' '/tmp/graph13902206747936981184.bin' '-w' '/tmp/graph13902206747936981184.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13902206747936981184.bin' '-l' '-1' '-v' '-w' '/tmp/graph13902206747936981184.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:17:43] [INFO ] Decomposing Gal with order
[2022-06-02 16:17:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:17:43] [INFO ] Removed a total of 49 redundant transitions.
[2022-06-02 16:17:43] [INFO ] Flatten gal took : 43 ms
[2022-06-02 16:17:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 9 ms.
[2022-06-02 16:17:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7914200586644266027.gal : 4 ms
[2022-06-02 16:17:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10289767461158234772.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/ReachabilityCardinality7914200586644266027.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10289767461158234772.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/ReachabilityCardinality10289767461158234772.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 39
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :39 after 97
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :97 after 220
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :220 after 558
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :558 after 1848
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1848 after 7543
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :7543 after 30342
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :30342 after 177680
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :177680 after 1.37864e+06
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.37864e+06 after 4.23563e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3514362838061747135
[2022-06-02 16:17:58] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3514362838061747135
Running compilation step : cd /tmp/ltsmin3514362838061747135;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
Compilation finished in 286 ms.
Running link step : cd /tmp/ltsmin3514362838061747135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3514362838061747135;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'DoubleExponentPT004ReachabilityCardinality02==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-02 16:18:13] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15575324618312923909
[2022-06-02 16:18:13] [INFO ] Applying decomposition
[2022-06-02 16:18:13] [INFO ] Flatten gal took : 8 ms
[2022-06-02 16:18:13] [INFO ] Computing symmetric may disable matrix : 105 transitions.
[2022-06-02 16:18:13] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:18:13] [INFO ] Computing symmetric may enable matrix : 105 transitions.
[2022-06-02 16:18:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:18:13] [INFO ] Computing Do-Not-Accords matrix : 105 transitions.
[2022-06-02 16:18:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:18:13] [INFO ] Flatten gal took : 18 ms
[2022-06-02 16:18:13] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15575324618312923909
Running compilation step : cd /tmp/ltsmin15575324618312923909;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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 16:18:13] [INFO ] Input system was already deterministic with 105 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/graph2940313433864369006.txt' '-o' '/tmp/graph2940313433864369006.bin' '-w' '/tmp/graph2940313433864369006.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2940313433864369006.bin' '-l' '-1' '-v' '-w' '/tmp/graph2940313433864369006.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:18:13] [INFO ] Decomposing Gal with order
[2022-06-02 16:18:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:18:13] [INFO ] Removed a total of 40 redundant transitions.
[2022-06-02 16:18:13] [INFO ] Flatten gal took : 19 ms
[2022-06-02 16:18:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 20 ms.
[2022-06-02 16:18:14] [INFO ] Ran tautology test, simplified 0 / 2 in 134 ms.
[2022-06-02 16:18:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4292222264175259591.gal : 3 ms
[2022-06-02 16:18:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17607265208143843339.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/ReachabilityCardinality4292222264175259591.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17607265208143843339.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2022-06-02 16:18:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=0 took 6 ms
[2022-06-02 16:18:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=0 took 0 ms
[2022-06-02 16:18:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=1 took 0 ms
[2022-06-02 16:18:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=1 took 1 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...320
[2022-06-02 16:18:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=2 took 9 ms
[2022-06-02 16:18:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=2 took 1 ms
[2022-06-02 16:18:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=3 took 15 ms
[2022-06-02 16:18:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=3 took 2 ms
Loading property file /tmp/ReachabilityCardinality17607265208143843339.prop.
[2022-06-02 16:18:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=4 took 13 ms
[2022-06-02 16:18:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=4 took 7 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
[2022-06-02 16:18:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=5 took 39 ms
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 17
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :17 after 32
SDD proceeding with computation,2 properties remain. new max is 128
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 105 rows 111 cols
[2022-06-02 16:18:14] [INFO ] Computed 14 place invariants in 1 ms
[2022-06-02 16:18:14] [INFO ] Computed 14 place invariants in 2 ms
SDD size :32 after 58
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :58 after 113
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :113 after 462
[2022-06-02 16:18:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=5 took 42 ms
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :462 after 1466
Compilation finished in 319 ms.
Running link step : cd /tmp/ltsmin15575324618312923909;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin15575324618312923909;'/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' 'DoubleExponentPT004ReachabilityCardinality02==true'
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1466 after 13557
[2022-06-02 16:18:14] [INFO ] Proved 111 variables to be positive in 237 ms
[2022-06-02 16:18:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-02
[2022-06-02 16:18:14] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(SAT) depth K=0 took 3 ms
[2022-06-02 16:18:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-04
[2022-06-02 16:18:14] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(SAT) depth K=0 took 3 ms
[2022-06-02 16:18:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-02
[2022-06-02 16:18:14] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(SAT) depth K=1 took 41 ms
[2022-06-02 16:18:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-04
[2022-06-02 16:18:14] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(SAT) depth K=1 took 29 ms
[2022-06-02 16:18:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=6 took 329 ms
[2022-06-02 16:18:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-02
[2022-06-02 16:18:14] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(SAT) depth K=2 took 262 ms
[2022-06-02 16:18:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=6 took 391 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :13557 after 75141
[2022-06-02 16:18:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-04
[2022-06-02 16:18:15] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(SAT) depth K=2 took 668 ms
[2022-06-02 16:18:16] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=7 took 1192 ms
[2022-06-02 16:18:16] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=7 took 682 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :75141 after 368570
[2022-06-02 16:18:18] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=8 took 2075 ms
[2022-06-02 16:18:19] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=8 took 1103 ms
[2022-06-02 16:18:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-02
[2022-06-02 16:18:21] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(SAT) depth K=3 took 6158 ms
[2022-06-02 16:18:23] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=9 took 3765 ms
[2022-06-02 16:18:27] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=9 took 3980 ms
[2022-06-02 16:18:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-04
[2022-06-02 16:18:28] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(SAT) depth K=3 took 6575 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.118e+06 after 1.118e+06
[2022-06-02 16:18:38] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=10 took 10293 ms
[2022-06-02 16:18:45] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=10 took 7159 ms
[2022-06-02 16:18:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-02
[2022-06-02 16:18:50] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(SAT) depth K=4 took 21967 ms
[2022-06-02 16:18:51] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=11 took 6632 ms
[2022-06-02 16:18:55] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=11 took 3644 ms
[2022-06-02 16:18:58] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=12 took 3407 ms
[2022-06-02 16:19:11] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=12 took 12762 ms
[2022-06-02 16:19:19] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=13 took 8047 ms
[2022-06-02 16:19:26] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=13 took 7221 ms
[2022-06-02 16:19:40] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=14 took 14023 ms
[2022-06-02 16:19:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-04
[2022-06-02 16:19:44] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(SAT) depth K=4 took 53916 ms
[2022-06-02 16:20:07] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=14 took 26995 ms
[2022-06-02 16:20:19] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=15 took 11438 ms
[2022-06-02 16:20:44] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=15 took 25551 ms
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :8.52819e+07 after 8.76848e+07
[2022-06-02 16:20:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-02
[2022-06-02 16:20:58] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(SAT) depth K=5 took 74079 ms
[2022-06-02 16:21:10] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=16 took 25286 ms
[2022-06-02 16:21:54] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=16 took 43819 ms
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Initializing POR dependencies: labels 107, guards 105
pins2lts-mc-linux64( 1/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.041: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 2/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.065: "DoubleExponentPT004ReachabilityCardinality02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.065: "DoubleExponentPT004ReachabilityCardinality02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.065: "DoubleExponentPT004ReachabilityCardinality02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.060: "DoubleExponentPT004ReachabilityCardinality02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.066: There are 107 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.066: State length is 111, there are 105 groups
pins2lts-mc-linux64( 0/ 8), 0.066: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.066: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.066: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.066: Visible groups: 0 / 105, labels: 1 / 107
pins2lts-mc-linux64( 0/ 8), 0.066: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.066: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.065: "DoubleExponentPT004ReachabilityCardinality02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.060: "DoubleExponentPT004ReachabilityCardinality02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.053: "DoubleExponentPT004ReachabilityCardinality02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.065: "DoubleExponentPT004ReachabilityCardinality02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.072: ~53 levels ~960 states ~1008 transitions
pins2lts-mc-linux64( 0/ 8), 0.090: ~66 levels ~1920 states ~1968 transitions
pins2lts-mc-linux64( 0/ 8), 0.130: ~118 levels ~3840 states ~3896 transitions
pins2lts-mc-linux64( 7/ 8), 0.263: ~159 levels ~7680 states ~8072 transitions
pins2lts-mc-linux64( 0/ 8), 0.323: ~204 levels ~15360 states ~16576 transitions
pins2lts-mc-linux64( 0/ 8), 0.486: ~333 levels ~30720 states ~31768 transitions
pins2lts-mc-linux64( 0/ 8), 0.707: ~444 levels ~61440 states ~62248 transitions
pins2lts-mc-linux64( 0/ 8), 1.119: ~898 levels ~122880 states ~124400 transitions
pins2lts-mc-linux64( 7/ 8), 1.896: ~2328 levels ~245760 states ~247328 transitions
pins2lts-mc-linux64( 1/ 8), 3.186: ~3545 levels ~491520 states ~492032 transitions
pins2lts-mc-linux64( 7/ 8), 4.375: ~6330 levels ~983040 states ~994016 transitions
pins2lts-mc-linux64( 7/ 8), 6.753: ~9102 levels ~1966080 states ~1984240 transitions
pins2lts-mc-linux64( 7/ 8), 9.884: ~9163 levels ~3932160 states ~3987832 transitions
pins2lts-mc-linux64( 7/ 8), 16.060: ~10073 levels ~7864320 states ~7934688 transitions
pins2lts-mc-linux64( 7/ 8), 27.963: ~14453 levels ~15728640 states ~15777608 transitions
pins2lts-mc-linux64( 7/ 8), 52.978: ~19380 levels ~31457280 states ~31523536 transitions
pins2lts-mc-linux64( 7/ 8), 103.721: ~33553 levels ~62914560 states ~62958888 transitions
pins2lts-mc-linux64( 1/ 8), 208.038: ~66290 levels ~125829120 states ~125591304 transitions
pins2lts-mc-linux64( 2/ 8), 231.409: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 231.463:
pins2lts-mc-linux64( 0/ 8), 231.463: mean standard work distribution: 1.0% (states) 0.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 231.463:
pins2lts-mc-linux64( 0/ 8), 231.463: Explored 134092319 states 134217023 transitions, fanout: 1.001
pins2lts-mc-linux64( 0/ 8), 231.463: Total exploration time 231.390 sec (231.350 sec minimum, 231.361 sec on average)
pins2lts-mc-linux64( 0/ 8), 231.463: States per second: 579508, Transitions per second: 580047
pins2lts-mc-linux64( 0/ 8), 231.463: Ignoring proviso: 2
pins2lts-mc-linux64( 0/ 8), 231.463:
pins2lts-mc-linux64( 0/ 8), 231.463: Queue width: 8B, total height: 227794, memory: 1.74MB
pins2lts-mc-linux64( 0/ 8), 231.463: Tree memory: 1044.3MB, 8.2 B/state, compr.: 1.8%
pins2lts-mc-linux64( 0/ 8), 231.463: Tree fill ratio (roots/leafs): 99.0%/7.0%
pins2lts-mc-linux64( 0/ 8), 231.463: Stored 105 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 231.463: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 231.463: Est. total memory use: 1046.1MB (~1025.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15575324618312923909;'/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' 'DoubleExponentPT004ReachabilityCardinality02==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15575324618312923909;'/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' 'DoubleExponentPT004ReachabilityCardinality02==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 16:22:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-04
[2022-06-02 16:22:16] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(SAT) depth K=5 took 78082 ms
[2022-06-02 16:22:19] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=17 took 25545 ms
[2022-06-02 16:22:29] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=17 took 10197 ms
[2022-06-02 16:22:40] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=18 took 11080 ms
[2022-06-02 16:23:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-02
[2022-06-02 16:23:01] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(SAT) depth K=6 took 45755 ms
[2022-06-02 16:23:06] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=18 took 25416 ms
[2022-06-02 16:23:17] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=19 took 11278 ms
[2022-06-02 16:23:32] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=19 took 14984 ms
[2022-06-02 16:23:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-04
[2022-06-02 16:23:34] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(SAT) depth K=6 took 32713 ms
[2022-06-02 16:24:03] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=20 took 30400 ms
[2022-06-02 16:24:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-02
[2022-06-02 16:24:14] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(SAT) depth K=7 took 39331 ms
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :3.32761e+08 after 3.44591e+08
[2022-06-02 16:25:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-04
[2022-06-02 16:25:37] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(SAT) depth K=7 took 83119 ms
[2022-06-02 16:26:04] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=20 took 121485 ms
[2022-06-02 16:26:28] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=21 took 23524 ms
[2022-06-02 16:26:50] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=21 took 22961 ms
[2022-06-02 16:27:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=22 took 23158 ms
[2022-06-02 16:27:27] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=22 took 13211 ms
[2022-06-02 16:27:45] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=23 took 17807 ms
[2022-06-02 16:28:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=23 took 29352 ms
[2022-06-02 16:28:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-02
[2022-06-02 16:28:15] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(SAT) depth K=8 took 157906 ms
[2022-06-02 16:30:37] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=24 took 142492 ms
[2022-06-02 16:31:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-04
[2022-06-02 16:31:25] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(SAT) depth K=8 took 190506 ms
[2022-06-02 16:31:44] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=24 took 67311 ms
[2022-06-02 16:32:35] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=25 took 50768 ms
[2022-06-02 16:34:23] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=25 took 108321 ms
[2022-06-02 16:34:43] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-02
[2022-06-02 16:34:43] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(SAT) depth K=9 took 197705 ms
[2022-06-02 16:34:56] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=26 took 32693 ms
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :9.38797e+08 after 9.38798e+08
[2022-06-02 16:37:22] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=26 took 146480 ms
[2022-06-02 16:38:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-04
[2022-06-02 16:38:48] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(SAT) depth K=9 took 245414 ms
[2022-06-02 16:39:09] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=27 took 107209 ms
[2022-06-02 16:39:47] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=27 took 37606 ms
Detected timeout of ITS tools.
[2022-06-02 16:40:38] [INFO ] Applying decomposition
[2022-06-02 16:40:38] [INFO ] Flatten gal took : 7 ms
[2022-06-02 16:40:38] [INFO ] Decomposing Gal with order
[2022-06-02 16:40:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:40:38] [INFO ] Could not find partition element corresponding to p130 in partition [p114, p124, p138, p139, p142, p143],[p167, p169, p182, p195],[p189, p96],[p108, p204, p205],[p111, p144, p146],[p109, p112, p113, p131, p134, p207],[p116, p122, p128],[p210],[p163, p203],[p161, p164],[p162, p165, p185, p187],[p166, p198, p199],[p160, p193, p196, p201, p202, p212],[p179, p180, p181, p184],[p171, p214],[p10, p11],[p101, p104],[p12, p13, p24, p34, p52, p54],[p20, p21, p22, p28, p31],[p38, p42],[p43, p46, p47, p50],[p110, p152, p55, p58, p63],[p14],[p80, p81],[p106, p16, p8, p9, p99],[p57, p60, p92, p93, p95, p97],[p154, p157, p56, p59],[p69, p85, p87],[p150, p61, p89],[p159, p71],[p158, p73, p75, p77],
[2022-06-02 16:40:38] [INFO ] Could not find partition element corresponding to p140 in partition [p114, p124, p138, p139, p142, p143],[p167, p169, p182, p195],[p189, p96],[p108, p204, p205],[p111, p144, p146],[p109, p112, p113, p131, p134, p207],[p116, p122, p128],[p210],[p163, p203],[p161, p164],[p162, p165, p185, p187],[p166, p198, p199],[p160, p193, p196, p201, p202, p212],[p179, p180, p181, p184],[p171, p214],[p10, p11],[p101, p104],[p12, p13, p24, p34, p52, p54],[p20, p21, p22, p28, p31],[p38, p42],[p43, p46, p47, p50],[p110, p152, p55, p58, p63],[p14],[p80, p81],[p106, p16, p8, p9, p99],[p57, p60, p92, p93, p95, p97],[p154, p157, p56, p59],[p69, p85, p87],[p150, p61, p89],[p159, p71],[p158, p73, p75, p77],
[2022-06-02 16:40:38] [INFO ] Could not find partition element corresponding to p30 in partition [p114, p124, p138, p139, p142, p143],[p167, p169, p182, p195],[p189, p96],[p108, p204, p205],[p111, p144, p146],[p109, p112, p113, p131, p134, p207],[p116, p122, p128],[p210],[p163, p203],[p161, p164],[p162, p165, p185, p187],[p166, p198, p199],[p160, p193, p196, p201, p202, p212],[p179, p180, p181, p184],[p171, p214],[p10, p11],[p101, p104],[p12, p13, p24, p34, p52, p54],[p20, p21, p22, p28, p31],[p38, p42],[p43, p46, p47, p50],[p110, p152, p55, p58, p63],[p14],[p80, p81],[p106, p16, p8, p9, p99],[p57, p60, p92, p93, p95, p97],[p154, p157, p56, p59],[p69, p85, p87],[p150, p61, p89],[p159, p71],[p158, p73, p75, p77],
[2022-06-02 16:40:38] [INFO ] Could not find partition element corresponding to p40 in partition [p114, p124, p138, p139, p142, p143],[p167, p169, p182, p195],[p189, p96],[p108, p204, p205],[p111, p144, p146],[p109, p112, p113, p131, p134, p207],[p116, p122, p128],[p210],[p163, p203],[p161, p164],[p162, p165, p185, p187],[p166, p198, p199],[p160, p193, p196, p201, p202, p212],[p179, p180, p181, p184],[p171, p214],[p10, p11],[p101, p104],[p12, p13, p24, p34, p52, p54],[p20, p21, p22, p28, p31],[p38, p42],[p43, p46, p47, p50],[p110, p152, p55, p58, p63],[p14],[p80, p81],[p106, p16, p8, p9, p99],[p57, p60, p92, p93, p95, p97],[p154, p157, p56, p59],[p69, p85, p87],[p150, p61, p89],[p159, p71],[p158, p73, p75, p77],
[2022-06-02 16:40:38] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.ArrayIndexOutOfBoundsException: Index -1 out of bounds for length 32
at org.eclipse.emf.common.util.BasicEList.get(BasicEList.java:348)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:564)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:231)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:116)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:957)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-02 16:40:38] [INFO ] Flatten gal took : 6 ms
[2022-06-02 16:40:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5014088347436797066.gal : 1 ms
[2022-06-02 16:40:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality724500877241456453.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/ReachabilityCardinality5014088347436797066.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality724500877241456453.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...318
Loading property file /tmp/ReachabilityCardinality724500877241456453.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 17
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :17 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 57
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :57 after 112
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :112 after 387
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :387 after 1368
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1368 after 13527
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :13527 after 75220
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :75220 after 264994
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :264994 after 649510
[2022-06-02 16:40:50] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=28 took 62807 ms
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.34877e+07 after 2.42802e+07
[2022-06-02 16:41:41] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=28 took 50763 ms
[2022-06-02 16:42:14] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=29 took 33902 ms
[2022-06-02 16:42:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-02
[2022-06-02 16:42:28] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(SAT) depth K=10 took 219938 ms
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.19352e+08 after 2.1996e+08
[2022-06-02 16:45:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-04
[2022-06-02 16:45:54] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(SAT) depth K=10 took 206220 ms
[2022-06-02 16:48:58] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=29 took 403503 ms
[2022-06-02 16:51:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-02
[2022-06-02 16:51:49] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(SAT) depth K=11 took 354271 ms
[2022-06-02 16:52:43] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=30 took 224766 ms
[2022-06-02 16:57:03] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(UNSAT) depth K=30 took 260513 ms
[2022-06-02 16:59:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-04
[2022-06-02 16:59:02] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-04(SAT) depth K=11 took 433140 ms
Detected timeout of ITS tools.
[2022-06-02 17:03:02] [INFO ] Flatten gal took : 6 ms
[2022-06-02 17:03:02] [INFO ] Input system was already deterministic with 105 transitions.
[2022-06-02 17:03:02] [INFO ] Transformed 111 places.
[2022-06-02 17:03:02] [INFO ] Transformed 105 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-02 17:03:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8217271424684947041.gal : 1 ms
[2022-06-02 17:03:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8404437125334217539.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/ReachabilityCardinality8217271424684947041.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8404437125334217539.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...364
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality8404437125334217539.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 17
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :17 after 27
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :27 after 35
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :35 after 59
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :59 after 113
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :113 after 333
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :333 after 898
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :898 after 2995
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2995 after 22885
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :22885 after 96225
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :96225 after 269941
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :269941 after 624448
[2022-06-02 17:07:26] [INFO ] BMC solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(UNSAT) depth K=31 took 622341 ms
[2022-06-02 17:09:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-004-ReachabilityCardinality-02
[2022-06-02 17:09:40] [INFO ] KInduction solution for property DoubleExponent-PT-004-ReachabilityCardinality-02(SAT) depth K=12 took 638483 ms
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ 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 ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-004"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-004, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110000190"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-004.tgz
mv DoubleExponent-PT-004 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;