About the Execution of ITS-LoLa for DoubleExponent-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.320 | 3600000.00 | 3700613.00 | 5386.80 | F???FTT?F????TF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882900798.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DoubleExponent-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882900798
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 3.9K Mar 31 07:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 07:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 30 00:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 30 00:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 24 05:37 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-100-ReachabilityCardinality-00
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-01
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-02
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-03
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-04
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-05
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-06
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-07
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-08
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-09
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-10
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-11
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-12
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-13
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-14
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1591242760240
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 03:52:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 03:52:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 03:52:42] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2020-06-04 03:52:42] [INFO ] Transformed 5304 places.
[2020-06-04 03:52:42] [INFO ] Transformed 4998 transitions.
[2020-06-04 03:52:42] [INFO ] Parsed PT model containing 5304 places and 4998 transitions in 241 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 900 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 333 resets, run finished after 137 ms. (steps per millisecond=72 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 269 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 275 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 276 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 62 ms. (steps per millisecond=161 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 276 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 290 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 284 resets, run finished after 58 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 868318 steps, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 868318 steps, saw 434068 distinct states, run finished after 30001 ms. (steps per millisecond=28 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 4998 rows 5304 cols
[2020-06-04 03:53:14] [INFO ] Invariants computation overflowed in 412 ms
[2020-06-04 03:53:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:53:19] [INFO ] [Real]Absence check using state equation in 4350 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 03:53:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:53:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:53:24] [INFO ] [Real]Absence check using state equation in 4512 ms returned (error "Failed to check-sat")
[2020-06-04 03:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:53:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:53:29] [INFO ] [Real]Absence check using state equation in 4436 ms returned (error "Failed to check-sat")
[2020-06-04 03:53:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:53:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:53:34] [INFO ] [Real]Absence check using state equation in 4516 ms returned (error "Failed to check-sat")
[2020-06-04 03:53:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:53:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:53:39] [INFO ] [Real]Absence check using state equation in 4481 ms returned unknown
[2020-06-04 03:53:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:53:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:53:44] [INFO ] [Real]Absence check using state equation in 4503 ms returned (error "Failed to check-sat")
[2020-06-04 03:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:53:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:53:49] [INFO ] [Real]Absence check using state equation in 4476 ms returned (error "Failed to check-sat")
[2020-06-04 03:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:53:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:53:54] [INFO ] [Real]Absence check using state equation in 4466 ms returned (error "Failed to check-sat")
[2020-06-04 03:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:53:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:53:59] [INFO ] [Real]Absence check using state equation in 4496 ms returned (error "Failed to check-sat")
[2020-06-04 03:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:54:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:54:04] [INFO ] [Real]Absence check using state equation in 4502 ms returned (error "Failed to check-sat")
[2020-06-04 03:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:54:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:54:09] [INFO ] [Real]Absence check using state equation in 4527 ms returned (error "Failed to check-sat")
[2020-06-04 03:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:54:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:54:14] [INFO ] [Real]Absence check using state equation in 4505 ms returned (error "Failed to check-sat")
[2020-06-04 03:54:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:54:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:54:19] [INFO ] [Real]Absence check using state equation in 4410 ms returned (error "Failed to check-sat")
[2020-06-04 03:54:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:54:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:54:24] [INFO ] [Real]Absence check using state equation in 4495 ms returned (error "Failed to check-sat")
[2020-06-04 03:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:54:29] [INFO ] [Real]Absence check using state equation in 4448 ms returned (error "Failed to check-sat")
[2020-06-04 03:54:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:54:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:54:34] [INFO ] [Real]Absence check using state equation in 4493 ms returned (error "Failed to check-sat")
Support contains 50 out of 5304 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Discarding 4 places :
Also discarding 0 output transitions
Graph (complete) has 9096 edges and 5304 vertex of which 5300 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.64 ms
Performed 1165 Post agglomeration using F-continuation condition.Transition count delta: 1165
Iterating post reduction 0 with 1165 rules applied. Total rules applied 1166 place count 5300 transition count 3833
Reduce places removed 1165 places and 0 transitions.
Iterating post reduction 1 with 1165 rules applied. Total rules applied 2331 place count 4135 transition count 3833
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 202 Pre rules applied. Total rules applied 2331 place count 4135 transition count 3631
Deduced a syphon composed of 202 places in 241 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 2 with 404 rules applied. Total rules applied 2735 place count 3933 transition count 3631
Performed 877 Post agglomeration using F-continuation condition.Transition count delta: 877
Deduced a syphon composed of 877 places in 97 ms
Reduce places removed 877 places and 0 transitions.
Iterating global reduction 2 with 1754 rules applied. Total rules applied 4489 place count 3056 transition count 2754
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 171 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4691 place count 2955 transition count 2754
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 91 places in 84 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 4873 place count 2864 transition count 2754
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4874 place count 2864 transition count 2753
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4875 place count 2863 transition count 2753
Free-agglomeration rule (complex) applied 406 times.
Iterating global reduction 3 with 406 rules applied. Total rules applied 5281 place count 2863 transition count 2347
Reduce places removed 406 places and 0 transitions.
Iterating post reduction 3 with 406 rules applied. Total rules applied 5687 place count 2457 transition count 2347
Partial Free-agglomeration rule applied 404 times.
Drop transitions removed 404 transitions
Iterating global reduction 4 with 404 rules applied. Total rules applied 6091 place count 2457 transition count 2347
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6092 place count 2456 transition count 2346
Applied a total of 6092 rules in 4113 ms. Remains 2456 /5304 variables (removed 2848) and now considering 2346/4998 (removed 2652) transitions.
Finished structural reductions, in 1 iterations. Remains : 2456/5304 places, 2346/4998 transitions.
Incomplete random walk after 1000000 steps, including 128116 resets, run finished after 7100 ms. (steps per millisecond=140 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84704 resets, run finished after 4109 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 871401 steps, including 73827 resets, run timeout after 5001 ms. (steps per millisecond=174 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 999495 steps, including 84493 resets, run timeout after 5001 ms. (steps per millisecond=199 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 994923 steps, including 84159 resets, run timeout after 5001 ms. (steps per millisecond=198 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84747 resets, run finished after 4645 ms. (steps per millisecond=215 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84914 resets, run finished after 4737 ms. (steps per millisecond=211 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84674 resets, run finished after 4211 ms. (steps per millisecond=237 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84604 resets, run finished after 4205 ms. (steps per millisecond=237 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 976895 steps, including 82653 resets, run timeout after 5001 ms. (steps per millisecond=195 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84574 resets, run finished after 4269 ms. (steps per millisecond=234 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84859 resets, run finished after 4284 ms. (steps per millisecond=233 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84908 resets, run finished after 4168 ms. (steps per millisecond=239 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84600 resets, run finished after 4142 ms. (steps per millisecond=241 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 969580 steps, including 82082 resets, run timeout after 5001 ms. (steps per millisecond=193 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84784 resets, run finished after 4605 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84502 resets, run finished after 4584 ms. (steps per millisecond=218 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 1588912 steps, run timeout after 30001 ms. (steps per millisecond=52 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 1588912 steps, saw 794284 distinct states, run finished after 30002 ms. (steps per millisecond=52 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2346 rows 2456 cols
[2020-06-04 03:56:29] [INFO ] Invariants computation overflowed in 98 ms
[2020-06-04 03:56:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:56:39] [INFO ] [Real]Absence check using state equation in 9822 ms returned unsat
[2020-06-04 03:56:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:56:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:56:54] [INFO ] [Real]Absence check using state equation in 15303 ms returned unknown
[2020-06-04 03:56:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:57:01] [INFO ] [Real]Absence check using state equation in 6173 ms returned sat
[2020-06-04 03:57:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:57:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:57:08] [INFO ] [Nat]Absence check using state equation in 6750 ms returned sat
[2020-06-04 03:57:08] [INFO ] State equation strengthened by 385 read => feed constraints.
[2020-06-04 03:57:09] [INFO ] [Nat]Added 385 Read/Feed constraints in 712 ms returned sat
[2020-06-04 03:57:11] [INFO ] Deduced a trap composed of 4 places in 1995 ms
[2020-06-04 03:57:13] [INFO ] Deduced a trap composed of 9 places in 1666 ms
[2020-06-04 03:57:15] [INFO ] Deduced a trap composed of 2 places in 1882 ms
[2020-06-04 03:57:17] [INFO ] Deduced a trap composed of 4 places in 1991 ms
[2020-06-04 03:57:19] [INFO ] Deduced a trap composed of 10 places in 1703 ms
[2020-06-04 03:57:21] [INFO ] Deduced a trap composed of 11 places in 1814 ms
[2020-06-04 03:57:22] [INFO ] Deduced a trap composed of 4 places in 1775 ms
[2020-06-04 03:57:24] [INFO ] Deduced a trap composed of 12 places in 1601 ms
[2020-06-04 03:57:26] [INFO ] Deduced a trap composed of 8 places in 1702 ms
[2020-06-04 03:57:28] [INFO ] Deduced a trap composed of 4 places in 1778 ms
[2020-06-04 03:57:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 18911 ms
[2020-06-04 03:57:28] [INFO ] Computed and/alt/rep : 2345/57351/2345 causal constraints in 394 ms.
[2020-06-04 03:57:46] [INFO ] Added : 355 causal constraints over 71 iterations in 18245 ms. Result :unknown
[2020-06-04 03:57:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:58:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:58:21] [INFO ] [Real]Absence check using state equation in 34948 ms returned sat
[2020-06-04 03:58:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:58:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:58:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:58:55] [INFO ] [Nat]Absence check using state equation in 33242 ms returned sat
[2020-06-04 03:58:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:59:01] [INFO ] [Nat]Added 385 Read/Feed constraints in 6052 ms returned unknown
[2020-06-04 03:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:59:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:59:46] [INFO ] [Real]Absence check using state equation in 44754 ms returned (error "Failed to check-sat")
[2020-06-04 03:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:00:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:00:31] [INFO ] [Real]Absence check using state equation in 44856 ms returned (error "Failed to check-sat")
[2020-06-04 04:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:01:13] [INFO ] [Real]Absence check using state equation in 42133 ms returned sat
[2020-06-04 04:01:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:01:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:01:58] [INFO ] [Nat]Absence check using state equation in 44618 ms returned sat
[2020-06-04 04:01:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:01:59] [INFO ] [Nat]Added 385 Read/Feed constraints in 159 ms returned unknown
[2020-06-04 04:01:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:02:44] [INFO ] [Real]Absence check using state equation in 44775 ms returned (error "Failed to check-sat")
[2020-06-04 04:02:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:03:29] [INFO ] [Real]Absence check using state equation in 44802 ms returned (error "Failed to check-sat")
[2020-06-04 04:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:04:14] [INFO ] [Real]Absence check using state equation in 44823 ms returned (error "Failed to check-sat")
[2020-06-04 04:04:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:04:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:04:59] [INFO ] [Real]Absence check using state equation in 44798 ms returned (error "Failed to check-sat")
[2020-06-04 04:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:05:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:05:44] [INFO ] [Real]Absence check using state equation in 44763 ms returned (error "Failed to check-sat")
[2020-06-04 04:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:06:29] [INFO ] [Real]Absence check using state equation in 44773 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 04:06:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:07:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:07:14] [INFO ] [Real]Absence check using state equation in 44760 ms returned (error "Failed to check-sat")
[2020-06-04 04:07:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:07:28] [INFO ] [Real]Absence check using state equation in 13822 ms returned sat
[2020-06-04 04:07:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:07:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:07:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:07:49] [INFO ] [Nat]Absence check using state equation in 20931 ms returned unknown
[2020-06-04 04:07:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:08:01] [INFO ] [Real]Absence check using state equation in 11456 ms returned sat
[2020-06-04 04:08:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:08:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:08:12] [INFO ] [Nat]Absence check using state equation in 10946 ms returned sat
[2020-06-04 04:08:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:08:18] [INFO ] [Nat]Added 385 Read/Feed constraints in 6129 ms returned unknown
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 47 out of 2456 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2456/2456 places, 2346/2346 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 49 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2455 transition count 2345
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 105 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2454 transition count 2345
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 2454 transition count 2343
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 2452 transition count 2343
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 2452 transition count 2343
Applied a total of 9 rules in 947 ms. Remains 2452 /2456 variables (removed 4) and now considering 2343/2346 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 2452/2456 places, 2343/2346 transitions.
Incomplete random walk after 1000000 steps, including 128237 resets, run finished after 6926 ms. (steps per millisecond=144 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84824 resets, run finished after 4508 ms. (steps per millisecond=221 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84376 resets, run finished after 4472 ms. (steps per millisecond=223 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84812 resets, run finished after 4274 ms. (steps per millisecond=233 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84958 resets, run finished after 4234 ms. (steps per millisecond=236 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84612 resets, run finished after 4230 ms. (steps per millisecond=236 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84791 resets, run finished after 4480 ms. (steps per millisecond=223 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84795 resets, run finished after 4504 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84698 resets, run finished after 4329 ms. (steps per millisecond=231 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84621 resets, run finished after 4829 ms. (steps per millisecond=207 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84541 resets, run finished after 4807 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84743 resets, run finished after 4938 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84711 resets, run finished after 4760 ms. (steps per millisecond=210 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84717 resets, run finished after 4619 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84744 resets, run finished after 4298 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84719 resets, run finished after 4838 ms. (steps per millisecond=206 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 1601712 steps, run timeout after 30001 ms. (steps per millisecond=53 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 1601712 steps, saw 800670 distinct states, run finished after 30001 ms. (steps per millisecond=53 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2343 rows 2452 cols
[2020-06-04 04:10:04] [INFO ] Invariants computation overflowed in 51 ms
[2020-06-04 04:10:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:10:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:10:25] [INFO ] [Real]Absence check using state equation in 20098 ms returned unknown
[2020-06-04 04:10:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:10:58] [INFO ] [Real]Absence check using state equation in 33344 ms returned sat
[2020-06-04 04:10:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:10:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:11:43] [INFO ] [Nat]Absence check using state equation in 43813 ms returned sat
[2020-06-04 04:11:43] [INFO ] State equation strengthened by 388 read => feed constraints.
[2020-06-04 04:11:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:11:43] [INFO ] [Nat]Added 388 Read/Feed constraints in 703 ms returned unknown
[2020-06-04 04:11:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:12:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:12:28] [INFO ] [Real]Absence check using state equation in 44786 ms returned (error "Failed to check-sat")
[2020-06-04 04:12:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:13:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:13:13] [INFO ] [Real]Absence check using state equation in 44792 ms returned (error "Failed to check-sat")
[2020-06-04 04:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:13:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:13:58] [INFO ] [Real]Absence check using state equation in 44800 ms returned (error "Failed to check-sat")
[2020-06-04 04:13:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:14:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:14:43] [INFO ] [Real]Absence check using state equation in 44787 ms returned (error "Failed to check-sat")
[2020-06-04 04:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:14:53] [INFO ] [Real]Absence check using state equation in 9210 ms returned sat
[2020-06-04 04:14:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:14:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:15:03] [INFO ] [Nat]Absence check using state equation in 9738 ms returned sat
[2020-06-04 04:15:03] [INFO ] [Nat]Added 388 Read/Feed constraints in 384 ms returned sat
[2020-06-04 04:15:05] [INFO ] Deduced a trap composed of 4 places in 1826 ms
[2020-06-04 04:15:07] [INFO ] Deduced a trap composed of 10 places in 1520 ms
[2020-06-04 04:15:09] [INFO ] Deduced a trap composed of 4 places in 1643 ms
[2020-06-04 04:15:10] [INFO ] Deduced a trap composed of 4 places in 1747 ms
[2020-06-04 04:15:12] [INFO ] Deduced a trap composed of 7 places in 1612 ms
[2020-06-04 04:15:14] [INFO ] Deduced a trap composed of 4 places in 1605 ms
[2020-06-04 04:15:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 10528 ms
[2020-06-04 04:15:14] [INFO ] Computed and/alt/rep : 2342/57404/2342 causal constraints in 361 ms.
[2020-06-04 04:15:18] [INFO ] Added : 15 causal constraints over 3 iterations in 4241 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 48 ms.
[2020-06-04 04:15:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:16:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:16:03] [INFO ] [Real]Absence check using state equation in 44821 ms returned (error "Failed to check-sat")
[2020-06-04 04:16:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:16:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:16:48] [INFO ] [Real]Absence check using state equation in 44804 ms returned (error "Failed to check-sat")
[2020-06-04 04:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:17:33] [INFO ] [Real]Absence check using state equation in 44787 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 04:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:18:18] [INFO ] [Real]Absence check using state equation in 44822 ms returned (error "Failed to check-sat")
[2020-06-04 04:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:18:58] [INFO ] [Real]Absence check using state equation in 39274 ms returned sat
[2020-06-04 04:18:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:18:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:19:39] [INFO ] [Nat]Absence check using state equation in 41072 ms returned sat
[2020-06-04 04:19:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:19:43] [INFO ] [Nat]Added 388 Read/Feed constraints in 3716 ms returned unknown
[2020-06-04 04:19:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:20:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:20:28] [INFO ] [Real]Absence check using state equation in 44761 ms returned (error "Failed to check-sat")
[2020-06-04 04:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:20:44] [INFO ] [Real]Absence check using state equation in 15474 ms returned sat
[2020-06-04 04:20:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:20:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:21:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:21:06] [INFO ] [Nat]Absence check using state equation in 21987 ms returned unknown
[2020-06-04 04:21:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:21:22] [INFO ] [Real]Absence check using state equation in 15377 ms returned sat
[2020-06-04 04:21:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:21:46] [INFO ] [Nat]Absence check using state equation in 23737 ms returned sat
[2020-06-04 04:21:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:22:04] [INFO ] [Nat]Added 388 Read/Feed constraints in 17592 ms returned unknown
Interrupted Parikh walk after 3708211 steps, including 561798 resets, run timeout after 30001 ms. (steps per millisecond=123 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 47 out of 2452 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2452/2452 places, 2343/2343 transitions.
Applied a total of 0 rules in 131 ms. Remains 2452 /2452 variables (removed 0) and now considering 2343/2343 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2452/2452 places, 2343/2343 transitions.
Starting structural reductions, iteration 0 : 2452/2452 places, 2343/2343 transitions.
Applied a total of 0 rules in 151 ms. Remains 2452 /2452 variables (removed 0) and now considering 2343/2343 (removed 0) transitions.
// Phase 1: matrix 2343 rows 2452 cols
[2020-06-04 04:22:34] [INFO ] Invariants computation overflowed in 118 ms
[2020-06-04 04:22:58] [INFO ] Implicit Places using invariants in 23741 ms returned []
// Phase 1: matrix 2343 rows 2452 cols
[2020-06-04 04:22:58] [INFO ] Invariants computation overflowed in 62 ms
[2020-06-04 04:23:28] [INFO ] Performed 2403/2452 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-06-04 04:23:29] [INFO ] Implicit Places using invariants and state equation in 31449 ms returned []
Implicit Place search using SMT with State Equation took 55200 ms to find 0 implicit places.
[2020-06-04 04:23:29] [INFO ] Redundant transitions in 250 ms returned []
// Phase 1: matrix 2343 rows 2452 cols
[2020-06-04 04:23:29] [INFO ] Invariants computation overflowed in 90 ms
[2020-06-04 04:23:38] [INFO ] Dead Transitions using invariants and state equation in 9120 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2452/2452 places, 2343/2343 transitions.
Incomplete random walk after 100000 steps, including 12848 resets, run finished after 812 ms. (steps per millisecond=123 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2343 rows 2452 cols
[2020-06-04 04:23:39] [INFO ] Invariants computation overflowed in 67 ms
[2020-06-04 04:23:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:23:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:23:58] [INFO ] [Real]Absence check using state equation in 18790 ms returned unknown
[2020-06-04 04:23:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:24:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:24:18] [INFO ] [Real]Absence check using state equation in 19813 ms returned (error "Failed to check-sat")
[2020-06-04 04:24:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:24:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:24:38] [INFO ] [Real]Absence check using state equation in 19729 ms returned unknown
[2020-06-04 04:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:24:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:24:58] [INFO ] [Real]Absence check using state equation in 19805 ms returned unknown
[2020-06-04 04:24:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:25:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:25:18] [INFO ] [Real]Absence check using state equation in 19807 ms returned (error "Failed to check-sat")
[2020-06-04 04:25:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:25:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:25:38] [INFO ] [Real]Absence check using state equation in 19792 ms returned unknown
[2020-06-04 04:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:25:49] [INFO ] [Real]Absence check using state equation in 10058 ms returned sat
[2020-06-04 04:25:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:25:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:26:00] [INFO ] [Nat]Absence check using state equation in 10665 ms returned sat
[2020-06-04 04:26:00] [INFO ] State equation strengthened by 388 read => feed constraints.
[2020-06-04 04:26:00] [INFO ] [Nat]Added 388 Read/Feed constraints in 376 ms returned sat
[2020-06-04 04:26:02] [INFO ] Deduced a trap composed of 4 places in 1733 ms
[2020-06-04 04:26:04] [INFO ] Deduced a trap composed of 10 places in 1561 ms
[2020-06-04 04:26:05] [INFO ] Deduced a trap composed of 4 places in 1495 ms
[2020-06-04 04:26:07] [INFO ] Deduced a trap composed of 4 places in 1472 ms
[2020-06-04 04:26:08] [INFO ] Deduced a trap composed of 7 places in 1603 ms
[2020-06-04 04:26:10] [INFO ] Deduced a trap composed of 4 places in 1481 ms
[2020-06-04 04:26:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s6 s916 s1073) 0)") while checking expression at index 6
[2020-06-04 04:26:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:26:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:26:30] [INFO ] [Real]Absence check using state equation in 19837 ms returned (error "Failed to check-sat")
[2020-06-04 04:26:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:26:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:26:50] [INFO ] [Real]Absence check using state equation in 19784 ms returned unknown
[2020-06-04 04:26:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:27:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:27:10] [INFO ] [Real]Absence check using state equation in 19787 ms returned (error "Failed to check-sat")
[2020-06-04 04:27:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:27:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:27:30] [INFO ] [Real]Absence check using state equation in 19796 ms returned unknown
[2020-06-04 04:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:27:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:27:50] [INFO ] [Real]Absence check using state equation in 19719 ms returned unknown
[2020-06-04 04:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:28:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:28:10] [INFO ] [Real]Absence check using state equation in 19806 ms returned unknown
[2020-06-04 04:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:28:25] [INFO ] [Real]Absence check using state equation in 14589 ms returned sat
[2020-06-04 04:28:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:28:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:28:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:28:45] [INFO ] [Nat]Absence check using state equation in 19764 ms returned unknown
[2020-06-04 04:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:28:58] [INFO ] [Real]Absence check using state equation in 13062 ms returned sat
[2020-06-04 04:28:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:28:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:29:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:29:18] [INFO ] [Nat]Absence check using state equation in 19810 ms returned (error "Failed to check-sat")
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2452 transition count 2340
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 2449 transition count 2340
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 191 Pre rules applied. Total rules applied 6 place count 2449 transition count 2149
Deduced a syphon composed of 191 places in 64 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 2 with 382 rules applied. Total rules applied 388 place count 2258 transition count 2149
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 389 place count 2258 transition count 2148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 2257 transition count 2148
Applied a total of 390 rules in 551 ms. Remains 2257 /2452 variables (removed 195) and now considering 2148/2343 (removed 195) transitions.
// Phase 1: matrix 2148 rows 2257 cols
[2020-06-04 04:29:19] [INFO ] Invariants computation overflowed in 53 ms
[2020-06-04 04:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:29:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:29:33] [INFO ] [Real]Absence check using state equation in 14028 ms returned unknown
[2020-06-04 04:29:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:29:50] [INFO ] [Real]Absence check using state equation in 16677 ms returned sat
[2020-06-04 04:29:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:29:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:30:06] [INFO ] [Nat]Absence check using state equation in 15411 ms returned sat
[2020-06-04 04:30:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 04:30:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 62 ms returned sat
[2020-06-04 04:30:08] [INFO ] Deduced a trap composed of 2 places in 1555 ms
[2020-06-04 04:30:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1677 ms
[2020-06-04 04:30:08] [INFO ] Computed and/alt/rep : 2147/56424/2147 causal constraints in 243 ms.
[2020-06-04 04:30:13] [INFO ] Added : 5 causal constraints over 1 iterations in 4876 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-04 04:30:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:30:42] [INFO ] [Real]Absence check using state equation in 29424 ms returned sat
[2020-06-04 04:30:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:31:13] [INFO ] [Nat]Absence check using state equation in 30700 ms returned sat
[2020-06-04 04:31:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 76 ms returned sat
[2020-06-04 04:31:15] [INFO ] Deduced a trap composed of 33 places in 1636 ms
[2020-06-04 04:31:17] [INFO ] Deduced a trap composed of 26 places in 1520 ms
[2020-06-04 04:31:19] [INFO ] Deduced a trap composed of 29 places in 1799 ms
[2020-06-04 04:31:21] [INFO ] Deduced a trap composed of 23 places in 1733 ms
[2020-06-04 04:31:22] [INFO ] Deduced a trap composed of 11 places in 1618 ms
[2020-06-04 04:31:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 9158 ms
[2020-06-04 04:31:23] [INFO ] Computed and/alt/rep : 2147/56424/2147 causal constraints in 406 ms.
[2020-06-04 04:31:27] [INFO ] Added : 105 causal constraints over 21 iterations in 4928 ms. Result :unknown
[2020-06-04 04:31:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:32:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:32:12] [INFO ] [Real]Absence check using state equation in 44772 ms returned (error "Failed to check-sat")
[2020-06-04 04:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:32:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:32:57] [INFO ] [Real]Absence check using state equation in 44772 ms returned (error "Failed to check-sat")
[2020-06-04 04:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:33:23] [INFO ] [Real]Absence check using state equation in 25382 ms returned sat
[2020-06-04 04:33:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:34:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:34:08] [INFO ] [Nat]Absence check using state equation in 44744 ms returned (error "Failed to check-sat")
[2020-06-04 04:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:34:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:34:53] [INFO ] [Real]Absence check using state equation in 44787 ms returned (error "Failed to check-sat")
[2020-06-04 04:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:35:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:35:38] [INFO ] [Real]Absence check using state equation in 44744 ms returned unknown
[2020-06-04 04:35:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:36:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:36:23] [INFO ] [Real]Absence check using state equation in 44799 ms returned (error "Failed to check-sat")
[2020-06-04 04:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:37:08] [INFO ] [Real]Absence check using state equation in 44829 ms returned (error "Failed to check-sat")
[2020-06-04 04:37:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:37:27] [INFO ] [Real]Absence check using state equation in 18691 ms returned sat
[2020-06-04 04:37:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:38:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:38:12] [INFO ] [Nat]Absence check using state equation in 44819 ms returned (error "Failed to check-sat")
[2020-06-04 04:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:38:40] [INFO ] [Real]Absence check using state equation in 26960 ms returned sat
[2020-06-04 04:38:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:38:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:38:51] [INFO ] [Nat]Absence check using state equation in 10597 ms returned sat
[2020-06-04 04:38:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 101 ms returned sat
[2020-06-04 04:38:52] [INFO ] Deduced a trap composed of 11 places in 1669 ms
[2020-06-04 04:38:54] [INFO ] Deduced a trap composed of 26 places in 1537 ms
[2020-06-04 04:38:56] [INFO ] Deduced a trap composed of 29 places in 1490 ms
[2020-06-04 04:38:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5036 ms
[2020-06-04 04:38:56] [INFO ] Computed and/alt/rep : 2147/56424/2147 causal constraints in 223 ms.
[2020-06-04 04:39:05] [INFO ] Added : 85 causal constraints over 17 iterations in 9555 ms. Result :unknown
[2020-06-04 04:39:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:39:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:39:50] [INFO ] [Real]Absence check using state equation in 44892 ms returned unknown
[2020-06-04 04:39:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:40:29] [INFO ] [Real]Absence check using state equation in 38187 ms returned sat
[2020-06-04 04:40:29] [INFO ] [Real]Added 1 Read/Feed constraints in 45 ms returned sat
[2020-06-04 04:40:30] [INFO ] Deduced a trap composed of 2 places in 1401 ms
[2020-06-04 04:40:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1563 ms
[2020-06-04 04:40:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:40:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:40:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:40:48] [INFO ] [Nat]Absence check using state equation in 17389 ms returned unknown
[2020-06-04 04:40:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:41:01] [INFO ] [Real]Absence check using state equation in 12301 ms returned sat
[2020-06-04 04:41:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:41:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:41:13] [INFO ] [Nat]Absence check using state equation in 12171 ms returned sat
[2020-06-04 04:41:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 200 ms returned sat
[2020-06-04 04:41:15] [INFO ] Deduced a trap composed of 13 places in 1687 ms
[2020-06-04 04:41:17] [INFO ] Deduced a trap composed of 10 places in 1518 ms
[2020-06-04 04:41:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3413 ms
[2020-06-04 04:41:17] [INFO ] Computed and/alt/rep : 2147/56424/2147 causal constraints in 228 ms.
[2020-06-04 04:41:24] [INFO ] Added : 5 causal constraints over 1 iterations in 7307 ms. Result :unknown
[2020-06-04 04:41:24] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2020-06-04 04:41:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 85 ms.
[2020-06-04 04:41:26] [INFO ] Flatten gal took : 1150 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DoubleExponent-PT-100 @ 3570 seconds
spx_run: Lost feasibility 10 times - iter 1941 and 2 nodes.
spx_run: Lost feasibility 10 times - iter 3521 and 3 nodes.
spx_run: Lost feasibility 10 times - iter 4017 and 4 nodes.
spx_run: Lost feasibility 10 times - iter 3807 and 1 nodes.
spx_run: Lost feasibility 10 times - iter 5835 and 5 nodes.
spx_run: Lost feasibility 10 times - iter 7752 and 7 nodes.
spx_run: Lost feasibility 10 times - iter 9668 and 9 nodes.
spx_run: Lost feasibility 10 times - iter 11570 and 10 nodes.
spx_run: Lost feasibility 10 times - iter 11746 and 14 nodes.
spx_run: Lost feasibility 10 times - iter 13815 and 15 nodes.
spx_run: Lost feasibility 10 times - iter 15066 and 17 nodes.
spx_run: Lost feasibility 10 times - iter 17061 and 20 nodes.
spx_run: Lost feasibility 10 times - iter 17189 and 22 nodes.
spx_run: Lost feasibility 10 times - iter 3239 and 1 nodes.
spx_run: Lost feasibility 10 times - iter 5016 and 6 nodes.
spx_run: Lost feasibility 10 times - iter 6778 and 8 nodes.
spx_run: Lost feasibility 10 times - iter 8499 and 10 nodes.
spx_run: Lost feasibility 10 times - iter 10322 and 12 nodes.
spx_run: Lost feasibility 10 times - iter 10862 and 14 nodes.
spx_run: Lost feasibility 10 times - iter 12979 and 16 nodes.
spx_run: Lost feasibility 10 times - iter 14551 and 18 nodes.
spx_run: Lost feasibility 10 times - iter 1788 and 1 nodes.
spx_run: Lost feasibility 10 times - iter 4417 and 3 nodes.
spx_run: Lost feasibility 10 times - iter 6292 and 5 nodes.
spx_run: Lost feasibility 10 times - iter 8292 and 9 nodes.
spx_run: Lost feasibility 10 times - iter 9265 and 118 nodes.
spx_run: Lost feasibility 10 times - iter 9628 and 124 nodes.
spx_run: Lost feasibility 10 times - iter 9827 and 128 nodes.
spx_run: Lost feasibility 10 times - iter 10123 and 131 nodes.
spx_run: Lost feasibility 10 times - iter 10606 and 134 nodes.
spx_run: Lost feasibility 10 times - iter 11380 and 239 nodes.
spx_run: Lost feasibility 10 times - iter 11404 and 241 nodes.
spx_run: Lost feasibility 10 times - iter 11430 and 242 nodes.
spx_run: Lost feasibility 10 times - iter 11455 and 243 nodes.
spx_run: Lost feasibility 10 times - iter 11479 and 245 nodes.
spx_run: Lost feasibility 10 times - iter 11505 and 246 nodes.
spx_run: Lost feasibility 10 times - iter 11530 and 247 nodes.
spx_run: Lost feasibility 10 times - iter 11554 and 249 nodes.
spx_run: Lost feasibility 10 times - iter 11580 and 250 nodes.
spx_run: Lost feasibility 10 times - iter 11605 and 251 nodes.
spx_run: Lost feasibility 10 times - iter 11629 and 253 nodes.
spx_run: Lost feasibility 10 times - iter 11655 and 254 nodes.
spx_run: Lost feasibility 10 times - iter 11680 and 255 nodes.
spx_run: Lost feasibility 10 times - iter 11704 and 257 nodes.
spx_run: Lost feasibility 10 times - iter 11730 and 258 nodes.
spx_run: Lost feasibility 10 times - iter 11755 and 259 nodes.
spx_run: Lost feasibility 10 times - iter 11779 and 261 nodes.
spx_run: Lost feasibility 10 times - iter 11805 and 262 nodes.
spx_run: Lost feasibility 10 times - iter 11830 and 263 nodes.
spx_run: Lost feasibility 10 times - iter 11854 and 265 nodes.
spx_run: Lost feasibility 10 times - iter 11880 and 266 nodes.
spx_run: Lost feasibility 10 times - iter 11905 and 267 nodes.
spx_run: Lost feasibility 10 times - iter 11929 and 269 nodes.
spx_run: Lost feasibility 10 times - iter 11955 and 270 nodes.
spx_run: Lost feasibility 10 times - iter 11980 and 271 nodes.
spx_run: Lost feasibility 10 times - iter 12004 and 273 nodes.
spx_run: Lost feasibility 10 times - iter 12030 and 274 nodes.
spx_run: Lost feasibility 10 times - iter 12055 and 275 nodes.
spx_run: Lost feasibility 10 times - iter 12079 and 277 nodes.
spx_run: Lost feasibility 10 times - iter 12105 and 278 nodes.
spx_run: Lost feasibility 10 times - iter 12130 and 279 nodes.
spx_run: Lost feasibility 10 times - iter 12154 and 281 nodes.
spx_run: Lost feasibility 10 times - iter 12180 and 282 nodes.
spx_run: Lost feasibility 10 times - iter 12205 and 283 nodes.
spx_run: Lost feasibility 10 times - iter 12229 and 285 nodes.
spx_run: Lost feasibility 10 times - iter 12255 and 286 nodes.
spx_run: Lost feasibility 10 times - iter 12280 and 287 nodes.
spx_run: Lost feasibility 10 times - iter 12304 and 289 nodes.
spx_run: Lost feasibility 10 times - iter 12330 and 290 nodes.
spx_run: Lost feasibility 10 times - iter 12355 and 291 nodes.
spx_run: Lost feasibility 10 times - iter 12379 and 293 nodes.
spx_run: Lost feasibility 10 times - iter 12405 and 294 nodes.
spx_run: Lost feasibility 10 times - iter 12430 and 295 nodes.
spx_run: Lost feasibility 10 times - iter 12454 and 297 nodes.
spx_run: Lost feasibility 10 times - iter 12480 and 298 nodes.
spx_run: Lost feasibility 10 times - iter 12505 and 299 nodes.
spx_run: Lost feasibility 10 times - iter 12529 and 301 nodes.
spx_run: Lost feasibility 10 times - iter 12555 and 302 nodes.
spx_run: Lost feasibility 10 times - iter 12580 and 303 nodes.
spx_run: Lost feasibility 10 times - iter 12604 and 305 nodes.
spx_run: Lost feasibility 10 times - iter 12630 and 306 nodes.
spx_run: Lost feasibility 10 times - iter 12655 and 307 nodes.
spx_run: Lost feasibility 10 times - iter 12679 and 309 nodes.
spx_run: Lost feasibility 10 times - iter 12705 and 310 nodes.
spx_run: Lost feasibility 10 times - iter 12730 and 311 nodes.
spx_run: Lost feasibility 10 times - iter 12754 and 313 nodes.
spx_run: Lost feasibility 10 times - iter 12780 and 314 nodes.
spx_run: Lost feasibility 10 times - iter 12805 and 315 nodes.
spx_run: Lost feasibility 10 times - iter 12829 and 317 nodes.
spx_run: Lost feasibility 10 times - iter 12855 and 318 nodes.
spx_run: Lost feasibility 10 times - iter 12880 and 319 nodes.
spx_run: Lost feasibility 10 times - iter 12904 and 321 nodes.
spx_run: Lost feasibility 10 times - iter 12930 and 322 nodes.
spx_run: Lost feasibility 10 times - iter 12955 and 323 nodes.
spx_run: Lost feasibility 10 times - iter 12979 and 325 nodes.
spx_run: Lost feasibility 10 times - iter 13005 and 326 nodes.
spx_run: Lost feasibility 10 times - iter 13030 and 327 nodes.
spx_run: Lost feasibility 10 times - iter 13054 and 329 nodes.
spx_run: Lost feasibility 10 times - iter 13080 and 330 nodes.
spx_run: Lost feasibility 10 times - iter 13105 and 331 nodes.
spx_run: Lost feasibility 10 times - iter 13129 and 333 nodes.
spx_run: Lost feasibility 10 times - iter 13155 and 334 nodes.
spx_run: Lost feasibility 10 times - iter 13180 and 335 nodes.
spx_run: Lost feasibility 10 times - iter 13204 and 337 nodes.
spx_run: Lost feasibility 10 times - iter 13230 and 338 nodes.
spx_run: Lost feasibility 10 times - iter 13255 and 339 nodes.
spx_run: Lost feasibility 10 times - iter 13279 and 341 nodes.
spx_run: Lost feasibility 10 times - iter 13305 and 342 nodes.
spx_run: Lost feasibility 10 times - iter 13330 and 343 nodes.
spx_run: Lost feasibility 10 times - iter 13354 and 345 nodes.
spx_run: Lost feasibility 10 times - iter 13380 and 346 nodes.
spx_run: Lost feasibility 10 times - iter 13405 and 347 nodes.
spx_run: Lost feasibility 10 times - iter 13430 and 349 nodes.
spx_run: Lost feasibility 10 times - iter 13460 and 350 nodes.
spx_run: Lost feasibility 10 times - iter 13493 and 351 nodes.
spx_run: Lost feasibility 10 times - iter 13511 and 352 nodes.
spx_run: Lost feasibility 10 times - iter 13544 and 353 nodes.
spx_run: Lost feasibility 10 times - iter 13564 and 354 nodes.
spx_run: Lost feasibility 10 times - iter 14298 and 433 nodes.
spx_run: Lost feasibility 10 times - iter 3756 and 2 nodes.
spx_run: Lost feasibility 10 times - iter 3950 and 3 nodes.
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 14599224 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16125084 kB
--------------------
content from stderr:
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-100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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 itslola"
echo " Input is DoubleExponent-PT-100, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882900798"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;