About the Execution of ITS-Tools for PolyORBLF-PT-S02J04T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15738.380 | 3600000.00 | 10023188.00 | 11083.50 | FFFFFF??FTTTFTFF | 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.r126-tajo-158961390300430.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 itstools
Input is PolyORBLF-PT-S02J04T10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390300430
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 8.3K Apr 12 05:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 12 05:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 11 04:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 04:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.0K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 10 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 10 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 9 17:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 9 17:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Apr 10 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 PolyORBLF-PT-S02J04T10-ReachabilityCardinality-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1589817299136
[2020-05-18 15:55:01] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 15:55:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 15:55:01] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2020-05-18 15:55:01] [INFO ] Transformed 752 places.
[2020-05-18 15:55:01] [INFO ] Transformed 1572 transitions.
[2020-05-18 15:55:01] [INFO ] Parsed PT model containing 752 places and 1572 transitions in 298 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 100 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 165 ms. (steps per millisecond=60 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1]
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 61 ms. (steps per millisecond=163 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 65 ms. (steps per millisecond=153 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 57 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-05-18 15:55:02] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2020-05-18 15:55:02] [INFO ] Computed 54 place invariants in 78 ms
[2020-05-18 15:55:02] [INFO ] [Real]Absence check using 15 positive place invariants in 196 ms returned sat
[2020-05-18 15:55:03] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 248 ms returned sat
[2020-05-18 15:55:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:55:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 15:55:07] [INFO ] [Real]Absence check using state equation in 4190 ms returned (error "Failed to check-sat")
[2020-05-18 15:55:07] [INFO ] [Real]Absence check using 15 positive place invariants in 52 ms returned sat
[2020-05-18 15:55:07] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 82 ms returned unsat
[2020-05-18 15:55:07] [INFO ] [Real]Absence check using 15 positive place invariants in 37 ms returned unsat
[2020-05-18 15:55:08] [INFO ] [Real]Absence check using 15 positive place invariants in 39 ms returned unsat
[2020-05-18 15:55:08] [INFO ] [Real]Absence check using 15 positive place invariants in 49 ms returned sat
[2020-05-18 15:55:08] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 57 ms returned sat
[2020-05-18 15:55:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:55:11] [INFO ] [Real]Absence check using state equation in 3249 ms returned sat
[2020-05-18 15:55:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:55:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 64 ms returned sat
[2020-05-18 15:55:12] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 58 ms returned sat
[2020-05-18 15:55:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:55:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 15:55:16] [INFO ] [Nat]Absence check using state equation in 4703 ms returned (error "Failed to check-sat")
[2020-05-18 15:55:16] [INFO ] [Real]Absence check using 15 positive place invariants in 26 ms returned sat
[2020-05-18 15:55:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 54 ms returned sat
[2020-05-18 15:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:55:19] [INFO ] [Real]Absence check using state equation in 3001 ms returned sat
[2020-05-18 15:55:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:55:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 30 ms returned sat
[2020-05-18 15:55:20] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 59 ms returned sat
[2020-05-18 15:55:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:55:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 15:55:25] [INFO ] [Nat]Absence check using state equation in 4794 ms returned (error "Failed to check-sat")
[2020-05-18 15:55:25] [INFO ] [Real]Absence check using 15 positive place invariants in 20 ms returned sat
[2020-05-18 15:55:25] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 40 ms returned sat
[2020-05-18 15:55:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:55:28] [INFO ] [Real]Absence check using state equation in 3013 ms returned sat
[2020-05-18 15:55:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:55:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 20 ms returned sat
[2020-05-18 15:55:28] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 41 ms returned sat
[2020-05-18 15:55:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:55:33] [INFO ] [Nat]Absence check using state equation in 4861 ms returned (error "Solver has unexpectedly terminated")
[2020-05-18 15:55:33] [INFO ] [Real]Absence check using 15 positive place invariants in 29 ms returned sat
[2020-05-18 15:55:33] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 59 ms returned sat
[2020-05-18 15:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:55:37] [INFO ] [Real]Absence check using state equation in 4145 ms returned sat
[2020-05-18 15:55:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:55:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 30 ms returned sat
[2020-05-18 15:55:37] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 38 ms returned sat
[2020-05-18 15:55:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:55:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 15:55:42] [INFO ] [Nat]Absence check using state equation in 4855 ms returned (error "Failed to check-sat")
[2020-05-18 15:55:42] [INFO ] [Real]Absence check using 15 positive place invariants in 27 ms returned sat
[2020-05-18 15:55:42] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 49 ms returned unsat
[2020-05-18 15:55:42] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned sat
[2020-05-18 15:55:42] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 25 ms returned unsat
[2020-05-18 15:55:42] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2020-05-18 15:55:42] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 24 ms returned unsat
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 216 out of 752 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 750 transition count 1352
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 690 transition count 1352
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 122 place count 690 transition count 1292
Deduced a syphon composed of 60 places in 11 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 242 place count 630 transition count 1292
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 8 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 282 place count 610 transition count 1272
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 302 place count 610 transition count 1252
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 322 place count 590 transition count 1252
Applied a total of 322 rules in 278 ms. Remains 590 /752 variables (removed 162) and now considering 1252/1412 (removed 160) transitions.
[2020-05-18 15:55:43] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
// Phase 1: matrix 1232 rows 590 cols
[2020-05-18 15:55:43] [INFO ] Computed 52 place invariants in 39 ms
[2020-05-18 15:55:47] [INFO ] Dead Transitions using invariants and state equation in 4247 ms returned [2, 43, 69, 73, 78, 95, 108, 118, 153, 161, 174, 197, 206, 220, 237, 249, 257, 282, 314, 346, 359, 366, 371, 376, 394, 403, 408, 417, 420, 432, 444, 447, 448, 450, 451, 479, 494, 507, 528, 556, 566, 572, 578, 588, 594, 598, 599, 605, 614, 615, 629, 638, 646, 648, 653, 671, 672, 676, 688, 689, 691, 693, 705, 709, 721, 723, 724, 730, 735, 741, 766, 768, 785, 798, 799, 800, 802, 803, 805, 808, 809, 810, 811, 820, 829, 832, 834, 835, 846, 860, 880, 881, 882, 886, 888, 889, 895, 896, 902, 909, 910, 912, 919, 921, 922, 925, 932, 934, 940, 941]
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions :[941, 940, 934, 932, 925, 922, 921, 919, 912, 910, 909, 902, 896, 895, 889, 888, 886, 882, 881, 880, 860, 846, 835, 834, 832, 829, 820, 811, 810, 809, 808, 805, 803, 802, 800, 799, 798, 785, 768, 766, 741, 735, 730, 724, 723, 721, 709, 705, 693, 691, 689, 688, 676, 672, 671, 653, 648, 646, 638, 629, 615, 614, 605, 599, 598, 594, 588, 578, 572, 566, 556, 528, 507, 494, 479, 451, 450, 448, 447, 444, 432, 420, 417, 408, 403, 394, 376, 371, 366, 359, 346, 314, 282, 257, 249, 237, 220, 206, 197, 174, 161, 153, 118, 108, 95, 78, 73, 69, 43, 2]
Starting structural reductions, iteration 1 : 590/752 places, 1142/1412 transitions.
Reduce places removed 0 places and 20 transitions.
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 0 places and 20 transitions.
Applied a total of 0 rules in 69 ms. Remains 590 /590 variables (removed 0) and now considering 1102/1142 (removed 40) transitions.
Finished structural reductions, in 2 iterations. Remains : 590/752 places, 1102/1412 transitions.
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Incomplete random walk after 1000000 steps, including 252 resets, run finished after 7566 ms. (steps per millisecond=132 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3951 ms. (steps per millisecond=253 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 120 resets, run finished after 3145 ms. (steps per millisecond=317 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 119 resets, run finished after 3416 ms. (steps per millisecond=292 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 238 resets, run finished after 4450 ms. (steps per millisecond=224 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 268 resets, run finished after 3239 ms. (steps per millisecond=308 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 1653474 steps, run timeout after 30001 ms. (steps per millisecond=55 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 1653474 steps, saw 620881 distinct states, run finished after 30001 ms. (steps per millisecond=55 ) properties seen :[0, 0, 0, 0, 0]
[2020-05-18 15:56:43] [INFO ] Flow matrix only has 1082 transitions (discarded 20 similar events)
// Phase 1: matrix 1082 rows 568 cols
[2020-05-18 15:56:43] [INFO ] Computed 52 place invariants in 17 ms
[2020-05-18 15:56:43] [INFO ] [Real]Absence check using 14 positive place invariants in 28 ms returned sat
[2020-05-18 15:56:43] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 43 ms returned unsat
[2020-05-18 15:56:43] [INFO ] [Real]Absence check using 14 positive place invariants in 46 ms returned sat
[2020-05-18 15:56:43] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 87 ms returned unsat
[2020-05-18 15:56:43] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-18 15:56:43] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 51 ms returned unsat
[2020-05-18 15:56:43] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2020-05-18 15:56:43] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 58 ms returned sat
[2020-05-18 15:56:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:56:46] [INFO ] [Real]Absence check using state equation in 2081 ms returned sat
[2020-05-18 15:56:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:56:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 26 ms returned sat
[2020-05-18 15:56:46] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 58 ms returned sat
[2020-05-18 15:56:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:56:48] [INFO ] [Nat]Absence check using state equation in 2141 ms returned sat
[2020-05-18 15:56:48] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-05-18 15:56:48] [INFO ] [Nat]Added 130 Read/Feed constraints in 565 ms returned sat
[2020-05-18 15:56:49] [INFO ] Deduced a trap composed of 47 places in 512 ms
[2020-05-18 15:56:50] [INFO ] Deduced a trap composed of 47 places in 547 ms
[2020-05-18 15:56:50] [INFO ] Deduced a trap composed of 47 places in 409 ms
[2020-05-18 15:56:51] [INFO ] Deduced a trap composed of 47 places in 403 ms
[2020-05-18 15:56:51] [INFO ] Deduced a trap composed of 47 places in 283 ms
[2020-05-18 15:56:51] [INFO ] Deduced a trap composed of 48 places in 277 ms
[2020-05-18 15:56:51] [INFO ] Deduced a trap composed of 47 places in 288 ms
[2020-05-18 15:56:52] [INFO ] Deduced a trap composed of 47 places in 305 ms
[2020-05-18 15:56:52] [INFO ] Deduced a trap composed of 286 places in 283 ms
[2020-05-18 15:56:52] [INFO ] Deduced a trap composed of 257 places in 323 ms
[2020-05-18 15:56:53] [INFO ] Deduced a trap composed of 284 places in 310 ms
[2020-05-18 15:56:53] [INFO ] Deduced a trap composed of 261 places in 276 ms
[2020-05-18 15:56:54] [INFO ] Deduced a trap composed of 47 places in 303 ms
[2020-05-18 15:56:54] [INFO ] Deduced a trap composed of 244 places in 318 ms
[2020-05-18 15:56:54] [INFO ] Deduced a trap composed of 62 places in 300 ms
[2020-05-18 15:56:55] [INFO ] Deduced a trap composed of 291 places in 292 ms
[2020-05-18 15:56:55] [INFO ] Deduced a trap composed of 48 places in 272 ms
[2020-05-18 15:56:55] [INFO ] Deduced a trap composed of 23 places in 326 ms
[2020-05-18 15:56:56] [INFO ] Deduced a trap composed of 395 places in 422 ms
[2020-05-18 15:56:56] [INFO ] Deduced a trap composed of 255 places in 398 ms
[2020-05-18 15:56:56] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 7937 ms
[2020-05-18 15:56:57] [INFO ] Computed and/alt/rep : 1100/20488/1080 causal constraints in 92 ms.
[2020-05-18 15:57:17] [INFO ] Added : 595 causal constraints over 119 iterations in 20305 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 146 ms.
[2020-05-18 15:57:17] [INFO ] [Real]Absence check using 14 positive place invariants in 39 ms returned sat
[2020-05-18 15:57:17] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 111 ms returned sat
[2020-05-18 15:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:57:19] [INFO ] [Real]Absence check using state equation in 2188 ms returned sat
[2020-05-18 15:57:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:57:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 48 ms returned sat
[2020-05-18 15:57:20] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 105 ms returned sat
[2020-05-18 15:57:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:57:22] [INFO ] [Nat]Absence check using state equation in 2115 ms returned sat
[2020-05-18 15:57:23] [INFO ] [Nat]Added 130 Read/Feed constraints in 877 ms returned sat
[2020-05-18 15:57:23] [INFO ] Deduced a trap composed of 25 places in 233 ms
[2020-05-18 15:57:23] [INFO ] Deduced a trap composed of 47 places in 116 ms
[2020-05-18 15:57:23] [INFO ] Deduced a trap composed of 47 places in 71 ms
[2020-05-18 15:57:23] [INFO ] Deduced a trap composed of 47 places in 45 ms
[2020-05-18 15:57:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 697 ms
[2020-05-18 15:57:23] [INFO ] Computed and/alt/rep : 1100/20488/1080 causal constraints in 93 ms.
[2020-05-18 15:57:44] [INFO ] Added : 560 causal constraints over 112 iterations in 20211 ms.(timeout) Result :sat
[2020-05-18 15:57:44] [INFO ] Deduced a trap composed of 48 places in 191 ms
[2020-05-18 15:57:45] [INFO ] Deduced a trap composed of 48 places in 463 ms
[2020-05-18 15:57:45] [INFO ] Deduced a trap composed of 253 places in 418 ms
[2020-05-18 15:57:46] [INFO ] Deduced a trap composed of 47 places in 432 ms
[2020-05-18 15:57:46] [INFO ] Deduced a trap composed of 48 places in 453 ms
[2020-05-18 15:57:47] [INFO ] Deduced a trap composed of 48 places in 380 ms
[2020-05-18 15:57:48] [INFO ] Deduced a trap composed of 288 places in 415 ms
[2020-05-18 15:57:48] [INFO ] Deduced a trap composed of 255 places in 404 ms
[2020-05-18 15:57:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4769 ms
Attempting to minimize the solution found.
Minimization took 147 ms.
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 694900 steps, including 1000 resets, run finished after 3849 ms. (steps per millisecond=180 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 613000 steps, including 1000 resets, run finished after 2784 ms. (steps per millisecond=220 ) properties seen :[0, 0] could not realise parikh vector
Support contains 92 out of 568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 568/568 places, 1102/1102 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 568 transition count 1092
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 558 transition count 1092
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 80 place count 528 transition count 1062
Applied a total of 80 rules in 44 ms. Remains 528 /568 variables (removed 40) and now considering 1062/1102 (removed 40) transitions.
Finished structural reductions, in 1 iterations. Remains : 528/568 places, 1062/1102 transitions.
Incomplete random walk after 1000000 steps, including 265 resets, run finished after 4628 ms. (steps per millisecond=216 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 239 resets, run finished after 2985 ms. (steps per millisecond=335 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 303 resets, run finished after 2425 ms. (steps per millisecond=412 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 2255379 steps, run timeout after 30001 ms. (steps per millisecond=75 ) properties seen :[0, 0]
Probabilistic random walk after 2255379 steps, saw 664248 distinct states, run finished after 30001 ms. (steps per millisecond=75 ) properties seen :[0, 0]
[2020-05-18 15:58:35] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 528 cols
[2020-05-18 15:58:35] [INFO ] Computed 52 place invariants in 12 ms
[2020-05-18 15:58:35] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2020-05-18 15:58:35] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 54 ms returned sat
[2020-05-18 15:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:58:38] [INFO ] [Real]Absence check using state equation in 2992 ms returned sat
[2020-05-18 15:58:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:58:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-18 15:58:39] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 70 ms returned sat
[2020-05-18 15:58:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:58:43] [INFO ] [Nat]Absence check using state equation in 4017 ms returned sat
[2020-05-18 15:58:43] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-05-18 15:58:43] [INFO ] [Nat]Added 130 Read/Feed constraints in 220 ms returned sat
[2020-05-18 15:58:43] [INFO ] Deduced a trap composed of 43 places in 401 ms
[2020-05-18 15:58:44] [INFO ] Deduced a trap composed of 43 places in 342 ms
[2020-05-18 15:58:44] [INFO ] Deduced a trap composed of 43 places in 286 ms
[2020-05-18 15:58:44] [INFO ] Deduced a trap composed of 43 places in 279 ms
[2020-05-18 15:58:45] [INFO ] Deduced a trap composed of 235 places in 265 ms
[2020-05-18 15:58:45] [INFO ] Deduced a trap composed of 43 places in 273 ms
[2020-05-18 15:58:45] [INFO ] Deduced a trap composed of 43 places in 269 ms
[2020-05-18 15:58:46] [INFO ] Deduced a trap composed of 43 places in 262 ms
[2020-05-18 15:58:46] [INFO ] Deduced a trap composed of 246 places in 250 ms
[2020-05-18 15:58:46] [INFO ] Deduced a trap composed of 232 places in 262 ms
[2020-05-18 15:58:46] [INFO ] Deduced a trap composed of 248 places in 285 ms
[2020-05-18 15:58:47] [INFO ] Deduced a trap composed of 301 places in 272 ms
[2020-05-18 15:58:47] [INFO ] Deduced a trap composed of 285 places in 245 ms
[2020-05-18 15:58:47] [INFO ] Deduced a trap composed of 220 places in 289 ms
[2020-05-18 15:58:48] [INFO ] Deduced a trap composed of 234 places in 268 ms
[2020-05-18 15:58:48] [INFO ] Deduced a trap composed of 206 places in 331 ms
[2020-05-18 15:58:48] [INFO ] Deduced a trap composed of 189 places in 259 ms
[2020-05-18 15:58:48] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5542 ms
[2020-05-18 15:58:49] [INFO ] Computed and/alt/rep : 1060/20488/1040 causal constraints in 52 ms.
[2020-05-18 15:59:09] [INFO ] Added : 535 causal constraints over 107 iterations in 20374 ms.(timeout) Result :sat
[2020-05-18 15:59:09] [INFO ] Deduced a trap composed of 43 places in 105 ms
[2020-05-18 15:59:09] [INFO ] Deduced a trap composed of 43 places in 86 ms
[2020-05-18 15:59:10] [INFO ] Deduced a trap composed of 44 places in 63 ms
[2020-05-18 15:59:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1020 ms
Attempting to minimize the solution found.
Minimization took 195 ms.
[2020-05-18 15:59:10] [INFO ] [Real]Absence check using 14 positive place invariants in 32 ms returned sat
[2020-05-18 15:59:10] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 98 ms returned sat
[2020-05-18 15:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 15:59:13] [INFO ] [Real]Absence check using state equation in 2684 ms returned sat
[2020-05-18 15:59:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 15:59:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2020-05-18 15:59:13] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 45 ms returned sat
[2020-05-18 15:59:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 15:59:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 15:59:58] [INFO ] [Nat]Absence check using state equation in 44888 ms returned (error "Failed to check-sat")
Incomplete Parikh walk after 614100 steps, including 1000 resets, run finished after 3060 ms. (steps per millisecond=200 ) properties seen :[0, 0] could not realise parikh vector
Support contains 92 out of 528 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 528/528 places, 1062/1062 transitions.
Applied a total of 0 rules in 22 ms. Remains 528 /528 variables (removed 0) and now considering 1062/1062 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 528/528 places, 1062/1062 transitions.
Starting structural reductions, iteration 0 : 528/528 places, 1062/1062 transitions.
Applied a total of 0 rules in 22 ms. Remains 528 /528 variables (removed 0) and now considering 1062/1062 (removed 0) transitions.
[2020-05-18 16:00:01] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 528 cols
[2020-05-18 16:00:01] [INFO ] Computed 52 place invariants in 12 ms
[2020-05-18 16:00:02] [INFO ] Implicit Places using invariants in 1159 ms returned []
[2020-05-18 16:00:02] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 528 cols
[2020-05-18 16:00:02] [INFO ] Computed 52 place invariants in 12 ms
[2020-05-18 16:00:04] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-05-18 16:00:11] [INFO ] Implicit Places using invariants and state equation in 8919 ms returned []
Implicit Place search using SMT with State Equation took 10081 ms to find 0 implicit places.
[2020-05-18 16:00:11] [INFO ] Redundant transitions in 86 ms returned []
[2020-05-18 16:00:11] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 528 cols
[2020-05-18 16:00:11] [INFO ] Computed 52 place invariants in 14 ms
[2020-05-18 16:00:14] [INFO ] Dead Transitions using invariants and state equation in 2877 ms returned []
Finished structural reductions, in 1 iterations. Remains : 528/528 places, 1062/1062 transitions.
Incomplete random walk after 100000 steps, including 33 resets, run finished after 442 ms. (steps per millisecond=226 ) properties seen :[0, 0]
[2020-05-18 16:00:15] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 528 cols
[2020-05-18 16:00:15] [INFO ] Computed 52 place invariants in 12 ms
[2020-05-18 16:00:15] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-18 16:00:15] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 51 ms returned sat
[2020-05-18 16:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 16:00:18] [INFO ] [Real]Absence check using state equation in 3260 ms returned sat
[2020-05-18 16:00:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 16:00:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-18 16:00:18] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 42 ms returned sat
[2020-05-18 16:00:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 16:00:22] [INFO ] [Nat]Absence check using state equation in 3594 ms returned sat
[2020-05-18 16:00:22] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-05-18 16:00:22] [INFO ] [Nat]Added 130 Read/Feed constraints in 348 ms returned sat
[2020-05-18 16:00:23] [INFO ] Deduced a trap composed of 43 places in 395 ms
[2020-05-18 16:00:23] [INFO ] Deduced a trap composed of 43 places in 355 ms
[2020-05-18 16:00:23] [INFO ] Deduced a trap composed of 43 places in 378 ms
[2020-05-18 16:00:24] [INFO ] Deduced a trap composed of 43 places in 389 ms
[2020-05-18 16:00:24] [INFO ] Deduced a trap composed of 235 places in 353 ms
[2020-05-18 16:00:25] [INFO ] Deduced a trap composed of 43 places in 303 ms
[2020-05-18 16:00:25] [INFO ] Deduced a trap composed of 43 places in 360 ms
[2020-05-18 16:00:25] [INFO ] Deduced a trap composed of 43 places in 296 ms
[2020-05-18 16:00:26] [INFO ] Deduced a trap composed of 246 places in 367 ms
[2020-05-18 16:00:26] [INFO ] Deduced a trap composed of 232 places in 318 ms
[2020-05-18 16:00:27] [INFO ] Deduced a trap composed of 248 places in 397 ms
[2020-05-18 16:00:27] [INFO ] Deduced a trap composed of 301 places in 244 ms
[2020-05-18 16:00:27] [INFO ] Deduced a trap composed of 285 places in 280 ms
[2020-05-18 16:00:28] [INFO ] Deduced a trap composed of 220 places in 253 ms
[2020-05-18 16:00:28] [INFO ] Deduced a trap composed of 234 places in 243 ms
[2020-05-18 16:00:28] [INFO ] Deduced a trap composed of 206 places in 260 ms
[2020-05-18 16:00:28] [INFO ] Deduced a trap composed of 189 places in 237 ms
[2020-05-18 16:00:28] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6265 ms
[2020-05-18 16:00:28] [INFO ] Computed and/alt/rep : 1060/20488/1040 causal constraints in 53 ms.
[2020-05-18 16:00:38] [INFO ] Added : 300 causal constraints over 60 iterations in 9663 ms. Result :(error "Failed to check-sat")
[2020-05-18 16:00:38] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-18 16:00:38] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 46 ms returned sat
[2020-05-18 16:00:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 16:00:40] [INFO ] [Real]Absence check using state equation in 1973 ms returned sat
[2020-05-18 16:00:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 16:00:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 34 ms returned sat
[2020-05-18 16:00:40] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 52 ms returned sat
[2020-05-18 16:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 16:01:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 16:01:00] [INFO ] [Nat]Absence check using state equation in 19869 ms returned unknown
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 528 transition count 1042
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 518 transition count 1082
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 518 transition count 1072
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 60 place count 508 transition count 1072
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 508 transition count 1060
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 84 place count 496 transition count 1060
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 124 place count 496 transition count 1020
Applied a total of 124 rules in 155 ms. Remains 496 /528 variables (removed 32) and now considering 1020/1062 (removed 42) transitions.
// Phase 1: matrix 1020 rows 496 cols
[2020-05-18 16:01:00] [INFO ] Computed 52 place invariants in 12 ms
[2020-05-18 16:01:00] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2020-05-18 16:01:01] [INFO ] [Real]Absence check using 17 positive and 35 generalized place invariants in 23 ms returned sat
[2020-05-18 16:01:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 16:01:04] [INFO ] [Real]Absence check using state equation in 3351 ms returned sat
[2020-05-18 16:01:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 16:01:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 41 ms returned sat
[2020-05-18 16:01:04] [INFO ] [Nat]Absence check using 17 positive and 35 generalized place invariants in 36 ms returned sat
[2020-05-18 16:01:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 16:01:06] [INFO ] [Nat]Absence check using state equation in 2274 ms returned sat
[2020-05-18 16:01:07] [INFO ] Deduced a trap composed of 194 places in 328 ms
[2020-05-18 16:01:07] [INFO ] Deduced a trap composed of 41 places in 346 ms
[2020-05-18 16:01:07] [INFO ] Deduced a trap composed of 40 places in 319 ms
[2020-05-18 16:01:08] [INFO ] Deduced a trap composed of 205 places in 270 ms
[2020-05-18 16:01:08] [INFO ] Deduced a trap composed of 227 places in 327 ms
[2020-05-18 16:01:08] [INFO ] Deduced a trap composed of 40 places in 361 ms
[2020-05-18 16:01:09] [INFO ] Deduced a trap composed of 189 places in 369 ms
[2020-05-18 16:01:09] [INFO ] Deduced a trap composed of 40 places in 293 ms
[2020-05-18 16:01:10] [INFO ] Deduced a trap composed of 40 places in 276 ms
[2020-05-18 16:01:10] [INFO ] Deduced a trap composed of 223 places in 259 ms
[2020-05-18 16:01:10] [INFO ] Deduced a trap composed of 213 places in 252 ms
[2020-05-18 16:01:11] [INFO ] Deduced a trap composed of 185 places in 299 ms
[2020-05-18 16:01:11] [INFO ] Deduced a trap composed of 184 places in 276 ms
[2020-05-18 16:01:11] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4557 ms
[2020-05-18 16:01:11] [INFO ] Computed and/alt/rep : 1019/18799/1019 causal constraints in 63 ms.
[2020-05-18 16:01:31] [INFO ] Added : 585 causal constraints over 117 iterations in 20132 ms.(timeout) Result :sat
[2020-05-18 16:01:31] [INFO ] Deduced a trap composed of 41 places in 69 ms
[2020-05-18 16:01:31] [INFO ] Deduced a trap composed of 41 places in 82 ms
[2020-05-18 16:01:32] [INFO ] Deduced a trap composed of 41 places in 50 ms
[2020-05-18 16:01:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 864 ms
Attempting to minimize the solution found.
Minimization took 186 ms.
[2020-05-18 16:01:32] [INFO ] [Real]Absence check using 17 positive place invariants in 30 ms returned sat
[2020-05-18 16:01:32] [INFO ] [Real]Absence check using 17 positive and 35 generalized place invariants in 33 ms returned sat
[2020-05-18 16:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 16:01:35] [INFO ] [Real]Absence check using state equation in 3066 ms returned sat
[2020-05-18 16:01:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 16:01:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2020-05-18 16:01:35] [INFO ] [Nat]Absence check using 17 positive and 35 generalized place invariants in 23 ms returned sat
[2020-05-18 16:01:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 16:01:37] [INFO ] [Nat]Absence check using state equation in 1906 ms returned sat
[2020-05-18 16:01:37] [INFO ] Deduced a trap composed of 40 places in 22 ms
[2020-05-18 16:01:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2020-05-18 16:01:38] [INFO ] Computed and/alt/rep : 1019/18799/1019 causal constraints in 78 ms.
[2020-05-18 16:01:58] [INFO ] Added : 580 causal constraints over 116 iterations in 20303 ms.(timeout) Result :sat
[2020-05-18 16:01:58] [INFO ] Deduced a trap composed of 298 places in 374 ms
[2020-05-18 16:01:59] [INFO ] Deduced a trap composed of 40 places in 374 ms
[2020-05-18 16:01:59] [INFO ] Deduced a trap composed of 40 places in 379 ms
[2020-05-18 16:02:00] [INFO ] Deduced a trap composed of 40 places in 370 ms
[2020-05-18 16:02:01] [INFO ] Deduced a trap composed of 229 places in 373 ms
[2020-05-18 16:02:01] [INFO ] Deduced a trap composed of 42 places in 93 ms
[2020-05-18 16:02:02] [INFO ] Deduced a trap composed of 239 places in 383 ms
[2020-05-18 16:02:02] [INFO ] Deduced a trap composed of 42 places in 68 ms
[2020-05-18 16:02:02] [INFO ] Deduced a trap composed of 40 places in 37 ms
[2020-05-18 16:02:02] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4439 ms
Attempting to minimize the solution found.
Minimization took 132 ms.
[2020-05-18 16:02:03] [INFO ] Flatten gal took : 658 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 16:02:04] [INFO ] Applying decomposition
[2020-05-18 16:02:04] [INFO ] Flatten gal took : 340 ms
[2020-05-18 16:02:04] [INFO ] Flatten gal took : 236 ms
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
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="PolyORBLF-PT-S02J04T10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S02J04T10, 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 r126-tajo-158961390300430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T10.tgz
mv PolyORBLF-PT-S02J04T10 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 ;