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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 7.5K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:46 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.7K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 29 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 29 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 29 13:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 29 13:47 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 340K 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-020-ReachabilityFireability-00
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-01
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-02
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-03
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-04
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-05
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-06
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-07
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-08
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-09
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-10
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-11
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-12
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-13
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-14
FORMULA_NAME DoubleExponent-PT-020-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654186291708

Running Version 202205111006
[2022-06-02 16:11:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 16:11:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:11:33] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2022-06-02 16:11:33] [INFO ] Transformed 1064 places.
[2022-06-02 16:11:33] [INFO ] Transformed 998 transitions.
[2022-06-02 16:11:33] [INFO ] Parsed PT model containing 1064 places and 998 transitions in 217 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 322 resets, run finished after 464 ms. (steps per millisecond=21 ) 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 28 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 20 ms. (steps per millisecond=50 ) 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 29 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 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 28 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 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 28 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 25 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 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 31 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 30 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 126953 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126953 steps, saw 63489 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 998 rows 1064 cols
[2022-06-02 16:11:37] [INFO ] Invariants computation overflowed in 121 ms
[2022-06-02 16:11:38] [INFO ] After 973ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-06-02 16:12:03] [INFO ] After 24130ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2022-06-02 16:12:03] [INFO ] After 24140ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :11
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-02 16:12:03] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :11
FORMULA DoubleExponent-PT-020-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 63316 ms.
Support contains 167 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Graph (complete) has 1816 edges and 1064 vertex of which 1059 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.9 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 1058 transition count 884
Reduce places removed 113 places and 0 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 1 with 148 rules applied. Total rules applied 264 place count 945 transition count 849
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 299 place count 910 transition count 849
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 299 place count 910 transition count 808
Deduced a syphon composed of 41 places in 10 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 381 place count 869 transition count 808
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 382 place count 868 transition count 807
Iterating global reduction 3 with 1 rules applied. Total rules applied 383 place count 868 transition count 807
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 7 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 591 place count 764 transition count 703
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 20 places in 17 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 631 place count 744 transition count 703
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 634 place count 744 transition count 700
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 637 place count 741 transition count 700
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 4 with 77 rules applied. Total rules applied 714 place count 741 transition count 623
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 4 with 77 rules applied. Total rules applied 791 place count 664 transition count 623
Partial Free-agglomeration rule applied 67 times.
Drop transitions removed 67 transitions
Iterating global reduction 5 with 67 rules applied. Total rules applied 858 place count 664 transition count 623
Applied a total of 858 rules in 421 ms. Remains 664 /1064 variables (removed 400) and now considering 623/998 (removed 375) transitions.
Finished structural reductions, in 1 iterations. Remains : 664/1064 places, 623/998 transitions.
Incomplete random walk after 1000000 steps, including 39904 resets, run finished after 24844 ms. (steps per millisecond=40 ) properties (out of 13) seen :0
Interrupted Best-First random walk after 245976 steps, including 8096 resets, run timeout after 5001 ms. (steps per millisecond=49 ) properties seen 0
Interrupted Best-First random walk after 266365 steps, including 8860 resets, run timeout after 5001 ms. (steps per millisecond=53 ) properties seen 0
Interrupted Best-First random walk after 263881 steps, including 8787 resets, run timeout after 5001 ms. (steps per millisecond=52 ) properties seen 0
Interrupted Best-First random walk after 253715 steps, including 8431 resets, run timeout after 5001 ms. (steps per millisecond=50 ) properties seen 0
Interrupted Best-First random walk after 251128 steps, including 8358 resets, run timeout after 5001 ms. (steps per millisecond=50 ) properties seen 0
Interrupted Best-First random walk after 268117 steps, including 8924 resets, run timeout after 5001 ms. (steps per millisecond=53 ) properties seen 0
Interrupted Best-First random walk after 270774 steps, including 8992 resets, run timeout after 5001 ms. (steps per millisecond=54 ) properties seen 0
Interrupted Best-First random walk after 271782 steps, including 9040 resets, run timeout after 5001 ms. (steps per millisecond=54 ) properties seen 0
Interrupted Best-First random walk after 269816 steps, including 8931 resets, run timeout after 5001 ms. (steps per millisecond=53 ) properties seen 0
Interrupted Best-First random walk after 259108 steps, including 8568 resets, run timeout after 5001 ms. (steps per millisecond=51 ) properties seen 0
Interrupted Best-First random walk after 256784 steps, including 8478 resets, run timeout after 5001 ms. (steps per millisecond=51 ) properties seen 0
Interrupted Best-First random walk after 266216 steps, including 8801 resets, run timeout after 5001 ms. (steps per millisecond=53 ) properties seen 0
Interrupted Best-First random walk after 221755 steps, including 7646 resets, run timeout after 5001 ms. (steps per millisecond=44 ) properties seen 0
Interrupted probabilistic random walk after 11239730 steps, run timeout after 267001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 11239730 steps, saw 5618091 distinct states, run finished after 267002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 623 rows 664 cols
[2022-06-02 16:19:03] [INFO ] Invariants computation overflowed in 54 ms
[2022-06-02 16:19:05] [INFO ] After 1540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-02 16:19:16] [INFO ] After 10601ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :10
[2022-06-02 16:19:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-02 16:19:47] [INFO ] After 30605ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :3 sat :8
[2022-06-02 16:19:51] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 10 ms to minimize.
[2022-06-02 16:19:52] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 1 ms to minimize.
[2022-06-02 16:19:52] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 1 ms to minimize.
[2022-06-02 16:19:52] [INFO ] Deduced a trap composed of 68 places in 134 ms of which 2 ms to minimize.
[2022-06-02 16:19:52] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 1 ms to minimize.
[2022-06-02 16:19:52] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 0 ms to minimize.
[2022-06-02 16:19:53] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 0 ms to minimize.
[2022-06-02 16:19:53] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 0 ms to minimize.
[2022-06-02 16:19:53] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 1 ms to minimize.
[2022-06-02 16:19:53] [INFO ] Deduced a trap composed of 127 places in 127 ms of which 0 ms to minimize.
[2022-06-02 16:19:53] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 0 ms to minimize.
[2022-06-02 16:19:53] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 1 ms to minimize.
[2022-06-02 16:19:54] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 0 ms to minimize.
[2022-06-02 16:19:54] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 1 ms to minimize.
[2022-06-02 16:19:54] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 0 ms to minimize.
[2022-06-02 16:19:54] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 1 ms to minimize.
[2022-06-02 16:19:54] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 0 ms to minimize.
[2022-06-02 16:19:54] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 0 ms to minimize.
[2022-06-02 16:19:55] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 0 ms to minimize.
[2022-06-02 16:19:55] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 0 ms to minimize.
[2022-06-02 16:19:55] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 1 ms to minimize.
[2022-06-02 16:19:55] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 1 ms to minimize.
[2022-06-02 16:19:55] [INFO ] Deduced a trap composed of 105 places in 79 ms of which 0 ms to minimize.
[2022-06-02 16:19:56] [INFO ] Deduced a trap composed of 111 places in 78 ms of which 0 ms to minimize.
[2022-06-02 16:19:56] [INFO ] Deduced a trap composed of 124 places in 71 ms of which 0 ms to minimize.
[2022-06-02 16:19:56] [INFO ] Deduced a trap composed of 119 places in 67 ms of which 0 ms to minimize.
[2022-06-02 16:19:57] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 0 ms to minimize.
[2022-06-02 16:19:57] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 0 ms to minimize.
[2022-06-02 16:19:57] [INFO ] Deduced a trap composed of 120 places in 69 ms of which 1 ms to minimize.
[2022-06-02 16:19:57] [INFO ] Deduced a trap composed of 119 places in 89 ms of which 0 ms to minimize.
[2022-06-02 16:19:57] [INFO ] Deduced a trap composed of 122 places in 71 ms of which 0 ms to minimize.
[2022-06-02 16:19:58] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 6863 ms
[2022-06-02 16:19:58] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 1 ms to minimize.
[2022-06-02 16:19:59] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 1 ms to minimize.
[2022-06-02 16:19:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 352 ms
[2022-06-02 16:20:00] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 1 ms to minimize.
[2022-06-02 16:20:00] [INFO ] Deduced a trap composed of 118 places in 79 ms of which 4 ms to minimize.
[2022-06-02 16:20:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2022-06-02 16:20:04] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2022-06-02 16:20:05] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 0 ms to minimize.
[2022-06-02 16:20:05] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
[2022-06-02 16:20:05] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 1 ms to minimize.
[2022-06-02 16:20:05] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 1 ms to minimize.
[2022-06-02 16:20:05] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 1 ms to minimize.
[2022-06-02 16:20:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1059 ms
[2022-06-02 16:20:06] [INFO ] After 49773ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 11926 ms.
[2022-06-02 16:20:18] [INFO ] After 72627ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
FORMULA DoubleExponent-PT-020-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 120003 ms.
Support contains 120 out of 664 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 664/664 places, 623/623 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 664 transition count 616
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 657 transition count 616
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 14 place count 657 transition count 611
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 652 transition count 611
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 60 place count 634 transition count 593
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 631 transition count 593
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 82 place count 631 transition count 577
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 98 place count 615 transition count 577
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 110 place count 615 transition count 577
Applied a total of 110 rules in 156 ms. Remains 615 /664 variables (removed 49) and now considering 577/623 (removed 46) transitions.
Finished structural reductions, in 1 iterations. Remains : 615/664 places, 577/623 transitions.
Incomplete random walk after 1000000 steps, including 52220 resets, run finished after 20367 ms. (steps per millisecond=49 ) properties (out of 10) seen :0
Interrupted Best-First random walk after 299160 steps, including 12277 resets, run timeout after 5001 ms. (steps per millisecond=59 ) properties seen 0
Interrupted Best-First random walk after 303863 steps, including 12474 resets, run timeout after 5001 ms. (steps per millisecond=60 ) properties seen 0
Interrupted Best-First random walk after 305837 steps, including 12538 resets, run timeout after 5001 ms. (steps per millisecond=61 ) properties seen 0
Interrupted Best-First random walk after 306787 steps, including 12507 resets, run timeout after 5001 ms. (steps per millisecond=61 ) properties seen 0
Interrupted Best-First random walk after 303216 steps, including 12504 resets, run timeout after 5001 ms. (steps per millisecond=60 ) properties seen 0
Interrupted Best-First random walk after 310332 steps, including 12733 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted Best-First random walk after 312344 steps, including 12773 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted Best-First random walk after 311249 steps, including 12780 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted Best-First random walk after 292023 steps, including 11957 resets, run timeout after 5001 ms. (steps per millisecond=58 ) properties seen 0
Interrupted Best-First random walk after 296726 steps, including 12211 resets, run timeout after 5001 ms. (steps per millisecond=59 ) properties seen 0
Interrupted probabilistic random walk after 10846349 steps, run timeout after 210001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 10846349 steps, saw 5421582 distinct states, run finished after 210001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 577 rows 615 cols
[2022-06-02 16:26:58] [INFO ] Computed 100 place invariants in 106 ms
[2022-06-02 16:26:58] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-02 16:26:59] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 49 ms returned sat
[2022-06-02 16:26:59] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-02 16:26:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-02 16:26:59] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 50 ms returned sat
[2022-06-02 16:27:06] [INFO ] After 6575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-06-02 16:27:06] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-02 16:27:19] [INFO ] After 13669ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-06-02 16:27:21] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2022-06-02 16:27:22] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2022-06-02 16:27:22] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2022-06-02 16:27:22] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2022-06-02 16:27:22] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:27:22] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:27:22] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 1 ms to minimize.
[2022-06-02 16:27:22] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 0 ms to minimize.
[2022-06-02 16:27:23] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 0 ms to minimize.
[2022-06-02 16:27:23] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 1 ms to minimize.
[2022-06-02 16:27:23] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 0 ms to minimize.
[2022-06-02 16:27:23] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2022-06-02 16:27:23] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 0 ms to minimize.
[2022-06-02 16:27:24] [INFO ] Deduced a trap composed of 110 places in 94 ms of which 0 ms to minimize.
[2022-06-02 16:27:24] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 6 ms to minimize.
[2022-06-02 16:27:24] [INFO ] Deduced a trap composed of 125 places in 93 ms of which 1 ms to minimize.
[2022-06-02 16:27:24] [INFO ] Deduced a trap composed of 118 places in 90 ms of which 1 ms to minimize.
[2022-06-02 16:27:24] [INFO ] Deduced a trap composed of 103 places in 88 ms of which 1 ms to minimize.
[2022-06-02 16:27:25] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 0 ms to minimize.
[2022-06-02 16:27:25] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 1 ms to minimize.
[2022-06-02 16:27:26] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 1 ms to minimize.
[2022-06-02 16:27:26] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 1 ms to minimize.
[2022-06-02 16:27:26] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 0 ms to minimize.
[2022-06-02 16:27:26] [INFO ] Deduced a trap composed of 108 places in 103 ms of which 1 ms to minimize.
[2022-06-02 16:27:26] [INFO ] Deduced a trap composed of 117 places in 105 ms of which 0 ms to minimize.
[2022-06-02 16:27:26] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 1 ms to minimize.
[2022-06-02 16:27:27] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 3 ms to minimize.
[2022-06-02 16:27:27] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 1 ms to minimize.
[2022-06-02 16:27:27] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 0 ms to minimize.
[2022-06-02 16:27:27] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 0 ms to minimize.
[2022-06-02 16:27:27] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 0 ms to minimize.
[2022-06-02 16:27:27] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 0 ms to minimize.
[2022-06-02 16:27:27] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 0 ms to minimize.
[2022-06-02 16:27:28] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 0 ms to minimize.
[2022-06-02 16:27:28] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 0 ms to minimize.
[2022-06-02 16:27:28] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 1 ms to minimize.
[2022-06-02 16:27:29] [INFO ] Deduced a trap composed of 145 places in 105 ms of which 1 ms to minimize.
[2022-06-02 16:27:29] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 0 ms to minimize.
[2022-06-02 16:27:30] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 0 ms to minimize.
[2022-06-02 16:27:30] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 0 ms to minimize.
[2022-06-02 16:27:30] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 0 ms to minimize.
[2022-06-02 16:27:30] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 0 ms to minimize.
[2022-06-02 16:27:30] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 9287 ms
[2022-06-02 16:27:31] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2022-06-02 16:27:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2022-06-02 16:27:31] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 1 ms to minimize.
[2022-06-02 16:27:31] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 0 ms to minimize.
[2022-06-02 16:27:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2022-06-02 16:27:46] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 0 ms to minimize.
[2022-06-02 16:27:46] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2022-06-02 16:27:46] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2022-06-02 16:27:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 500 ms
[2022-06-02 16:27:50] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 0 ms to minimize.
[2022-06-02 16:27:51] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 0 ms to minimize.
[2022-06-02 16:27:51] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 0 ms to minimize.
[2022-06-02 16:27:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 651 ms
[2022-06-02 16:27:51] [INFO ] Deduced a trap composed of 96 places in 72 ms of which 0 ms to minimize.
[2022-06-02 16:27:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2022-06-02 16:27:51] [INFO ] After 45695ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 14014 ms.
[2022-06-02 16:28:05] [INFO ] After 66623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 121211 ms.
Support contains 120 out of 615 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 615/615 places, 577/577 transitions.
Applied a total of 0 rules in 18 ms. Remains 615 /615 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 615/615 places, 577/577 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 615/615 places, 577/577 transitions.
Applied a total of 0 rules in 17 ms. Remains 615 /615 variables (removed 0) and now considering 577/577 (removed 0) transitions.
// Phase 1: matrix 577 rows 615 cols
[2022-06-02 16:30:07] [INFO ] Computed 100 place invariants in 126 ms
[2022-06-02 16:30:07] [INFO ] Implicit Places using invariants in 424 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 426 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 614/615 places, 577/577 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 613 transition count 576
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 613 transition count 576
Applied a total of 2 rules in 26 ms. Remains 613 /614 variables (removed 1) and now considering 576/577 (removed 1) transitions.
// Phase 1: matrix 576 rows 613 cols
[2022-06-02 16:30:07] [INFO ] Computed 99 place invariants in 84 ms
[2022-06-02 16:30:07] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 576 rows 613 cols
[2022-06-02 16:30:07] [INFO ] Computed 99 place invariants in 78 ms
[2022-06-02 16:30:08] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-02 16:30:26] [INFO ] Implicit Places using invariants and state equation in 18773 ms returned [56, 194, 203, 267, 275, 285, 302, 307, 343, 369, 376, 431, 439, 471, 497, 539, 565, 573, 603, 611]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 19115 ms to find 20 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 593/615 places, 576/577 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 593 transition count 573
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 590 transition count 573
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 13 place count 590 transition count 573
Applied a total of 13 rules in 50 ms. Remains 590 /593 variables (removed 3) and now considering 573/576 (removed 3) transitions.
// Phase 1: matrix 573 rows 590 cols
[2022-06-02 16:30:26] [INFO ] Invariants computation overflowed in 47 ms
[2022-06-02 16:30:26] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 573 rows 590 cols
[2022-06-02 16:30:26] [INFO ] Invariants computation overflowed in 42 ms
[2022-06-02 16:30:27] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-02 16:30:57] [INFO ] Performed 589/590 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-06-02 16:30:57] [INFO ] Implicit Places using invariants and state equation in 30363 ms returned []
Implicit Place search using SMT with State Equation took 30616 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 590/615 places, 573/577 transitions.
Finished structural reductions, in 3 iterations. Remains : 590/615 places, 573/577 transitions.
Incomplete random walk after 1000000 steps, including 52076 resets, run finished after 19533 ms. (steps per millisecond=51 ) properties (out of 10) seen :0
Interrupted Best-First random walk after 346608 steps, including 14239 resets, run timeout after 5001 ms. (steps per millisecond=69 ) properties seen 0
Interrupted Best-First random walk after 291924 steps, including 12023 resets, run timeout after 5001 ms. (steps per millisecond=58 ) properties seen 0
Interrupted Best-First random walk after 286136 steps, including 11813 resets, run timeout after 5001 ms. (steps per millisecond=57 ) properties seen 0
Interrupted Best-First random walk after 275410 steps, including 11304 resets, run timeout after 5001 ms. (steps per millisecond=55 ) properties seen 0
Interrupted Best-First random walk after 312061 steps, including 12820 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted Best-First random walk after 299183 steps, including 12327 resets, run timeout after 5001 ms. (steps per millisecond=59 ) properties seen 0
Interrupted Best-First random walk after 301954 steps, including 12342 resets, run timeout after 5001 ms. (steps per millisecond=60 ) properties seen 0
Interrupted Best-First random walk after 299732 steps, including 12217 resets, run timeout after 5001 ms. (steps per millisecond=59 ) properties seen 0
Interrupted Best-First random walk after 299388 steps, including 12329 resets, run timeout after 5001 ms. (steps per millisecond=59 ) properties seen 0
Interrupted Best-First random walk after 301122 steps, including 12399 resets, run timeout after 5001 ms. (steps per millisecond=60 ) properties seen 0
Interrupted probabilistic random walk after 11242566 steps, run timeout after 207001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 11242566 steps, saw 5619456 distinct states, run finished after 207001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 573 rows 590 cols
[2022-06-02 16:35:33] [INFO ] Invariants computation overflowed in 42 ms
[2022-06-02 16:35:34] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-02 16:35:43] [INFO ] After 9352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-06-02 16:35:43] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-02 16:35:59] [INFO ] After 15807ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-06-02 16:36:03] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2022-06-02 16:36:03] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2022-06-02 16:36:03] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 1 ms to minimize.
[2022-06-02 16:36:03] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 1 ms to minimize.
[2022-06-02 16:36:04] [INFO ] Deduced a trap composed of 109 places in 89 ms of which 1 ms to minimize.
[2022-06-02 16:36:04] [INFO ] Deduced a trap composed of 100 places in 86 ms of which 1 ms to minimize.
[2022-06-02 16:36:04] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 0 ms to minimize.
[2022-06-02 16:36:04] [INFO ] Deduced a trap composed of 107 places in 90 ms of which 0 ms to minimize.
[2022-06-02 16:36:04] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 0 ms to minimize.
[2022-06-02 16:36:04] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2022-06-02 16:36:04] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:36:05] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 0 ms to minimize.
[2022-06-02 16:36:05] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 1 ms to minimize.
[2022-06-02 16:36:05] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 1 ms to minimize.
[2022-06-02 16:36:05] [INFO ] Deduced a trap composed of 117 places in 100 ms of which 0 ms to minimize.
[2022-06-02 16:36:05] [INFO ] Deduced a trap composed of 119 places in 92 ms of which 1 ms to minimize.
[2022-06-02 16:36:05] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 1 ms to minimize.
[2022-06-02 16:36:06] [INFO ] Deduced a trap composed of 115 places in 88 ms of which 1 ms to minimize.
[2022-06-02 16:36:06] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:36:06] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:36:06] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 1 ms to minimize.
[2022-06-02 16:36:06] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 0 ms to minimize.
[2022-06-02 16:36:06] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 1 ms to minimize.
[2022-06-02 16:36:07] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 1 ms to minimize.
[2022-06-02 16:36:07] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 1 ms to minimize.
[2022-06-02 16:36:07] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 0 ms to minimize.
[2022-06-02 16:36:07] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
[2022-06-02 16:36:08] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 0 ms to minimize.
[2022-06-02 16:36:08] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 0 ms to minimize.
[2022-06-02 16:36:08] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 1 ms to minimize.
[2022-06-02 16:36:08] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 1 ms to minimize.
[2022-06-02 16:36:08] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 0 ms to minimize.
[2022-06-02 16:36:08] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 0 ms to minimize.
[2022-06-02 16:36:09] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 0 ms to minimize.
[2022-06-02 16:36:09] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 0 ms to minimize.
[2022-06-02 16:36:09] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 1 ms to minimize.
[2022-06-02 16:36:09] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 0 ms to minimize.
[2022-06-02 16:36:09] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 1 ms to minimize.
[2022-06-02 16:36:09] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 0 ms to minimize.
[2022-06-02 16:36:09] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2022-06-02 16:36:10] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2022-06-02 16:36:10] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 6985 ms
[2022-06-02 16:36:11] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 1 ms to minimize.
[2022-06-02 16:36:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-06-02 16:36:22] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 0 ms to minimize.
[2022-06-02 16:36:22] [INFO ] Deduced a trap composed of 96 places in 70 ms of which 0 ms to minimize.
[2022-06-02 16:36:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 369 ms
[2022-06-02 16:36:22] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 1 ms to minimize.
[2022-06-02 16:36:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-06-02 16:36:34] [INFO ] After 50794ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 14455 ms.
[2022-06-02 16:36:48] [INFO ] After 74831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 120000 ms.
Support contains 120 out of 590 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 590/590 places, 573/573 transitions.
Applied a total of 0 rules in 15 ms. Remains 590 /590 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 590/590 places, 573/573 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 590/590 places, 573/573 transitions.
Applied a total of 0 rules in 14 ms. Remains 590 /590 variables (removed 0) and now considering 573/573 (removed 0) transitions.
// Phase 1: matrix 573 rows 590 cols
[2022-06-02 16:38:48] [INFO ] Invariants computation overflowed in 44 ms
[2022-06-02 16:38:49] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 573 rows 590 cols
[2022-06-02 16:38:49] [INFO ] Invariants computation overflowed in 38 ms
[2022-06-02 16:38:49] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-02 16:39:07] [INFO ] Implicit Places using invariants and state equation in 17941 ms returned [127, 135]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 18205 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 588/590 places, 573/573 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 572
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 587 transition count 572
Applied a total of 2 rules in 29 ms. Remains 587 /588 variables (removed 1) and now considering 572/573 (removed 1) transitions.
// Phase 1: matrix 572 rows 587 cols
[2022-06-02 16:39:07] [INFO ] Invariants computation overflowed in 42 ms
[2022-06-02 16:39:07] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 572 rows 587 cols
[2022-06-02 16:39:07] [INFO ] Invariants computation overflowed in 27 ms
[2022-06-02 16:39:07] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-02 16:39:29] [INFO ] Implicit Places using invariants and state equation in 22513 ms returned []
Implicit Place search using SMT with State Equation took 22762 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 587/590 places, 572/573 transitions.
Finished structural reductions, in 2 iterations. Remains : 587/590 places, 572/573 transitions.
Incomplete random walk after 1000000 steps, including 52219 resets, run finished after 20135 ms. (steps per millisecond=49 ) properties (out of 10) seen :0
Interrupted Best-First random walk after 313420 steps, including 12846 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted Best-First random walk after 314868 steps, including 12840 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted Best-First random walk after 314778 steps, including 13015 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted Best-First random walk after 325884 steps, including 13459 resets, run timeout after 5001 ms. (steps per millisecond=65 ) properties seen 0
Interrupted Best-First random walk after 326800 steps, including 13299 resets, run timeout after 5001 ms. (steps per millisecond=65 ) properties seen 0
Interrupted Best-First random walk after 328767 steps, including 13453 resets, run timeout after 5001 ms. (steps per millisecond=65 ) properties seen 0
Interrupted Best-First random walk after 318083 steps, including 12978 resets, run timeout after 5001 ms. (steps per millisecond=63 ) properties seen 0
Interrupted Best-First random walk after 313806 steps, including 12831 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted Best-First random walk after 314045 steps, including 12893 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted Best-First random walk after 320298 steps, including 13109 resets, run timeout after 5001 ms. (steps per millisecond=64 ) properties seen 0
Probably explored full state space saw : 800065 states, properties seen :0
Probabilistic random walk after 1600205 steps, saw 800065 distinct states, run finished after 29811 ms. (steps per millisecond=53 ) properties seen :0
Interrupted probabilistic random walk after 10854909 steps, run timeout after 210001 ms. (steps per millisecond=51 ) properties seen :{}
Exhaustive walk after 10854909 steps, saw 5427475 distinct states, run finished after 210001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 572 rows 587 cols
[2022-06-02 16:44:39] [INFO ] Invariants computation overflowed in 28 ms
[2022-06-02 16:44:40] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-02 16:44:49] [INFO ] After 9050ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-06-02 16:44:49] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-02 16:45:10] [INFO ] After 21272ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-06-02 16:45:15] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2022-06-02 16:45:15] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2022-06-02 16:45:15] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 1 ms to minimize.
[2022-06-02 16:45:15] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 0 ms to minimize.
[2022-06-02 16:45:15] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 1 ms to minimize.
[2022-06-02 16:45:16] [INFO ] Deduced a trap composed of 105 places in 100 ms of which 1 ms to minimize.
[2022-06-02 16:45:16] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 1 ms to minimize.
[2022-06-02 16:45:16] [INFO ] Deduced a trap composed of 124 places in 96 ms of which 0 ms to minimize.
[2022-06-02 16:45:16] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 0 ms to minimize.
[2022-06-02 16:45:16] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 1 ms to minimize.
[2022-06-02 16:45:16] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 0 ms to minimize.
[2022-06-02 16:45:16] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 0 ms to minimize.
[2022-06-02 16:45:17] [INFO ] Deduced a trap composed of 112 places in 91 ms of which 0 ms to minimize.
[2022-06-02 16:45:17] [INFO ] Deduced a trap composed of 123 places in 87 ms of which 1 ms to minimize.
[2022-06-02 16:45:17] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:45:17] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 1 ms to minimize.
[2022-06-02 16:45:17] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:45:18] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:45:18] [INFO ] Deduced a trap composed of 121 places in 81 ms of which 0 ms to minimize.
[2022-06-02 16:45:18] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:45:18] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 0 ms to minimize.
[2022-06-02 16:45:18] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 1 ms to minimize.
[2022-06-02 16:45:19] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 1 ms to minimize.
[2022-06-02 16:45:19] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 0 ms to minimize.
[2022-06-02 16:45:19] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 1 ms to minimize.
[2022-06-02 16:45:19] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 0 ms to minimize.
[2022-06-02 16:45:19] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 0 ms to minimize.
[2022-06-02 16:45:19] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 0 ms to minimize.
[2022-06-02 16:45:20] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 1 ms to minimize.
[2022-06-02 16:45:20] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 0 ms to minimize.
[2022-06-02 16:45:20] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2022-06-02 16:45:20] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 0 ms to minimize.
[2022-06-02 16:45:20] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 0 ms to minimize.
[2022-06-02 16:45:21] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2022-06-02 16:45:21] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 1 ms to minimize.
[2022-06-02 16:45:22] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 0 ms to minimize.
[2022-06-02 16:45:23] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 0 ms to minimize.
[2022-06-02 16:45:24] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 0 ms to minimize.
[2022-06-02 16:45:25] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 0 ms to minimize.
[2022-06-02 16:45:25] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 1 ms to minimize.
[2022-06-02 16:45:26] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:45:27] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 1 ms to minimize.
[2022-06-02 16:45:27] [INFO ] Deduced a trap composed of 116 places in 121 ms of which 0 ms to minimize.
[2022-06-02 16:45:27] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 0 ms to minimize.
[2022-06-02 16:45:27] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2022-06-02 16:45:28] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 12952 ms
[2022-06-02 16:45:28] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 1 ms to minimize.
[2022-06-02 16:45:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2022-06-02 16:45:28] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 0 ms to minimize.
[2022-06-02 16:45:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-06-02 16:45:41] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2022-06-02 16:45:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2022-06-02 16:45:42] [INFO ] After 52505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 19262 ms.
[2022-06-02 16:46:01] [INFO ] After 81061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 120000 ms.
Support contains 120 out of 587 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 587/587 places, 572/572 transitions.
Applied a total of 0 rules in 33 ms. Remains 587 /587 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 587/587 places, 572/572 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 587/587 places, 572/572 transitions.
Applied a total of 0 rules in 13 ms. Remains 587 /587 variables (removed 0) and now considering 572/572 (removed 0) transitions.
// Phase 1: matrix 572 rows 587 cols
[2022-06-02 16:48:01] [INFO ] Invariants computation overflowed in 35 ms
[2022-06-02 16:48:01] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 572 rows 587 cols
[2022-06-02 16:48:01] [INFO ] Invariants computation overflowed in 30 ms
[2022-06-02 16:48:01] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-02 16:48:25] [INFO ] Implicit Places using invariants and state equation in 23759 ms returned []
Implicit Place search using SMT with State Equation took 24027 ms to find 0 implicit places.
[2022-06-02 16:48:25] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 572 rows 587 cols
[2022-06-02 16:48:25] [INFO ] Invariants computation overflowed in 33 ms
[2022-06-02 16:48:25] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 587/587 places, 572/572 transitions.
Incomplete random walk after 1000000 steps, including 52223 resets, run finished after 20397 ms. (steps per millisecond=49 ) properties (out of 10) seen :0
Interrupted Best-First random walk after 299284 steps, including 12304 resets, run timeout after 5001 ms. (steps per millisecond=59 ) properties seen 0
Interrupted Best-First random walk after 293289 steps, including 11997 resets, run timeout after 5001 ms. (steps per millisecond=58 ) properties seen 0
Interrupted Best-First random walk after 291850 steps, including 12054 resets, run timeout after 5001 ms. (steps per millisecond=58 ) properties seen 0
Interrupted Best-First random walk after 291080 steps, including 12005 resets, run timeout after 5001 ms. (steps per millisecond=58 ) properties seen 0
Interrupted Best-First random walk after 286368 steps, including 11792 resets, run timeout after 5001 ms. (steps per millisecond=57 ) properties seen 0
Interrupted Best-First random walk after 294806 steps, including 12105 resets, run timeout after 5001 ms. (steps per millisecond=58 ) properties seen 0
Interrupted Best-First random walk after 295524 steps, including 12145 resets, run timeout after 5001 ms. (steps per millisecond=59 ) properties seen 0
Interrupted Best-First random walk after 297952 steps, including 12271 resets, run timeout after 5001 ms. (steps per millisecond=59 ) properties seen 0
Interrupted Best-First random walk after 313090 steps, including 12924 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen 0
Interrupted Best-First random walk after 321187 steps, including 13202 resets, run timeout after 5001 ms. (steps per millisecond=64 ) properties seen 0
Probably explored full state space saw : 800065 states, properties seen :0
Probabilistic random walk after 1600205 steps, saw 800065 distinct states, run finished after 27423 ms. (steps per millisecond=58 ) properties seen :0
Interrupted probabilistic random walk after 11376941 steps, run timeout after 210001 ms. (steps per millisecond=54 ) properties seen :{}
Exhaustive walk after 11376941 steps, saw 5688503 distinct states, run finished after 210001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 572 rows 587 cols
[2022-06-02 16:53:33] [INFO ] Invariants computation overflowed in 26 ms
[2022-06-02 16:53:33] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-02 16:53:42] [INFO ] After 8812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-06-02 16:53:42] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-02 16:54:04] [INFO ] After 21980ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-06-02 16:54:07] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 0 ms to minimize.
[2022-06-02 16:54:09] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2022-06-02 16:54:09] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2022-06-02 16:54:09] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2022-06-02 16:54:09] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 0 ms to minimize.
[2022-06-02 16:54:10] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:54:10] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 0 ms to minimize.
[2022-06-02 16:54:10] [INFO ] Deduced a trap composed of 103 places in 86 ms of which 0 ms to minimize.
[2022-06-02 16:54:10] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 1 ms to minimize.
[2022-06-02 16:54:10] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:54:10] [INFO ] Deduced a trap composed of 126 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:54:10] [INFO ] Deduced a trap composed of 123 places in 86 ms of which 0 ms to minimize.
[2022-06-02 16:54:11] [INFO ] Deduced a trap composed of 132 places in 81 ms of which 0 ms to minimize.
[2022-06-02 16:54:11] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 1 ms to minimize.
[2022-06-02 16:54:11] [INFO ] Deduced a trap composed of 113 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:54:11] [INFO ] Deduced a trap composed of 118 places in 86 ms of which 0 ms to minimize.
[2022-06-02 16:54:11] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 0 ms to minimize.
[2022-06-02 16:54:11] [INFO ] Deduced a trap composed of 122 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:54:11] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:54:12] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:54:12] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 1 ms to minimize.
[2022-06-02 16:54:12] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 0 ms to minimize.
[2022-06-02 16:54:12] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 1 ms to minimize.
[2022-06-02 16:54:13] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 1 ms to minimize.
[2022-06-02 16:54:13] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 0 ms to minimize.
[2022-06-02 16:54:13] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 1 ms to minimize.
[2022-06-02 16:54:13] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 0 ms to minimize.
[2022-06-02 16:54:13] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 0 ms to minimize.
[2022-06-02 16:54:13] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 1 ms to minimize.
[2022-06-02 16:54:13] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 0 ms to minimize.
[2022-06-02 16:54:14] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2022-06-02 16:54:14] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 0 ms to minimize.
[2022-06-02 16:54:15] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 0 ms to minimize.
[2022-06-02 16:54:15] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 0 ms to minimize.
[2022-06-02 16:54:16] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 0 ms to minimize.
[2022-06-02 16:54:18] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 1 ms to minimize.
[2022-06-02 16:54:18] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 0 ms to minimize.
[2022-06-02 16:54:19] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 0 ms to minimize.
[2022-06-02 16:54:20] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:54:22] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:54:23] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 1 ms to minimize.
[2022-06-02 16:54:25] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 1 ms to minimize.
[2022-06-02 16:54:27] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 1 ms to minimize.
[2022-06-02 16:54:27] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 1 ms to minimize.
[2022-06-02 16:54:27] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 19757 ms
[2022-06-02 16:54:28] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 0 ms to minimize.
[2022-06-02 16:54:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-06-02 16:54:32] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2022-06-02 16:54:32] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 0 ms to minimize.
[2022-06-02 16:54:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 339 ms
[2022-06-02 16:54:33] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 0 ms to minimize.
[2022-06-02 16:54:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-06-02 16:54:43] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2022-06-02 16:54:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2022-06-02 16:54:43] [INFO ] After 60500ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 11987 ms.
[2022-06-02 16:54:55] [INFO ] After 81532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 121562 ms.
Support contains 120 out of 587 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 587/587 places, 572/572 transitions.
Applied a total of 0 rules in 13 ms. Remains 587 /587 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 587/587 places, 572/572 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 587/587 places, 572/572 transitions.
Applied a total of 0 rules in 13 ms. Remains 587 /587 variables (removed 0) and now considering 572/572 (removed 0) transitions.
// Phase 1: matrix 572 rows 587 cols
[2022-06-02 16:56:56] [INFO ] Invariants computation overflowed in 33 ms
[2022-06-02 16:56:57] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 572 rows 587 cols
[2022-06-02 16:56:57] [INFO ] Invariants computation overflowed in 31 ms
[2022-06-02 16:56:57] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-02 16:57:22] [INFO ] Implicit Places using invariants and state equation in 25154 ms returned []
Implicit Place search using SMT with State Equation took 25388 ms to find 0 implicit places.
[2022-06-02 16:57:22] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 572 rows 587 cols
[2022-06-02 16:57:22] [INFO ] Invariants computation overflowed in 31 ms
[2022-06-02 16:57:22] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 587/587 places, 572/572 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 587 transition count 566
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 581 transition count 566
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 12 place count 581 transition count 550
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 44 place count 565 transition count 550
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 563 transition count 548
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 563 transition count 548
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 563 transition count 547
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 562 transition count 547
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 562 transition count 547
Applied a total of 51 rules in 55 ms. Remains 562 /587 variables (removed 25) and now considering 547/572 (removed 25) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 547 rows 562 cols
[2022-06-02 16:57:22] [INFO ] Invariants computation overflowed in 26 ms
[2022-06-02 16:57:22] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-02 16:57:30] [INFO ] After 7429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-06-02 16:57:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-02 16:57:40] [INFO ] After 9826ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-06-02 16:57:41] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 0 ms to minimize.
[2022-06-02 16:57:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2022-06-02 16:57:42] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 1 ms to minimize.
[2022-06-02 16:57:42] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 0 ms to minimize.
[2022-06-02 16:57:42] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 1 ms to minimize.
[2022-06-02 16:57:42] [INFO ] Deduced a trap composed of 98 places in 68 ms of which 0 ms to minimize.
[2022-06-02 16:57:42] [INFO ] Deduced a trap composed of 103 places in 65 ms of which 0 ms to minimize.
[2022-06-02 16:57:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 516 ms
[2022-06-02 16:57:43] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 0 ms to minimize.
[2022-06-02 16:57:43] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 0 ms to minimize.
[2022-06-02 16:57:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 377 ms
[2022-06-02 16:57:47] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 1 ms to minimize.
[2022-06-02 16:57:47] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 0 ms to minimize.
[2022-06-02 16:57:47] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 1 ms to minimize.
[2022-06-02 16:57:47] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 0 ms to minimize.
[2022-06-02 16:57:47] [INFO ] Deduced a trap composed of 106 places in 92 ms of which 0 ms to minimize.
[2022-06-02 16:57:48] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 0 ms to minimize.
[2022-06-02 16:57:48] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 1 ms to minimize.
[2022-06-02 16:57:48] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 0 ms to minimize.
[2022-06-02 16:57:48] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 0 ms to minimize.
[2022-06-02 16:57:48] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 1 ms to minimize.
[2022-06-02 16:57:48] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 1 ms to minimize.
[2022-06-02 16:57:48] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1955 ms
[2022-06-02 16:57:49] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 1 ms to minimize.
[2022-06-02 16:57:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2022-06-02 16:57:52] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2022-06-02 16:57:52] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 0 ms to minimize.
[2022-06-02 16:57:52] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 1 ms to minimize.
[2022-06-02 16:57:52] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 1 ms to minimize.
[2022-06-02 16:57:52] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 0 ms to minimize.
[2022-06-02 16:57:53] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 0 ms to minimize.
[2022-06-02 16:57:53] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 0 ms to minimize.
[2022-06-02 16:57:53] [INFO ] Deduced a trap composed of 95 places in 68 ms of which 0 ms to minimize.
[2022-06-02 16:57:53] [INFO ] Deduced a trap composed of 103 places in 65 ms of which 0 ms to minimize.
[2022-06-02 16:57:53] [INFO ] Deduced a trap composed of 105 places in 66 ms of which 0 ms to minimize.
[2022-06-02 16:57:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1597 ms
[2022-06-02 16:57:53] [INFO ] After 23089ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 16965 ms.
[2022-06-02 16:58:10] [INFO ] After 47729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2022-06-02 16:58:10] [INFO ] Flatten gal took : 100 ms
[2022-06-02 16:58:10] [INFO ] Flatten gal took : 46 ms
[2022-06-02 16:58:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7110599369333671010.gal : 22 ms
[2022-06-02 16:58:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17888510521271714538.prop : 2 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/ReachabilityCardinality7110599369333671010.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17888510521271714538.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/ReachabilityCardinality17888510521271714538.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :7 after 9
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :9 after 19
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :19 after 41
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :41 after 77
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :77 after 431
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :431 after 2617
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :2617 after 109847
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :109847 after 944941
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :944941 after 5.32329e+06
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :5.32329e+06 after 1.1431e+07
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :1.1431e+07 after 3.06583e+07
SDD proceeding with computation,10 properties remain. new max is 65536
SDD size :3.06583e+07 after 8.99636e+07
Detected timeout of ITS tools.
[2022-06-02 16:58:26] [INFO ] Flatten gal took : 42 ms
[2022-06-02 16:58:26] [INFO ] Applying decomposition
[2022-06-02 16:58:26] [INFO ] Flatten gal took : 36 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/graph717726940857329902.txt' '-o' '/tmp/graph717726940857329902.bin' '-w' '/tmp/graph717726940857329902.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph717726940857329902.bin' '-l' '-1' '-v' '-w' '/tmp/graph717726940857329902.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:58:26] [INFO ] Decomposing Gal with order
[2022-06-02 16:58:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:58:26] [INFO ] Removed a total of 294 redundant transitions.
[2022-06-02 16:58:26] [INFO ] Flatten gal took : 107 ms
[2022-06-02 16:58:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 26 ms.
[2022-06-02 16:58:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18332392208138764557.gal : 15 ms
[2022-06-02 16:58:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5496699837496890506.prop : 18 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/ReachabilityCardinality18332392208138764557.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5496699837496890506.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality5496699837496890506.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :1 after 6
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :9 after 15
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :15 after 266
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :266 after 2270
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :2270 after 4931
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :4931 after 11567
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :11567 after 25352
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :25352 after 53874
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :53874 after 70506
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8250204962647220845
[2022-06-02 16:58:41] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8250204962647220845
Running compilation step : cd /tmp/ltsmin8250204962647220845;'/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 1052 ms.
Running link step : cd /tmp/ltsmin8250204962647220845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin8250204962647220845;'/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' 'DoubleExponentPT020ReachabilityFireability00==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-02 16:58:56] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18032645770688848263
[2022-06-02 16:58:56] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2022-06-02 16:58:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:58:56] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2022-06-02 16:58:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:58:56] [INFO ] Flatten gal took : 40 ms
[2022-06-02 16:58:57] [INFO ] Applying decomposition
[2022-06-02 16:58:57] [INFO ] Input system was already deterministic with 572 transitions.
[2022-06-02 16:58:57] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2022-06-02 16:58:57] [INFO ] Flatten gal took : 101 ms
[2022-06-02 16:58:57] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:58:57] [INFO ] Built C files in 182ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18032645770688848263
Running compilation step : cd /tmp/ltsmin18032645770688848263;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '72' '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'
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/graph2974216559017074777.txt' '-o' '/tmp/graph2974216559017074777.bin' '-w' '/tmp/graph2974216559017074777.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2974216559017074777.bin' '-l' '-1' '-v' '-w' '/tmp/graph2974216559017074777.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:58:57] [INFO ] Decomposing Gal with order
[2022-06-02 16:58:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:58:57] [INFO ] Ran tautology test, simplified 0 / 10 in 337 ms.
[2022-06-02 16:58:57] [INFO ] Removed a total of 222 redundant transitions.
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-00(UNSAT) depth K=0 took 53 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-03(UNSAT) depth K=0 took 1 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-04(UNSAT) depth K=0 took 0 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-05(UNSAT) depth K=0 took 1 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-07(UNSAT) depth K=0 took 1 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-08(UNSAT) depth K=0 took 0 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-09(UNSAT) depth K=0 took 1 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-10(UNSAT) depth K=0 took 0 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-11(UNSAT) depth K=0 took 1 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-13(UNSAT) depth K=0 took 0 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-00(UNSAT) depth K=1 took 4 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-03(UNSAT) depth K=1 took 0 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-04(UNSAT) depth K=1 took 1 ms
[2022-06-02 16:58:57] [INFO ] Flatten gal took : 116 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-05(UNSAT) depth K=1 took 10 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-07(UNSAT) depth K=1 took 2 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-08(UNSAT) depth K=1 took 1 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-09(UNSAT) depth K=1 took 1 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-10(UNSAT) depth K=1 took 1 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-11(UNSAT) depth K=1 took 2 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-13(UNSAT) depth K=1 took 0 ms
[2022-06-02 16:58:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 30 ms.
[2022-06-02 16:58:57] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9386044389285877162.gal : 12 ms
[2022-06-02 16:58:57] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11972724658787075225.prop : 2 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/ReachabilityFireability9386044389285877162.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11972724658787075225.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-00(UNSAT) depth K=2 took 188 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-03(UNSAT) depth K=2 took 2 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-04(UNSAT) depth K=2 took 0 ms
Loading property file /tmp/ReachabilityFireability11972724658787075225.prop.
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-05(UNSAT) depth K=2 took 10 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-07(UNSAT) depth K=2 took 4 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-08(UNSAT) depth K=2 took 0 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-09(UNSAT) depth K=2 took 1 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-10(UNSAT) depth K=2 took 1 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-11(UNSAT) depth K=2 took 2 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-13(UNSAT) depth K=2 took 0 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 572 rows 587 cols
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :1 after 4
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :8 after 10
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-00(UNSAT) depth K=3 took 92 ms
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :10 after 32
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-03(UNSAT) depth K=3 took 3 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-04(UNSAT) depth K=3 took 1 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-05(UNSAT) depth K=3 took 3 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-07(UNSAT) depth K=3 took 6 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-08(UNSAT) depth K=3 took 1 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-09(UNSAT) depth K=3 took 1 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-10(UNSAT) depth K=3 took 0 ms
[2022-06-02 16:58:57] [INFO ] Invariants computation overflowed in 55 ms
[2022-06-02 16:58:57] [INFO ] Computed 0 place invariants in 55 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-11(UNSAT) depth K=3 took 3 ms
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-13(UNSAT) depth K=3 took 0 ms
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :32 after 126
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-00(UNSAT) depth K=4 took 158 ms
SDD proceeding with computation,10 properties remain. new max is 256
[2022-06-02 16:58:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-03(UNSAT) depth K=4 took 39 ms
SDD size :126 after 955
[2022-06-02 16:58:58] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-04(UNSAT) depth K=4 took 33 ms
[2022-06-02 16:58:58] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-05(UNSAT) depth K=4 took 57 ms
[2022-06-02 16:58:58] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-07(UNSAT) depth K=4 took 42 ms
[2022-06-02 16:58:58] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-08(UNSAT) depth K=4 took 55 ms
[2022-06-02 16:58:58] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-09(UNSAT) depth K=4 took 47 ms
[2022-06-02 16:58:58] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-10(UNSAT) depth K=4 took 50 ms
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :955 after 2133
[2022-06-02 16:58:58] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-11(UNSAT) depth K=4 took 69 ms
[2022-06-02 16:58:58] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-13(UNSAT) depth K=4 took 46 ms
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :2133 after 2683
[2022-06-02 16:58:58] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-00(UNSAT) depth K=5 took 316 ms
[2022-06-02 16:58:58] [INFO ] Proved 587 variables to be positive in 1123 ms
[2022-06-02 16:58:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-00
[2022-06-02 16:58:58] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-00(SAT) depth K=0 took 4 ms
[2022-06-02 16:58:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-03
[2022-06-02 16:58:58] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-03(SAT) depth K=0 took 3 ms
[2022-06-02 16:58:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-04
[2022-06-02 16:58:58] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-04(SAT) depth K=0 took 1 ms
[2022-06-02 16:58:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-05
[2022-06-02 16:58:58] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-05(SAT) depth K=0 took 3 ms
[2022-06-02 16:58:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-07
[2022-06-02 16:58:58] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-07(SAT) depth K=0 took 2 ms
[2022-06-02 16:58:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-08
[2022-06-02 16:58:58] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-08(SAT) depth K=0 took 2 ms
[2022-06-02 16:58:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-09
[2022-06-02 16:58:58] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-09(SAT) depth K=0 took 4 ms
[2022-06-02 16:58:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-10
[2022-06-02 16:58:58] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-10(SAT) depth K=0 took 2 ms
[2022-06-02 16:58:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-11
[2022-06-02 16:58:58] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-11(SAT) depth K=0 took 2 ms
[2022-06-02 16:58:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-13
[2022-06-02 16:58:58] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-13(SAT) depth K=0 took 2 ms
Compilation finished in 2218 ms.
Running link step : cd /tmp/ltsmin18032645770688848263;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18032645770688848263;'/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' 'DoubleExponentPT020ReachabilityFireability00==true'
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :2683 after 5455
[2022-06-02 16:59:01] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-03(UNSAT) depth K=5 took 2392 ms
[2022-06-02 16:59:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-00
[2022-06-02 16:59:01] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-00(SAT) depth K=1 took 2225 ms
[2022-06-02 16:59:02] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-04(UNSAT) depth K=5 took 1320 ms
[2022-06-02 16:59:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-03
[2022-06-02 16:59:02] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-03(SAT) depth K=1 took 1806 ms
[2022-06-02 16:59:03] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-05(UNSAT) depth K=5 took 1432 ms
[2022-06-02 16:59:04] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-07(UNSAT) depth K=5 took 1062 ms
[2022-06-02 16:59:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-04
[2022-06-02 16:59:05] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-04(SAT) depth K=1 took 2082 ms
[2022-06-02 16:59:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-08(UNSAT) depth K=5 took 616 ms
[2022-06-02 16:59:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-09(UNSAT) depth K=5 took 838 ms
[2022-06-02 16:59:07] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-10(UNSAT) depth K=5 took 667 ms
[2022-06-02 16:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-11(UNSAT) depth K=5 took 1877 ms
[2022-06-02 16:59:10] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-13(UNSAT) depth K=5 took 1379 ms
[2022-06-02 16:59:29] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-00(UNSAT) depth K=6 took 18775 ms
[2022-06-02 17:00:04] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-03(UNSAT) depth K=6 took 35773 ms
[2022-06-02 17:00:26] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-04(UNSAT) depth K=6 took 21797 ms
[2022-06-02 17:00:47] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-05(UNSAT) depth K=6 took 20550 ms
[2022-06-02 17:01:47] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-07(UNSAT) depth K=6 took 60044 ms
[2022-06-02 17:02:31] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-08(UNSAT) depth K=6 took 44671 ms
[2022-06-02 17:02:35] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-09(UNSAT) depth K=6 took 3522 ms
[2022-06-02 17:02:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-05
[2022-06-02 17:02:49] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-05(SAT) depth K=1 took 224067 ms
[2022-06-02 17:02:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-07
[2022-06-02 17:02:51] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-07(SAT) depth K=1 took 2557 ms
[2022-06-02 17:02:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-08
[2022-06-02 17:02:53] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-08(SAT) depth K=1 took 1757 ms
[2022-06-02 17:02:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-09
[2022-06-02 17:02:58] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-09(SAT) depth K=1 took 5288 ms
[2022-06-02 17:03:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-10
[2022-06-02 17:03:00] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-10(SAT) depth K=1 took 2070 ms
[2022-06-02 17:03:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-11
[2022-06-02 17:03:01] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-11(SAT) depth K=1 took 959 ms
[2022-06-02 17:03:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityFireability-13
[2022-06-02 17:03:04] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityFireability-13(SAT) depth K=1 took 2832 ms
[2022-06-02 17:03:18] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-10(UNSAT) depth K=6 took 43338 ms
[2022-06-02 17:03:22] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-11(UNSAT) depth K=6 took 3989 ms
[2022-06-02 17:03:24] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-13(UNSAT) depth K=6 took 1631 ms
[2022-06-02 17:03:27] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-00(UNSAT) depth K=7 took 3404 ms
[2022-06-02 17:04:35] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-03(UNSAT) depth K=7 took 68068 ms
WARNING : LTSmin timed out (>360 s) on command cd /tmp/ltsmin18032645770688848263;'/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' 'DoubleExponentPT020ReachabilityFireability00==true'
Running LTSmin : cd /tmp/ltsmin18032645770688848263;'/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' 'DoubleExponentPT020ReachabilityFireability03==true'
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :5455 after 559845
[2022-06-02 17:06:03] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-04(UNSAT) depth K=7 took 87856 ms
[2022-06-02 17:07:59] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-05(UNSAT) depth K=7 took 115718 ms
[2022-06-02 17:08:04] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-07(UNSAT) depth K=7 took 4717 ms
[2022-06-02 17:10:12] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-08(UNSAT) depth K=7 took 128667 ms
[2022-06-02 17:10:38] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-09(UNSAT) depth K=7 took 25631 ms
[2022-06-02 17:10:50] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityFireability-10(UNSAT) depth K=7 took 11884 ms
WARNING : LTSmin timed out (>360 s) on command cd /tmp/ltsmin18032645770688848263;'/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' 'DoubleExponentPT020ReachabilityFireability03==true'
Running LTSmin : cd /tmp/ltsmin18032645770688848263;'/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' 'DoubleExponentPT020ReachabilityFireability04==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-020"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-020, 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 r078-tall-165260110000207"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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