About the Execution of ITS-LoLa for Peterson-COL-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15743.160 | 3600000.00 | 322220.00 | 162.90 | FTTFTTFTFTTFTT?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853600694.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 itslola
Input is Peterson-COL-6, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853600694
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 46K Apr 27 15:14 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 Peterson-COL-6-ReachabilityCardinality-00
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-01
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-02
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-03
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-04
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-05
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-06
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-07
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-08
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-09
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-10
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-11
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-12
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-13
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-14
FORMULA_NAME Peterson-COL-6-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1591163307791
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:48:29] [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-03 05:48:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:48:30] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 05:48:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 767 ms
[2020-06-03 05:48:30] [INFO ] sort/places :
ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
TourProc->turn,
ProcTour->askForSection,testTurn,endTurn,
Process->idle,CS,
[2020-06-03 05:48:30] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 27 ms.
[2020-06-03 05:48:30] [INFO ] Computed order based on color domains.
[2020-06-03 05:48:30] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions in 60 ms.
[2020-06-03 05:48:30] [INFO ] Unfolded HLPN properties in 3 ms.
Deduced a syphon composed of 42 places in 17 ms
Reduce places removed 42 places and 84 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 128 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-6-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 294 ms. (steps per millisecond=34 ) properties seen :[1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1]
FORMULA Peterson-COL-6-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 181 ms. (steps per millisecond=55 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 85 ms. (steps per millisecond=117 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=120 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 181 ms. (steps per millisecond=55 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 70 ms. (steps per millisecond=142 ) properties seen :[0, 0, 0, 0, 0]
[2020-06-03 05:48:31] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2020-06-03 05:48:31] [INFO ] Computed 27 place invariants in 58 ms
[2020-06-03 05:48:32] [INFO ] [Real]Absence check using 20 positive place invariants in 68 ms returned unsat
[2020-06-03 05:48:32] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned unsat
[2020-06-03 05:48:32] [INFO ] [Real]Absence check using 20 positive place invariants in 47 ms returned sat
[2020-06-03 05:48:32] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 18 ms returned sat
[2020-06-03 05:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:48:37] [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 (= s994 (- t1010 (+ t1514 t1766)))") while checking expression at index 2
[2020-06-03 05:48:37] [INFO ] [Real]Absence check using 20 positive place invariants in 38 ms returned unsat
[2020-06-03 05:48:38] [INFO ] [Real]Absence check using 20 positive place invariants in 50 ms returned sat
[2020-06-03 05:48:38] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 18 ms returned sat
[2020-06-03 05:48:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:48:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:48:42] [INFO ] [Real]Absence check using state equation in 4636 ms returned (error "Failed to check-sat")
FORMULA Peterson-COL-6-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-6-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-6-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 301 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 504 Post agglomeration using F-continuation condition.Transition count delta: 504
Iterating post reduction 0 with 504 rules applied. Total rules applied 504 place count 1330 transition count 1526
Reduce places removed 504 places and 0 transitions.
Iterating post reduction 1 with 504 rules applied. Total rules applied 1008 place count 826 transition count 1526
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 1008 place count 826 transition count 1449
Deduced a syphon composed of 77 places in 3 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 1162 place count 749 transition count 1449
Applied a total of 1162 rules in 489 ms. Remains 749 /1330 variables (removed 581) and now considering 1449/2030 (removed 581) transitions.
Finished structural reductions, in 1 iterations. Remains : 749/1330 places, 1449/2030 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2725 ms. (steps per millisecond=366 ) properties seen :[1, 0]
FORMULA Peterson-COL-6-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 752 ms. (steps per millisecond=1329 ) properties seen :[0]
[2020-06-03 05:48:46] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
// Phase 1: matrix 1239 rows 749 cols
[2020-06-03 05:48:46] [INFO ] Computed 27 place invariants in 7 ms
[2020-06-03 05:48:47] [INFO ] [Real]Absence check using 20 positive place invariants in 37 ms returned sat
[2020-06-03 05:48:47] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 21 ms returned sat
[2020-06-03 05:48:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:48:49] [INFO ] [Real]Absence check using state equation in 2135 ms returned sat
[2020-06-03 05:48:49] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 05:48:49] [INFO ] [Real]Added 366 Read/Feed constraints in 52 ms returned sat
[2020-06-03 05:48:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:48:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 51 ms returned sat
[2020-06-03 05:48:49] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2020-06-03 05:48:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:48:52] [INFO ] [Nat]Absence check using state equation in 2559 ms returned sat
[2020-06-03 05:48:52] [INFO ] [Nat]Added 366 Read/Feed constraints in 107 ms returned sat
[2020-06-03 05:48:53] [INFO ] Deduced a trap composed of 18 places in 621 ms
[2020-06-03 05:48:53] [INFO ] Deduced a trap composed of 83 places in 541 ms
[2020-06-03 05:48:54] [INFO ] Deduced a trap composed of 26 places in 568 ms
[2020-06-03 05:48:54] [INFO ] Deduced a trap composed of 62 places in 556 ms
[2020-06-03 05:48:55] [INFO ] Deduced a trap composed of 46 places in 486 ms
[2020-06-03 05:48:56] [INFO ] Deduced a trap composed of 28 places in 1044 ms
[2020-06-03 05:48:59] [INFO ] Deduced a trap composed of 82 places in 2598 ms
[2020-06-03 05:48:59] [INFO ] Deduced a trap composed of 84 places in 675 ms
[2020-06-03 05:49:00] [INFO ] Deduced a trap composed of 26 places in 493 ms
[2020-06-03 05:49:01] [INFO ] Deduced a trap composed of 52 places in 671 ms
[2020-06-03 05:49:01] [INFO ] Deduced a trap composed of 51 places in 485 ms
[2020-06-03 05:49:02] [INFO ] Deduced a trap composed of 34 places in 490 ms
[2020-06-03 05:49:02] [INFO ] Deduced a trap composed of 60 places in 458 ms
[2020-06-03 05:49:03] [INFO ] Deduced a trap composed of 90 places in 493 ms
[2020-06-03 05:49:04] [INFO ] Deduced a trap composed of 90 places in 463 ms
[2020-06-03 05:49:04] [INFO ] Deduced a trap composed of 113 places in 523 ms
[2020-06-03 05:49:05] [INFO ] Deduced a trap composed of 90 places in 480 ms
[2020-06-03 05:49:06] [INFO ] Deduced a trap composed of 85 places in 794 ms
[2020-06-03 05:49:06] [INFO ] Deduced a trap composed of 83 places in 496 ms
[2020-06-03 05:49:07] [INFO ] Deduced a trap composed of 60 places in 784 ms
[2020-06-03 05:49:08] [INFO ] Deduced a trap composed of 72 places in 471 ms
[2020-06-03 05:49:08] [INFO ] Deduced a trap composed of 26 places in 589 ms
[2020-06-03 05:49:09] [INFO ] Deduced a trap composed of 63 places in 793 ms
[2020-06-03 05:49:10] [INFO ] Deduced a trap composed of 63 places in 465 ms
[2020-06-03 05:49:10] [INFO ] Deduced a trap composed of 53 places in 433 ms
[2020-06-03 05:49:11] [INFO ] Deduced a trap composed of 75 places in 462 ms
[2020-06-03 05:49:11] [INFO ] Deduced a trap composed of 49 places in 407 ms
[2020-06-03 05:49:12] [INFO ] Deduced a trap composed of 44 places in 719 ms
[2020-06-03 05:49:13] [INFO ] Deduced a trap composed of 68 places in 602 ms
[2020-06-03 05:49:13] [INFO ] Deduced a trap composed of 36 places in 488 ms
[2020-06-03 05:49:14] [INFO ] Deduced a trap composed of 98 places in 522 ms
[2020-06-03 05:49:15] [INFO ] Deduced a trap composed of 49 places in 595 ms
[2020-06-03 05:49:15] [INFO ] Deduced a trap composed of 81 places in 511 ms
[2020-06-03 05:49:16] [INFO ] Deduced a trap composed of 39 places in 496 ms
[2020-06-03 05:49:16] [INFO ] Deduced a trap composed of 78 places in 462 ms
[2020-06-03 05:49:17] [INFO ] Deduced a trap composed of 22 places in 465 ms
[2020-06-03 05:49:17] [INFO ] Deduced a trap composed of 18 places in 524 ms
[2020-06-03 05:49:18] [INFO ] Deduced a trap composed of 27 places in 682 ms
[2020-06-03 05:49:19] [INFO ] Deduced a trap composed of 82 places in 977 ms
[2020-06-03 05:49:20] [INFO ] Deduced a trap composed of 77 places in 535 ms
[2020-06-03 05:49:20] [INFO ] Deduced a trap composed of 10 places in 467 ms
[2020-06-03 05:49:21] [INFO ] Deduced a trap composed of 79 places in 423 ms
[2020-06-03 05:49:21] [INFO ] Deduced a trap composed of 18 places in 412 ms
[2020-06-03 05:49:22] [INFO ] Deduced a trap composed of 44 places in 359 ms
[2020-06-03 05:49:22] [INFO ] Deduced a trap composed of 150 places in 441 ms
[2020-06-03 05:49:23] [INFO ] Deduced a trap composed of 81 places in 660 ms
[2020-06-03 05:49:23] [INFO ] Deduced a trap composed of 99 places in 476 ms
[2020-06-03 05:49:24] [INFO ] Deduced a trap composed of 19 places in 457 ms
[2020-06-03 05:49:25] [INFO ] Deduced a trap composed of 12 places in 481 ms
[2020-06-03 05:49:25] [INFO ] Deduced a trap composed of 28 places in 509 ms
[2020-06-03 05:49:26] [INFO ] Deduced a trap composed of 68 places in 473 ms
[2020-06-03 05:49:26] [INFO ] Deduced a trap composed of 76 places in 438 ms
[2020-06-03 05:49:27] [INFO ] Deduced a trap composed of 98 places in 390 ms
[2020-06-03 05:49:27] [INFO ] Deduced a trap composed of 74 places in 582 ms
[2020-06-03 05:49:28] [INFO ] Deduced a trap composed of 60 places in 499 ms
[2020-06-03 05:49:28] [INFO ] Deduced a trap composed of 36 places in 560 ms
[2020-06-03 05:49:29] [INFO ] Deduced a trap composed of 76 places in 491 ms
[2020-06-03 05:49:29] [INFO ] Deduced a trap composed of 58 places in 416 ms
[2020-06-03 05:49:30] [INFO ] Deduced a trap composed of 78 places in 442 ms
[2020-06-03 05:49:30] [INFO ] Deduced a trap composed of 84 places in 420 ms
[2020-06-03 05:49:31] [INFO ] Deduced a trap composed of 39 places in 444 ms
[2020-06-03 05:49:31] [INFO ] Deduced a trap composed of 144 places in 406 ms
[2020-06-03 05:49:32] [INFO ] Deduced a trap composed of 60 places in 469 ms
[2020-06-03 05:49:32] [INFO ] Deduced a trap composed of 76 places in 403 ms
[2020-06-03 05:49:33] [INFO ] Deduced a trap composed of 104 places in 354 ms
[2020-06-03 05:49:33] [INFO ] Deduced a trap composed of 94 places in 375 ms
[2020-06-03 05:49:34] [INFO ] Deduced a trap composed of 77 places in 377 ms
[2020-06-03 05:49:34] [INFO ] Deduced a trap composed of 80 places in 384 ms
[2020-06-03 05:49:34] [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 (> (+ s2 s17 s23 s26 s42 s44 s45 s46 s47 s48 s78 s82 s83 s100 s101 s120 s124 s125 s142 s143 s166 s167 s184 s185 s205 s209 s210 s227 s228 s285 s286 s287 s288 s305 s306 s307 s308 s310 s311 s312 s313 s395 s396 s397 s398 s399 s400 s401 s402 s403 s404 s511 s512 s513 s514 s515 s539 s540 s541 s542 s543 s546 s547 s548 s549 s550 s665 s666 s667 s668 s669 s670 s671 s672 s673 s674 s675 s676 s677 s678) 0)") while checking expression at index 0
Support contains 7 out of 749 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 749/749 places, 1449/1449 transitions.
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 749 transition count 1371
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 671 transition count 1371
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 216 Pre rules applied. Total rules applied 156 place count 671 transition count 1155
Deduced a syphon composed of 216 places in 1 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 2 with 432 rules applied. Total rules applied 588 place count 455 transition count 1155
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 672 place count 413 transition count 1113
Applied a total of 672 rules in 116 ms. Remains 413 /749 variables (removed 336) and now considering 1113/1449 (removed 336) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/749 places, 1113/1449 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1964 ms. (steps per millisecond=509 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 579 ms. (steps per millisecond=1727 ) properties seen :[0]
Interrupted probabilistic random walk after 8960832 steps, run timeout after 30001 ms. (steps per millisecond=298 ) properties seen :[0]
Probabilistic random walk after 8960832 steps, saw 1120105 distinct states, run finished after 30001 ms. (steps per millisecond=298 ) properties seen :[0]
[2020-06-03 05:50:07] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 413 cols
[2020-06-03 05:50:07] [INFO ] Computed 27 place invariants in 4 ms
[2020-06-03 05:50:07] [INFO ] [Real]Absence check using 20 positive place invariants in 46 ms returned sat
[2020-06-03 05:50:07] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 11 ms returned sat
[2020-06-03 05:50:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:50:08] [INFO ] [Real]Absence check using state equation in 946 ms returned sat
[2020-06-03 05:50:08] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 05:50:08] [INFO ] [Real]Added 366 Read/Feed constraints in 58 ms returned sat
[2020-06-03 05:50:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:50:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 31 ms returned sat
[2020-06-03 05:50:08] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 9 ms returned sat
[2020-06-03 05:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:50:09] [INFO ] [Nat]Absence check using state equation in 781 ms returned sat
[2020-06-03 05:50:09] [INFO ] [Nat]Added 366 Read/Feed constraints in 69 ms returned sat
[2020-06-03 05:50:09] [INFO ] Deduced a trap composed of 18 places in 267 ms
[2020-06-03 05:50:10] [INFO ] Deduced a trap composed of 21 places in 219 ms
[2020-06-03 05:50:10] [INFO ] Deduced a trap composed of 54 places in 253 ms
[2020-06-03 05:50:10] [INFO ] Deduced a trap composed of 22 places in 238 ms
[2020-06-03 05:50:10] [INFO ] Deduced a trap composed of 23 places in 243 ms
[2020-06-03 05:50:11] [INFO ] Deduced a trap composed of 21 places in 268 ms
[2020-06-03 05:50:11] [INFO ] Deduced a trap composed of 21 places in 249 ms
[2020-06-03 05:50:11] [INFO ] Deduced a trap composed of 10 places in 293 ms
[2020-06-03 05:50:12] [INFO ] Deduced a trap composed of 24 places in 226 ms
[2020-06-03 05:50:12] [INFO ] Deduced a trap composed of 14 places in 204 ms
[2020-06-03 05:50:12] [INFO ] Deduced a trap composed of 13 places in 219 ms
[2020-06-03 05:50:12] [INFO ] Deduced a trap composed of 21 places in 234 ms
[2020-06-03 05:50:13] [INFO ] Deduced a trap composed of 60 places in 222 ms
[2020-06-03 05:50:13] [INFO ] Deduced a trap composed of 21 places in 199 ms
[2020-06-03 05:50:13] [INFO ] Deduced a trap composed of 63 places in 199 ms
[2020-06-03 05:50:13] [INFO ] Deduced a trap composed of 30 places in 258 ms
[2020-06-03 05:50:14] [INFO ] Deduced a trap composed of 46 places in 220 ms
[2020-06-03 05:50:14] [INFO ] Deduced a trap composed of 31 places in 212 ms
[2020-06-03 05:50:14] [INFO ] Deduced a trap composed of 45 places in 191 ms
[2020-06-03 05:50:14] [INFO ] Deduced a trap composed of 38 places in 245 ms
[2020-06-03 05:50:15] [INFO ] Deduced a trap composed of 40 places in 242 ms
[2020-06-03 05:50:15] [INFO ] Deduced a trap composed of 46 places in 247 ms
[2020-06-03 05:50:15] [INFO ] Deduced a trap composed of 55 places in 244 ms
[2020-06-03 05:50:16] [INFO ] Deduced a trap composed of 31 places in 209 ms
[2020-06-03 05:50:16] [INFO ] Deduced a trap composed of 52 places in 197 ms
[2020-06-03 05:50:16] [INFO ] Deduced a trap composed of 47 places in 199 ms
[2020-06-03 05:50:16] [INFO ] Deduced a trap composed of 70 places in 206 ms
[2020-06-03 05:50:16] [INFO ] Deduced a trap composed of 78 places in 226 ms
[2020-06-03 05:50:17] [INFO ] Deduced a trap composed of 29 places in 234 ms
[2020-06-03 05:50:17] [INFO ] Deduced a trap composed of 37 places in 244 ms
[2020-06-03 05:50:17] [INFO ] Deduced a trap composed of 20 places in 233 ms
[2020-06-03 05:50:18] [INFO ] Deduced a trap composed of 34 places in 253 ms
[2020-06-03 05:50:18] [INFO ] Deduced a trap composed of 68 places in 233 ms
[2020-06-03 05:50:18] [INFO ] Deduced a trap composed of 65 places in 225 ms
[2020-06-03 05:50:18] [INFO ] Deduced a trap composed of 39 places in 207 ms
[2020-06-03 05:50:19] [INFO ] Deduced a trap composed of 57 places in 207 ms
[2020-06-03 05:50:19] [INFO ] Deduced a trap composed of 56 places in 213 ms
[2020-06-03 05:50:19] [INFO ] Deduced a trap composed of 13 places in 224 ms
[2020-06-03 05:50:19] [INFO ] Deduced a trap composed of 38 places in 198 ms
[2020-06-03 05:50:20] [INFO ] Deduced a trap composed of 54 places in 196 ms
[2020-06-03 05:50:20] [INFO ] Deduced a trap composed of 53 places in 175 ms
[2020-06-03 05:50:20] [INFO ] Deduced a trap composed of 54 places in 374 ms
[2020-06-03 05:50:20] [INFO ] Deduced a trap composed of 37 places in 139 ms
[2020-06-03 05:50:21] [INFO ] Deduced a trap composed of 38 places in 167 ms
[2020-06-03 05:50:21] [INFO ] Deduced a trap composed of 37 places in 156 ms
[2020-06-03 05:50:21] [INFO ] Deduced a trap composed of 43 places in 170 ms
[2020-06-03 05:50:21] [INFO ] Deduced a trap composed of 10 places in 213 ms
[2020-06-03 05:50:21] [INFO ] Deduced a trap composed of 10 places in 171 ms
[2020-06-03 05:50:22] [INFO ] Deduced a trap composed of 15 places in 167 ms
[2020-06-03 05:50:22] [INFO ] Deduced a trap composed of 47 places in 180 ms
[2020-06-03 05:50:22] [INFO ] Deduced a trap composed of 97 places in 184 ms
[2020-06-03 05:50:22] [INFO ] Deduced a trap composed of 74 places in 149 ms
[2020-06-03 05:50:22] [INFO ] Deduced a trap composed of 63 places in 180 ms
[2020-06-03 05:50:23] [INFO ] Deduced a trap composed of 28 places in 161 ms
[2020-06-03 05:50:23] [INFO ] Deduced a trap composed of 65 places in 197 ms
[2020-06-03 05:50:23] [INFO ] Deduced a trap composed of 29 places in 155 ms
[2020-06-03 05:50:23] [INFO ] Deduced a trap composed of 30 places in 144 ms
[2020-06-03 05:50:24] [INFO ] Deduced a trap composed of 62 places in 251 ms
[2020-06-03 05:50:24] [INFO ] Deduced a trap composed of 46 places in 105 ms
[2020-06-03 05:50:24] [INFO ] Deduced a trap composed of 47 places in 108 ms
[2020-06-03 05:50:24] [INFO ] Deduced a trap composed of 92 places in 190 ms
[2020-06-03 05:50:24] [INFO ] Deduced a trap composed of 81 places in 185 ms
[2020-06-03 05:50:25] [INFO ] Deduced a trap composed of 15 places in 185 ms
[2020-06-03 05:50:25] [INFO ] Deduced a trap composed of 97 places in 181 ms
[2020-06-03 05:50:25] [INFO ] Deduced a trap composed of 107 places in 171 ms
[2020-06-03 05:50:25] [INFO ] Deduced a trap composed of 61 places in 170 ms
[2020-06-03 05:50:25] [INFO ] Deduced a trap composed of 16 places in 155 ms
[2020-06-03 05:50:26] [INFO ] Deduced a trap composed of 16 places in 147 ms
[2020-06-03 05:50:26] [INFO ] Deduced a trap composed of 46 places in 120 ms
[2020-06-03 05:50:26] [INFO ] Deduced a trap composed of 45 places in 129 ms
[2020-06-03 05:50:26] [INFO ] Deduced a trap composed of 55 places in 148 ms
[2020-06-03 05:50:26] [INFO ] Deduced a trap composed of 54 places in 97 ms
[2020-06-03 05:50:27] [INFO ] Deduced a trap composed of 42 places in 299 ms
[2020-06-03 05:50:27] [INFO ] Deduced a trap composed of 60 places in 168 ms
[2020-06-03 05:50:27] [INFO ] Deduced a trap composed of 23 places in 127 ms
[2020-06-03 05:50:27] [INFO ] Deduced a trap composed of 45 places in 129 ms
[2020-06-03 05:50:27] [INFO ] Deduced a trap composed of 30 places in 170 ms
[2020-06-03 05:50:28] [INFO ] Deduced a trap composed of 23 places in 167 ms
[2020-06-03 05:50:28] [INFO ] Deduced a trap composed of 39 places in 135 ms
[2020-06-03 05:50:28] [INFO ] Deduced a trap composed of 47 places in 122 ms
[2020-06-03 05:50:28] [INFO ] Deduced a trap composed of 34 places in 162 ms
[2020-06-03 05:50:28] [INFO ] Deduced a trap composed of 35 places in 147 ms
[2020-06-03 05:50:29] [INFO ] Deduced a trap composed of 46 places in 164 ms
[2020-06-03 05:50:29] [INFO ] Deduced a trap composed of 45 places in 114 ms
[2020-06-03 05:50:29] [INFO ] Deduced a trap composed of 55 places in 124 ms
[2020-06-03 05:50:29] [INFO ] Deduced a trap composed of 15 places in 234 ms
[2020-06-03 05:50:29] [INFO ] Deduced a trap composed of 28 places in 208 ms
[2020-06-03 05:50:30] [INFO ] Deduced a trap composed of 44 places in 188 ms
[2020-06-03 05:50:30] [INFO ] Deduced a trap composed of 61 places in 189 ms
[2020-06-03 05:50:30] [INFO ] Deduced a trap composed of 28 places in 166 ms
[2020-06-03 05:50:30] [INFO ] Deduced a trap composed of 52 places in 126 ms
[2020-06-03 05:50:30] [INFO ] Deduced a trap composed of 54 places in 145 ms
[2020-06-03 05:50:31] [INFO ] Deduced a trap composed of 54 places in 127 ms
[2020-06-03 05:50:31] [INFO ] Deduced a trap composed of 20 places in 182 ms
[2020-06-03 05:50:31] [INFO ] Deduced a trap composed of 49 places in 153 ms
[2020-06-03 05:50:31] [INFO ] Deduced a trap composed of 45 places in 182 ms
[2020-06-03 05:50:32] [INFO ] Deduced a trap composed of 28 places in 170 ms
[2020-06-03 05:50:32] [INFO ] Deduced a trap composed of 35 places in 170 ms
[2020-06-03 05:50:32] [INFO ] Deduced a trap composed of 20 places in 106 ms
[2020-06-03 05:50:32] [INFO ] Deduced a trap composed of 22 places in 128 ms
[2020-06-03 05:50:32] [INFO ] Deduced a trap composed of 19 places in 118 ms
[2020-06-03 05:50:32] [INFO ] Deduced a trap composed of 26 places in 193 ms
[2020-06-03 05:50:33] [INFO ] Deduced a trap composed of 35 places in 175 ms
[2020-06-03 05:50:33] [INFO ] Deduced a trap composed of 42 places in 170 ms
[2020-06-03 05:50:33] [INFO ] Deduced a trap composed of 48 places in 161 ms
[2020-06-03 05:50:33] [INFO ] Deduced a trap composed of 38 places in 164 ms
[2020-06-03 05:50:34] [INFO ] Deduced a trap composed of 23 places in 240 ms
[2020-06-03 05:50:34] [INFO ] Deduced a trap composed of 32 places in 198 ms
[2020-06-03 05:50:34] [INFO ] Deduced a trap composed of 67 places in 195 ms
[2020-06-03 05:50:34] [INFO ] Deduced a trap composed of 14 places in 171 ms
[2020-06-03 05:50:34] [INFO ] Deduced a trap composed of 12 places in 173 ms
[2020-06-03 05:50:35] [INFO ] Deduced a trap composed of 46 places in 118 ms
[2020-06-03 05:50:35] [INFO ] Deduced a trap composed of 39 places in 231 ms
[2020-06-03 05:50:35] [INFO ] Deduced a trap composed of 44 places in 232 ms
[2020-06-03 05:50:36] [INFO ] Deduced a trap composed of 53 places in 218 ms
[2020-06-03 05:50:36] [INFO ] Deduced a trap composed of 46 places in 220 ms
[2020-06-03 05:50:36] [INFO ] Deduced a trap composed of 67 places in 232 ms
[2020-06-03 05:50:36] [INFO ] Deduced a trap composed of 19 places in 227 ms
[2020-06-03 05:50:37] [INFO ] Deduced a trap composed of 68 places in 196 ms
[2020-06-03 05:50:37] [INFO ] Deduced a trap composed of 43 places in 187 ms
[2020-06-03 05:50:37] [INFO ] Deduced a trap composed of 27 places in 190 ms
[2020-06-03 05:50:37] [INFO ] Deduced a trap composed of 35 places in 291 ms
[2020-06-03 05:50:38] [INFO ] Deduced a trap composed of 24 places in 205 ms
[2020-06-03 05:50:38] [INFO ] Deduced a trap composed of 34 places in 150 ms
[2020-06-03 05:50:38] [INFO ] Deduced a trap composed of 39 places in 192 ms
[2020-06-03 05:50:38] [INFO ] Deduced a trap composed of 71 places in 165 ms
[2020-06-03 05:50:39] [INFO ] Deduced a trap composed of 37 places in 205 ms
[2020-06-03 05:50:39] [INFO ] Deduced a trap composed of 73 places in 179 ms
[2020-06-03 05:50:39] [INFO ] Deduced a trap composed of 36 places in 198 ms
[2020-06-03 05:50:40] [INFO ] Deduced a trap composed of 72 places in 136 ms
[2020-06-03 05:50:40] [INFO ] Deduced a trap composed of 45 places in 123 ms
[2020-06-03 05:50:40] [INFO ] Deduced a trap composed of 46 places in 118 ms
[2020-06-03 05:50:40] [INFO ] Deduced a trap composed of 60 places in 172 ms
[2020-06-03 05:50:40] [INFO ] Deduced a trap composed of 18 places in 217 ms
[2020-06-03 05:50:41] [INFO ] Deduced a trap composed of 50 places in 215 ms
[2020-06-03 05:50:41] [INFO ] Deduced a trap composed of 37 places in 141 ms
[2020-06-03 05:50:41] [INFO ] Deduced a trap composed of 44 places in 155 ms
[2020-06-03 05:50:41] [INFO ] Deduced a trap composed of 72 places in 143 ms
[2020-06-03 05:50:41] [INFO ] Deduced a trap composed of 10 places in 145 ms
[2020-06-03 05:50:42] [INFO ] Deduced a trap composed of 54 places in 133 ms
[2020-06-03 05:50:42] [INFO ] Deduced a trap composed of 51 places in 130 ms
[2020-06-03 05:50:42] [INFO ] Deduced a trap composed of 53 places in 105 ms
[2020-06-03 05:50:42] [INFO ] Deduced a trap composed of 56 places in 121 ms
[2020-06-03 05:50:43] [INFO ] Deduced a trap composed of 36 places in 191 ms
[2020-06-03 05:50:43] [INFO ] Deduced a trap composed of 28 places in 192 ms
[2020-06-03 05:50:43] [INFO ] Deduced a trap composed of 29 places in 224 ms
[2020-06-03 05:50:44] [INFO ] Deduced a trap composed of 56 places in 183 ms
[2020-06-03 05:50:44] [INFO ] Deduced a trap composed of 59 places in 152 ms
[2020-06-03 05:50:44] [INFO ] Deduced a trap composed of 38 places in 173 ms
[2020-06-03 05:50:45] [INFO ] Deduced a trap composed of 77 places in 155 ms
[2020-06-03 05:50:45] [INFO ] Deduced a trap composed of 39 places in 171 ms
[2020-06-03 05:50:45] [INFO ] Deduced a trap composed of 42 places in 105 ms
[2020-06-03 05:50:46] [INFO ] Deduced a trap composed of 24 places in 194 ms
[2020-06-03 05:50:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:50:53] [INFO ] Deduced a trap composed of 2 places in 416 ms
[2020-06-03 05:50:53] [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 (> (+ s5 s18) 0)") while checking expression at index 0
Support contains 7 out of 413 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 413/413 places, 1113/1113 transitions.
Applied a total of 0 rules in 41 ms. Remains 413 /413 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1113/1113 transitions.
Starting structural reductions, iteration 0 : 413/413 places, 1113/1113 transitions.
Applied a total of 0 rules in 28 ms. Remains 413 /413 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2020-06-03 05:50:54] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 413 cols
[2020-06-03 05:50:54] [INFO ] Computed 27 place invariants in 4 ms
[2020-06-03 05:50:55] [INFO ] Implicit Places using invariants in 1289 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1301 ms to find 7 implicit places.
[2020-06-03 05:50:55] [INFO ] Redundant transitions in 76 ms returned []
[2020-06-03 05:50:55] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2020-06-03 05:50:55] [INFO ] Computed 20 place invariants in 15 ms
[2020-06-03 05:50:57] [INFO ] Dead Transitions using invariants and state equation in 1618 ms returned []
Starting structural reductions, iteration 1 : 406/413 places, 1113/1113 transitions.
Applied a total of 0 rules in 25 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2020-06-03 05:50:57] [INFO ] Redundant transitions in 97 ms returned []
[2020-06-03 05:50:57] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2020-06-03 05:50:57] [INFO ] Computed 20 place invariants in 5 ms
[2020-06-03 05:50:58] [INFO ] Dead Transitions using invariants and state equation in 1527 ms returned []
Finished structural reductions, in 2 iterations. Remains : 406/413 places, 1113/1113 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1891 ms. (steps per millisecond=528 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 547 ms. (steps per millisecond=1828 ) properties seen :[0]
Interrupted probabilistic random walk after 9031640 steps, run timeout after 30001 ms. (steps per millisecond=301 ) properties seen :[0]
Probabilistic random walk after 9031640 steps, saw 1128956 distinct states, run finished after 30001 ms. (steps per millisecond=301 ) properties seen :[0]
[2020-06-03 05:51:31] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2020-06-03 05:51:31] [INFO ] Computed 20 place invariants in 3 ms
[2020-06-03 05:51:31] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2020-06-03 05:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:51:31] [INFO ] [Real]Absence check using state equation in 687 ms returned sat
[2020-06-03 05:51:32] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 05:51:32] [INFO ] [Real]Added 366 Read/Feed constraints in 100 ms returned sat
[2020-06-03 05:51:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:51:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 22 ms returned sat
[2020-06-03 05:51:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:51:32] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2020-06-03 05:51:32] [INFO ] [Nat]Added 366 Read/Feed constraints in 61 ms returned sat
[2020-06-03 05:51:33] [INFO ] Deduced a trap composed of 24 places in 231 ms
[2020-06-03 05:51:33] [INFO ] Deduced a trap composed of 86 places in 243 ms
[2020-06-03 05:51:33] [INFO ] Deduced a trap composed of 30 places in 242 ms
[2020-06-03 05:51:33] [INFO ] Deduced a trap composed of 37 places in 230 ms
[2020-06-03 05:51:34] [INFO ] Deduced a trap composed of 46 places in 233 ms
[2020-06-03 05:51:34] [INFO ] Deduced a trap composed of 25 places in 235 ms
[2020-06-03 05:51:34] [INFO ] Deduced a trap composed of 23 places in 255 ms
[2020-06-03 05:51:35] [INFO ] Deduced a trap composed of 63 places in 259 ms
[2020-06-03 05:51:35] [INFO ] Deduced a trap composed of 76 places in 264 ms
[2020-06-03 05:51:35] [INFO ] Deduced a trap composed of 56 places in 247 ms
[2020-06-03 05:51:35] [INFO ] Deduced a trap composed of 23 places in 254 ms
[2020-06-03 05:51:36] [INFO ] Deduced a trap composed of 21 places in 252 ms
[2020-06-03 05:51:36] [INFO ] Deduced a trap composed of 24 places in 265 ms
[2020-06-03 05:51:36] [INFO ] Deduced a trap composed of 22 places in 273 ms
[2020-06-03 05:51:37] [INFO ] Deduced a trap composed of 35 places in 241 ms
[2020-06-03 05:51:37] [INFO ] Deduced a trap composed of 22 places in 220 ms
[2020-06-03 05:51:37] [INFO ] Deduced a trap composed of 22 places in 225 ms
[2020-06-03 05:51:37] [INFO ] Deduced a trap composed of 14 places in 226 ms
[2020-06-03 05:51:38] [INFO ] Deduced a trap composed of 37 places in 266 ms
[2020-06-03 05:51:38] [INFO ] Deduced a trap composed of 28 places in 241 ms
[2020-06-03 05:51:38] [INFO ] Deduced a trap composed of 27 places in 216 ms
[2020-06-03 05:51:38] [INFO ] Deduced a trap composed of 11 places in 212 ms
[2020-06-03 05:51:39] [INFO ] Deduced a trap composed of 37 places in 246 ms
[2020-06-03 05:51:39] [INFO ] Deduced a trap composed of 27 places in 235 ms
[2020-06-03 05:51:39] [INFO ] Deduced a trap composed of 14 places in 204 ms
[2020-06-03 05:51:39] [INFO ] Deduced a trap composed of 38 places in 203 ms
[2020-06-03 05:51:40] [INFO ] Deduced a trap composed of 84 places in 221 ms
[2020-06-03 05:51:40] [INFO ] Deduced a trap composed of 18 places in 253 ms
[2020-06-03 05:51:40] [INFO ] Deduced a trap composed of 40 places in 175 ms
[2020-06-03 05:51:40] [INFO ] Deduced a trap composed of 53 places in 182 ms
[2020-06-03 05:51:41] [INFO ] Deduced a trap composed of 32 places in 168 ms
[2020-06-03 05:51:41] [INFO ] Deduced a trap composed of 62 places in 280 ms
[2020-06-03 05:51:41] [INFO ] Deduced a trap composed of 15 places in 220 ms
[2020-06-03 05:51:41] [INFO ] Deduced a trap composed of 28 places in 219 ms
[2020-06-03 05:51:42] [INFO ] Deduced a trap composed of 39 places in 208 ms
[2020-06-03 05:51:42] [INFO ] Deduced a trap composed of 37 places in 229 ms
[2020-06-03 05:51:42] [INFO ] Deduced a trap composed of 12 places in 228 ms
[2020-06-03 05:51:42] [INFO ] Deduced a trap composed of 29 places in 223 ms
[2020-06-03 05:51:43] [INFO ] Deduced a trap composed of 30 places in 194 ms
[2020-06-03 05:51:43] [INFO ] Deduced a trap composed of 21 places in 302 ms
[2020-06-03 05:51:43] [INFO ] Deduced a trap composed of 50 places in 251 ms
[2020-06-03 05:51:44] [INFO ] Deduced a trap composed of 11 places in 267 ms
[2020-06-03 05:51:44] [INFO ] Deduced a trap composed of 10 places in 258 ms
[2020-06-03 05:51:44] [INFO ] Deduced a trap composed of 33 places in 265 ms
[2020-06-03 05:51:44] [INFO ] Deduced a trap composed of 44 places in 250 ms
[2020-06-03 05:51:45] [INFO ] Deduced a trap composed of 35 places in 238 ms
[2020-06-03 05:51:45] [INFO ] Deduced a trap composed of 36 places in 251 ms
[2020-06-03 05:51:45] [INFO ] Deduced a trap composed of 28 places in 206 ms
[2020-06-03 05:51:46] [INFO ] Deduced a trap composed of 34 places in 232 ms
[2020-06-03 05:51:46] [INFO ] Deduced a trap composed of 21 places in 233 ms
[2020-06-03 05:51:46] [INFO ] Deduced a trap composed of 38 places in 319 ms
[2020-06-03 05:51:46] [INFO ] Deduced a trap composed of 11 places in 232 ms
[2020-06-03 05:51:47] [INFO ] Deduced a trap composed of 11 places in 193 ms
[2020-06-03 05:51:47] [INFO ] Deduced a trap composed of 23 places in 241 ms
[2020-06-03 05:51:47] [INFO ] Deduced a trap composed of 24 places in 232 ms
[2020-06-03 05:51:48] [INFO ] Deduced a trap composed of 65 places in 204 ms
[2020-06-03 05:51:48] [INFO ] Deduced a trap composed of 39 places in 187 ms
[2020-06-03 05:51:48] [INFO ] Deduced a trap composed of 51 places in 219 ms
[2020-06-03 05:51:48] [INFO ] Deduced a trap composed of 35 places in 205 ms
[2020-06-03 05:51:48] [INFO ] Deduced a trap composed of 54 places in 141 ms
[2020-06-03 05:51:49] [INFO ] Deduced a trap composed of 43 places in 151 ms
[2020-06-03 05:51:49] [INFO ] Deduced a trap composed of 47 places in 169 ms
[2020-06-03 05:51:49] [INFO ] Deduced a trap composed of 30 places in 159 ms
[2020-06-03 05:51:49] [INFO ] Deduced a trap composed of 48 places in 165 ms
[2020-06-03 05:51:49] [INFO ] Deduced a trap composed of 80 places in 159 ms
[2020-06-03 05:51:50] [INFO ] Deduced a trap composed of 46 places in 157 ms
[2020-06-03 05:51:50] [INFO ] Deduced a trap composed of 47 places in 162 ms
[2020-06-03 05:51:50] [INFO ] Deduced a trap composed of 36 places in 156 ms
[2020-06-03 05:51:50] [INFO ] Deduced a trap composed of 20 places in 217 ms
[2020-06-03 05:51:51] [INFO ] Deduced a trap composed of 18 places in 223 ms
[2020-06-03 05:51:51] [INFO ] Deduced a trap composed of 26 places in 195 ms
[2020-06-03 05:51:51] [INFO ] Deduced a trap composed of 18 places in 173 ms
[2020-06-03 05:51:51] [INFO ] Deduced a trap composed of 35 places in 181 ms
[2020-06-03 05:51:51] [INFO ] Deduced a trap composed of 47 places in 203 ms
[2020-06-03 05:51:52] [INFO ] Deduced a trap composed of 30 places in 229 ms
[2020-06-03 05:51:52] [INFO ] Deduced a trap composed of 27 places in 229 ms
[2020-06-03 05:51:52] [INFO ] Deduced a trap composed of 39 places in 220 ms
[2020-06-03 05:51:52] [INFO ] Deduced a trap composed of 43 places in 232 ms
[2020-06-03 05:51:53] [INFO ] Deduced a trap composed of 30 places in 210 ms
[2020-06-03 05:51:53] [INFO ] Deduced a trap composed of 63 places in 259 ms
[2020-06-03 05:51:53] [INFO ] Deduced a trap composed of 31 places in 223 ms
[2020-06-03 05:51:54] [INFO ] Deduced a trap composed of 24 places in 284 ms
[2020-06-03 05:51:54] [INFO ] Deduced a trap composed of 55 places in 213 ms
[2020-06-03 05:51:54] [INFO ] Deduced a trap composed of 21 places in 230 ms
[2020-06-03 05:51:54] [INFO ] Deduced a trap composed of 67 places in 193 ms
[2020-06-03 05:51:55] [INFO ] Deduced a trap composed of 36 places in 209 ms
[2020-06-03 05:51:55] [INFO ] Deduced a trap composed of 38 places in 190 ms
[2020-06-03 05:51:55] [INFO ] Deduced a trap composed of 55 places in 176 ms
[2020-06-03 05:51:55] [INFO ] Deduced a trap composed of 55 places in 176 ms
[2020-06-03 05:51:55] [INFO ] Deduced a trap composed of 11 places in 169 ms
[2020-06-03 05:51:56] [INFO ] Deduced a trap composed of 54 places in 151 ms
[2020-06-03 05:51:56] [INFO ] Deduced a trap composed of 10 places in 134 ms
[2020-06-03 05:51:56] [INFO ] Deduced a trap composed of 35 places in 156 ms
[2020-06-03 05:51:56] [INFO ] Deduced a trap composed of 54 places in 102 ms
[2020-06-03 05:51:56] [INFO ] Deduced a trap composed of 33 places in 194 ms
[2020-06-03 05:51:57] [INFO ] Deduced a trap composed of 32 places in 178 ms
[2020-06-03 05:51:57] [INFO ] Deduced a trap composed of 36 places in 190 ms
[2020-06-03 05:51:57] [INFO ] Deduced a trap composed of 54 places in 107 ms
[2020-06-03 05:51:57] [INFO ] Deduced a trap composed of 51 places in 125 ms
[2020-06-03 05:51:57] [INFO ] Deduced a trap composed of 53 places in 95 ms
[2020-06-03 05:51:58] [INFO ] Deduced a trap composed of 57 places in 141 ms
[2020-06-03 05:51:58] [INFO ] Deduced a trap composed of 43 places in 128 ms
[2020-06-03 05:51:58] [INFO ] Deduced a trap composed of 47 places in 101 ms
[2020-06-03 05:51:58] [INFO ] Deduced a trap composed of 49 places in 187 ms
[2020-06-03 05:51:58] [INFO ] Deduced a trap composed of 43 places in 140 ms
[2020-06-03 05:51:58] [INFO ] Deduced a trap composed of 56 places in 121 ms
[2020-06-03 05:51:59] [INFO ] Deduced a trap composed of 49 places in 215 ms
[2020-06-03 05:51:59] [INFO ] Deduced a trap composed of 18 places in 191 ms
[2020-06-03 05:51:59] [INFO ] Deduced a trap composed of 50 places in 128 ms
[2020-06-03 05:51:59] [INFO ] Deduced a trap composed of 57 places in 204 ms
[2020-06-03 05:52:00] [INFO ] Deduced a trap composed of 18 places in 183 ms
[2020-06-03 05:52:00] [INFO ] Deduced a trap composed of 42 places in 161 ms
[2020-06-03 05:52:00] [INFO ] Deduced a trap composed of 50 places in 160 ms
[2020-06-03 05:52:00] [INFO ] Deduced a trap composed of 31 places in 239 ms
[2020-06-03 05:52:01] [INFO ] Deduced a trap composed of 38 places in 193 ms
[2020-06-03 05:52:01] [INFO ] Deduced a trap composed of 36 places in 230 ms
[2020-06-03 05:52:01] [INFO ] Deduced a trap composed of 23 places in 218 ms
[2020-06-03 05:52:01] [INFO ] Deduced a trap composed of 22 places in 193 ms
[2020-06-03 05:52:02] [INFO ] Deduced a trap composed of 39 places in 281 ms
[2020-06-03 05:52:02] [INFO ] Deduced a trap composed of 28 places in 214 ms
[2020-06-03 05:52:02] [INFO ] Deduced a trap composed of 30 places in 229 ms
[2020-06-03 05:52:03] [INFO ] Deduced a trap composed of 38 places in 210 ms
[2020-06-03 05:52:03] [INFO ] Deduced a trap composed of 18 places in 223 ms
[2020-06-03 05:52:03] [INFO ] Deduced a trap composed of 75 places in 197 ms
[2020-06-03 05:52:03] [INFO ] Deduced a trap composed of 37 places in 194 ms
[2020-06-03 05:52:04] [INFO ] Deduced a trap composed of 12 places in 279 ms
[2020-06-03 05:52:04] [INFO ] Deduced a trap composed of 26 places in 212 ms
[2020-06-03 05:52:04] [INFO ] Deduced a trap composed of 59 places in 181 ms
[2020-06-03 05:52:04] [INFO ] Deduced a trap composed of 26 places in 193 ms
[2020-06-03 05:52:05] [INFO ] Deduced a trap composed of 22 places in 227 ms
[2020-06-03 05:52:06] [INFO ] Deduced a trap composed of 75 places in 188 ms
[2020-06-03 05:52:06] [INFO ] Deduced a trap composed of 39 places in 157 ms
[2020-06-03 05:52:06] [INFO ] Deduced a trap composed of 39 places in 146 ms
[2020-06-03 05:52:07] [INFO ] Deduced a trap composed of 61 places in 141 ms
[2020-06-03 05:52:07] [INFO ] Deduced a trap composed of 57 places in 216 ms
[2020-06-03 05:52:07] [INFO ] Deduced a trap composed of 54 places in 161 ms
[2020-06-03 05:52:07] [INFO ] Deduced a trap composed of 53 places in 200 ms
[2020-06-03 05:52:07] [INFO ] Deduced a trap composed of 75 places in 144 ms
[2020-06-03 05:52:08] [INFO ] Deduced a trap composed of 40 places in 171 ms
[2020-06-03 05:52:08] [INFO ] Deduced a trap composed of 45 places in 220 ms
[2020-06-03 05:52:08] [INFO ] Deduced a trap composed of 31 places in 189 ms
[2020-06-03 05:52:09] [INFO ] Deduced a trap composed of 48 places in 253 ms
[2020-06-03 05:52:09] [INFO ] Deduced a trap composed of 72 places in 219 ms
[2020-06-03 05:52:10] [INFO ] Deduced a trap composed of 22 places in 212 ms
[2020-06-03 05:52:10] [INFO ] Deduced a trap composed of 15 places in 185 ms
[2020-06-03 05:52:10] [INFO ] Deduced a trap composed of 26 places in 179 ms
[2020-06-03 05:52:10] [INFO ] Deduced a trap composed of 50 places in 172 ms
[2020-06-03 05:52:10] [INFO ] Deduced a trap composed of 55 places in 102 ms
[2020-06-03 05:52:10] [INFO ] Deduced a trap composed of 50 places in 111 ms
[2020-06-03 05:52:11] [INFO ] Deduced a trap composed of 50 places in 134 ms
[2020-06-03 05:52:11] [INFO ] Deduced a trap composed of 55 places in 143 ms
[2020-06-03 05:52:11] [INFO ] Deduced a trap composed of 62 places in 173 ms
[2020-06-03 05:52:11] [INFO ] Deduced a trap composed of 39 places in 182 ms
[2020-06-03 05:52:12] [INFO ] Deduced a trap composed of 47 places in 164 ms
[2020-06-03 05:52:12] [INFO ] Deduced a trap composed of 61 places in 159 ms
[2020-06-03 05:52:12] [INFO ] Deduced a trap composed of 37 places in 172 ms
[2020-06-03 05:52:12] [INFO ] Deduced a trap composed of 60 places in 178 ms
[2020-06-03 05:52:13] [INFO ] Deduced a trap composed of 37 places in 181 ms
[2020-06-03 05:52:13] [INFO ] Deduced a trap composed of 53 places in 170 ms
[2020-06-03 05:52:13] [INFO ] Deduced a trap composed of 46 places in 151 ms
[2020-06-03 05:52:13] [INFO ] Deduced a trap composed of 52 places in 138 ms
[2020-06-03 05:52:13] [INFO ] Deduced a trap composed of 55 places in 123 ms
[2020-06-03 05:52:14] [INFO ] Deduced a trap composed of 55 places in 135 ms
[2020-06-03 05:52:14] [INFO ] Deduced a trap composed of 50 places in 113 ms
[2020-06-03 05:52:14] [INFO ] Deduced a trap composed of 53 places in 143 ms
[2020-06-03 05:52:14] [INFO ] Deduced a trap composed of 51 places in 108 ms
[2020-06-03 05:52:14] [INFO ] Deduced a trap composed of 12 places in 205 ms
[2020-06-03 05:52:15] [INFO ] Deduced a trap composed of 20 places in 155 ms
[2020-06-03 05:52:15] [INFO ] Deduced a trap composed of 23 places in 188 ms
[2020-06-03 05:52:15] [INFO ] Deduced a trap composed of 31 places in 193 ms
[2020-06-03 05:52:15] [INFO ] Deduced a trap composed of 27 places in 175 ms
[2020-06-03 05:52:16] [INFO ] Deduced a trap composed of 53 places in 156 ms
[2020-06-03 05:52:16] [INFO ] Deduced a trap composed of 27 places in 176 ms
[2020-06-03 05:52:16] [INFO ] Deduced a trap composed of 43 places in 158 ms
[2020-06-03 05:52:16] [INFO ] Deduced a trap composed of 27 places in 97 ms
[2020-06-03 05:52:16] [INFO ] Deduced a trap composed of 65 places in 177 ms
[2020-06-03 05:52:17] [INFO ] Deduced a trap composed of 51 places in 120 ms
[2020-06-03 05:52:17] [INFO ] Deduced a trap composed of 52 places in 135 ms
[2020-06-03 05:52:17] [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 (> (+ s4 s16 s56 s57 s58 s59 s60 s61 s75 s76 s77 s78 s79 s104 s117 s118 s119 s120 s121 s146 s159 s160 s161 s162 s163 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s401 s402) 0)") while checking expression at index 0
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 19 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 31 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2020-06-03 05:52:17] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2020-06-03 05:52:17] [INFO ] Computed 20 place invariants in 2 ms
[2020-06-03 05:52:18] [INFO ] Implicit Places using invariants in 778 ms returned []
[2020-06-03 05:52:18] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2020-06-03 05:52:18] [INFO ] Computed 20 place invariants in 3 ms
[2020-06-03 05:52:18] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 05:52:23] [INFO ] Implicit Places using invariants and state equation in 5577 ms returned []
Implicit Place search using SMT with State Equation took 6358 ms to find 0 implicit places.
[2020-06-03 05:52:23] [INFO ] Redundant transitions in 19 ms returned []
[2020-06-03 05:52:23] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2020-06-03 05:52:23] [INFO ] Computed 20 place invariants in 5 ms
[2020-06-03 05:52:25] [INFO ] Dead Transitions using invariants and state equation in 1370 ms returned []
Finished structural reductions, in 1 iterations. Remains : 406/406 places, 1113/1113 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 202 ms. (steps per millisecond=495 ) properties seen :[0]
[2020-06-03 05:52:25] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2020-06-03 05:52:25] [INFO ] Computed 20 place invariants in 2 ms
[2020-06-03 05:52:25] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2020-06-03 05:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:52:26] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2020-06-03 05:52:26] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 05:52:26] [INFO ] [Real]Added 366 Read/Feed constraints in 76 ms returned sat
[2020-06-03 05:52:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:52:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 35 ms returned sat
[2020-06-03 05:52:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:52:27] [INFO ] [Nat]Absence check using state equation in 872 ms returned sat
[2020-06-03 05:52:27] [INFO ] [Nat]Added 366 Read/Feed constraints in 73 ms returned sat
[2020-06-03 05:52:27] [INFO ] Deduced a trap composed of 24 places in 249 ms
[2020-06-03 05:52:27] [INFO ] Deduced a trap composed of 86 places in 223 ms
[2020-06-03 05:52:27] [INFO ] Deduced a trap composed of 30 places in 229 ms
[2020-06-03 05:52:28] [INFO ] Deduced a trap composed of 37 places in 214 ms
[2020-06-03 05:52:28] [INFO ] Deduced a trap composed of 46 places in 248 ms
[2020-06-03 05:52:28] [INFO ] Deduced a trap composed of 25 places in 211 ms
[2020-06-03 05:52:28] [INFO ] Deduced a trap composed of 23 places in 231 ms
[2020-06-03 05:52:29] [INFO ] Deduced a trap composed of 63 places in 238 ms
[2020-06-03 05:52:29] [INFO ] Deduced a trap composed of 76 places in 214 ms
[2020-06-03 05:52:29] [INFO ] Deduced a trap composed of 56 places in 230 ms
[2020-06-03 05:52:30] [INFO ] Deduced a trap composed of 23 places in 216 ms
[2020-06-03 05:52:30] [INFO ] Deduced a trap composed of 21 places in 213 ms
[2020-06-03 05:52:30] [INFO ] Deduced a trap composed of 24 places in 227 ms
[2020-06-03 05:52:30] [INFO ] Deduced a trap composed of 22 places in 215 ms
[2020-06-03 05:52:30] [INFO ] Deduced a trap composed of 35 places in 211 ms
[2020-06-03 05:52:31] [INFO ] Deduced a trap composed of 22 places in 232 ms
[2020-06-03 05:52:31] [INFO ] Deduced a trap composed of 22 places in 226 ms
[2020-06-03 05:52:31] [INFO ] Deduced a trap composed of 14 places in 230 ms
[2020-06-03 05:52:31] [INFO ] Deduced a trap composed of 37 places in 214 ms
[2020-06-03 05:52:32] [INFO ] Deduced a trap composed of 28 places in 220 ms
[2020-06-03 05:52:32] [INFO ] Deduced a trap composed of 27 places in 264 ms
[2020-06-03 05:52:32] [INFO ] Deduced a trap composed of 11 places in 251 ms
[2020-06-03 05:52:33] [INFO ] Deduced a trap composed of 37 places in 222 ms
[2020-06-03 05:52:33] [INFO ] Deduced a trap composed of 27 places in 226 ms
[2020-06-03 05:52:33] [INFO ] Deduced a trap composed of 14 places in 233 ms
[2020-06-03 05:52:33] [INFO ] Deduced a trap composed of 38 places in 242 ms
[2020-06-03 05:52:34] [INFO ] Deduced a trap composed of 84 places in 209 ms
[2020-06-03 05:52:34] [INFO ] Deduced a trap composed of 18 places in 200 ms
[2020-06-03 05:52:34] [INFO ] Deduced a trap composed of 40 places in 230 ms
[2020-06-03 05:52:34] [INFO ] Deduced a trap composed of 53 places in 215 ms
[2020-06-03 05:52:35] [INFO ] Deduced a trap composed of 32 places in 188 ms
[2020-06-03 05:52:35] [INFO ] Deduced a trap composed of 62 places in 225 ms
[2020-06-03 05:52:35] [INFO ] Deduced a trap composed of 15 places in 233 ms
[2020-06-03 05:52:35] [INFO ] Deduced a trap composed of 28 places in 209 ms
[2020-06-03 05:52:36] [INFO ] Deduced a trap composed of 39 places in 210 ms
[2020-06-03 05:52:36] [INFO ] Deduced a trap composed of 37 places in 213 ms
[2020-06-03 05:52:36] [INFO ] Deduced a trap composed of 12 places in 228 ms
[2020-06-03 05:52:36] [INFO ] Deduced a trap composed of 29 places in 240 ms
[2020-06-03 05:52:37] [INFO ] Deduced a trap composed of 30 places in 197 ms
[2020-06-03 05:52:37] [INFO ] Deduced a trap composed of 21 places in 236 ms
[2020-06-03 05:52:37] [INFO ] Deduced a trap composed of 50 places in 267 ms
[2020-06-03 05:52:37] [INFO ] Deduced a trap composed of 11 places in 249 ms
[2020-06-03 05:52:38] [INFO ] Deduced a trap composed of 10 places in 281 ms
[2020-06-03 05:52:38] [INFO ] Deduced a trap composed of 33 places in 223 ms
[2020-06-03 05:52:38] [INFO ] Deduced a trap composed of 44 places in 188 ms
[2020-06-03 05:52:38] [INFO ] Deduced a trap composed of 35 places in 222 ms
[2020-06-03 05:52:39] [INFO ] Deduced a trap composed of 36 places in 198 ms
[2020-06-03 05:52:39] [INFO ] Deduced a trap composed of 28 places in 197 ms
[2020-06-03 05:52:39] [INFO ] Deduced a trap composed of 34 places in 241 ms
[2020-06-03 05:52:39] [INFO ] Deduced a trap composed of 21 places in 238 ms
[2020-06-03 05:52:40] [INFO ] Deduced a trap composed of 38 places in 205 ms
[2020-06-03 05:52:40] [INFO ] Deduced a trap composed of 11 places in 159 ms
[2020-06-03 05:52:40] [INFO ] Deduced a trap composed of 11 places in 144 ms
[2020-06-03 05:52:40] [INFO ] Deduced a trap composed of 23 places in 221 ms
[2020-06-03 05:52:41] [INFO ] Deduced a trap composed of 24 places in 208 ms
[2020-06-03 05:52:41] [INFO ] Deduced a trap composed of 65 places in 215 ms
[2020-06-03 05:52:41] [INFO ] Deduced a trap composed of 39 places in 199 ms
[2020-06-03 05:52:41] [INFO ] Deduced a trap composed of 51 places in 225 ms
[2020-06-03 05:52:42] [INFO ] Deduced a trap composed of 35 places in 189 ms
[2020-06-03 05:52:42] [INFO ] Deduced a trap composed of 54 places in 164 ms
[2020-06-03 05:52:42] [INFO ] Deduced a trap composed of 43 places in 141 ms
[2020-06-03 05:52:42] [INFO ] Deduced a trap composed of 47 places in 169 ms
[2020-06-03 05:52:42] [INFO ] Deduced a trap composed of 30 places in 180 ms
[2020-06-03 05:52:43] [INFO ] Deduced a trap composed of 48 places in 165 ms
[2020-06-03 05:52:43] [INFO ] Deduced a trap composed of 80 places in 187 ms
[2020-06-03 05:52:43] [INFO ] Deduced a trap composed of 46 places in 184 ms
[2020-06-03 05:52:43] [INFO ] Deduced a trap composed of 47 places in 178 ms
[2020-06-03 05:52:43] [INFO ] Deduced a trap composed of 36 places in 191 ms
[2020-06-03 05:52:44] [INFO ] Deduced a trap composed of 20 places in 234 ms
[2020-06-03 05:52:44] [INFO ] Deduced a trap composed of 18 places in 214 ms
[2020-06-03 05:52:44] [INFO ] Deduced a trap composed of 26 places in 210 ms
[2020-06-03 05:52:44] [INFO ] Deduced a trap composed of 18 places in 174 ms
[2020-06-03 05:52:45] [INFO ] Deduced a trap composed of 35 places in 243 ms
[2020-06-03 05:52:45] [INFO ] Deduced a trap composed of 47 places in 202 ms
[2020-06-03 05:52:45] [INFO ] Deduced a trap composed of 30 places in 208 ms
[2020-06-03 05:52:45] [INFO ] Deduced a trap composed of 27 places in 188 ms
[2020-06-03 05:52:46] [INFO ] Deduced a trap composed of 39 places in 166 ms
[2020-06-03 05:52:46] [INFO ] Deduced a trap composed of 43 places in 235 ms
[2020-06-03 05:52:46] [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 (> (+ s10 s19 s29 s30 s31 s32 s33 s34 s42 s43 s44 s46 s47 s48 s64 s84 s93 s95 s106 s126 s135 s137 s177 s178 s179 s201 s202 s203 s204 s301 s302 s303 s304 s346 s347 s348 s349 s350 s356 s357 s358 s359 s360) 0)") while checking expression at index 0
Graph (trivial) has 840 edges and 406 vertex of which 294 / 406 are part of one of the 42 SCC in 6 ms
Free SCC test removed 252 places
Drop transitions removed 504 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 756 transitions.
Iterating post reduction 0 with 756 rules applied. Total rules applied 757 place count 154 transition count 357
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 757 place count 154 transition count 315
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 84 rules applied. Total rules applied 841 place count 112 transition count 315
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 862 place count 98 transition count 308
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 869 place count 98 transition count 308
Applied a total of 869 rules in 33 ms. Remains 98 /406 variables (removed 308) and now considering 308/1113 (removed 805) transitions.
// Phase 1: matrix 308 rows 98 cols
[2020-06-03 05:52:46] [INFO ] Computed 13 place invariants in 1 ms
[2020-06-03 05:52:46] [INFO ] [Real]Absence check using 13 positive place invariants in 104 ms returned sat
[2020-06-03 05:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:52:46] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2020-06-03 05:52:46] [INFO ] Computed and/alt/rep : 295/3067/295 causal constraints in 29 ms.
[2020-06-03 05:52:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:52:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 21 ms returned sat
[2020-06-03 05:52:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:52:47] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2020-06-03 05:52:47] [INFO ] Computed and/alt/rep : 295/3067/295 causal constraints in 20 ms.
[2020-06-03 05:52:49] [INFO ] Added : 289 causal constraints over 58 iterations in 2908 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 47 ms.
[2020-06-03 05:52:50] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2020-06-03 05:52:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 23 ms.
[2020-06-03 05:52:50] [INFO ] Flatten gal took : 376 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ Peterson-COL-6 @ 3570 seconds
vrfy: finished
info: timeLeft: 3568
rslt: Output for ReachabilityCardinality @ Peterson-COL-6
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 05:52:51 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 22156,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F ((2 <= p189 + p190 + p191 + p192 + p193 + p194 + p195)))",
"processed_size": 61,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 4424,
"conflict_clusters": 20,
"places": 406,
"places_significant": 386,
"singleton_clusters": 0,
"transitions": 1113
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1519/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 406
lola: finding significant places
lola: 406 places, 1113 transitions, 386 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: E (F ((2 <= p189 + p190 + p191 + p192 + p193 + p194 + p195)))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((2 <= p189 + p190 + p191 + p192 + p193 + p194 + p195)))
lola: processed formula length: 61
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p189 + p190 + p191 + p192 + p193 + p194 + p195)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: local time limit reached - aborting
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 22156 KB
lola: time consumption: 2 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
sara: try reading problem file ReachabilityCardinality-0.sara.
rslt: finished
--------------------
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="Peterson-COL-6"
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 Peterson-COL-6, 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 r174-csrt-158987853600694"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-6.tgz
mv Peterson-COL-6 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 ;