Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089268100235.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBLF-PT-S02J04T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089268100235
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 120K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 506K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 186K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 922K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 27 09:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K Mar 27 09:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K Mar 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 25 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.5M May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621196804636

Running Version 0
[2021-05-16 20:26:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 20:26:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 20:26:47] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2021-05-16 20:26:47] [INFO ] Transformed 752 places.
[2021-05-16 20:26:47] [INFO ] Transformed 1572 transitions.
[2021-05-16 20:26:47] [INFO ] Parsed PT model containing 752 places and 1572 transitions in 230 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 21 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Normalized transition count is 1392 out of 1412 initially.
// Phase 1: matrix 1392 rows 752 cols
[2021-05-16 20:26:47] [INFO ] Computed 54 place invariants in 100 ms
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 15) seen :19
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :11
[2021-05-16 20:26:48] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2021-05-16 20:26:48] [INFO ] Computed 54 place invariants in 40 ms
[2021-05-16 20:26:48] [INFO ] [Real]Absence check using 15 positive place invariants in 26 ms returned sat
[2021-05-16 20:26:48] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 19 ms returned sat
[2021-05-16 20:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:26:49] [INFO ] [Real]Absence check using state equation in 1255 ms returned sat
[2021-05-16 20:26:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:26:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2021-05-16 20:26:50] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 31 ms returned sat
[2021-05-16 20:26:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:26:54] [INFO ] [Nat]Absence check using state equation in 4877 ms returned unknown
[2021-05-16 20:26:55] [INFO ] [Real]Absence check using 15 positive place invariants in 17 ms returned sat
[2021-05-16 20:26:55] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 21 ms returned unsat
[2021-05-16 20:26:55] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2021-05-16 20:26:55] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 47 ms returned unsat
[2021-05-16 20:26:55] [INFO ] [Real]Absence check using 15 positive place invariants in 25 ms returned sat
[2021-05-16 20:26:55] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 41 ms returned unsat
[2021-05-16 20:26:55] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned sat
[2021-05-16 20:26:55] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 39 ms returned unsat
[2021-05-16 20:26:55] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2021-05-16 20:26:55] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 32 ms returned unsat
[2021-05-16 20:26:55] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2021-05-16 20:26:55] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 25 ms returned unsat
[2021-05-16 20:26:55] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2021-05-16 20:26:55] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 36 ms returned unsat
[2021-05-16 20:26:56] [INFO ] [Real]Absence check using 15 positive place invariants in 17 ms returned sat
[2021-05-16 20:26:56] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 21 ms returned unsat
[2021-05-16 20:26:56] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2021-05-16 20:26:56] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 26 ms returned sat
[2021-05-16 20:26:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:26:58] [INFO ] [Real]Absence check using state equation in 1991 ms returned sat
[2021-05-16 20:26:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:26:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2021-05-16 20:26:58] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 17 ms returned sat
[2021-05-16 20:26:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:27:02] [INFO ] [Nat]Absence check using state equation in 4613 ms returned sat
[2021-05-16 20:27:03] [INFO ] State equation strengthened by 130 read => feed constraints.
[2021-05-16 20:27:03] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 20:27:03] [INFO ] [Nat]Added 130 Read/Feed constraints in 312 ms returned unknown
Current structural bounds on expressions (after SMT) : [40, 10, 2, 2, 1, 1, 1, 1, 1, -1] Max seen :[0, 10, 2, 2, 1, 1, 1, 1, 1, 1]
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 11 out of 752 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 660 transition count 1322
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 182 place count 660 transition count 1242
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 342 place count 580 transition count 1242
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 502 place count 500 transition count 1162
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 522 place count 500 transition count 1142
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 542 place count 480 transition count 1142
Applied a total of 542 rules in 327 ms. Remains 480 /752 variables (removed 272) and now considering 1142/1412 (removed 270) transitions.
[2021-05-16 20:27:03] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
// Phase 1: matrix 1122 rows 480 cols
[2021-05-16 20:27:03] [INFO ] Computed 52 place invariants in 28 ms
[2021-05-16 20:27:04] [INFO ] Dead Transitions using invariants and state equation in 887 ms returned [962, 963, 965, 966, 969, 970, 971, 972, 973, 974, 975, 980, 981, 983, 984, 986, 987, 988, 990, 991, 992, 993, 994, 996, 997, 998, 1000, 1001, 1003, 1004, 1005, 1006, 1007, 1013, 1014, 1015, 1017, 1018, 1020, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1030, 1031, 1032, 1034, 1035, 1036, 1037, 1038, 1039, 1048, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1057, 1059, 1061, 1066, 1067, 1068, 1069, 1070, 1071, 1073, 1075, 1076, 1077, 1079, 1084, 1085, 1087, 1088, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1102, 1103, 1105, 1107, 1108, 1109, 1110, 1112, 1113, 1114, 1115, 1117, 1118, 1119, 1120, 1122, 1123, 1124, 1125, 1126, 1128, 1129]
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions :[1129, 1128, 1126, 1125, 1124, 1123, 1122, 1120, 1119, 1118, 1117, 1115, 1114, 1113, 1112, 1110, 1109, 1108, 1107, 1105, 1103, 1102, 1096, 1095, 1094, 1093, 1092, 1091, 1090, 1088, 1087, 1085, 1084, 1079, 1077, 1076, 1075, 1073, 1071, 1070, 1069, 1068, 1067, 1066, 1061, 1059, 1057, 1055, 1054, 1053, 1052, 1051, 1050, 1049, 1048, 1039, 1038, 1037, 1036, 1035, 1034, 1032, 1031, 1030, 1027, 1026, 1025, 1024, 1023, 1022, 1021, 1020, 1018, 1017, 1015, 1014, 1013, 1007, 1006, 1005, 1004, 1003, 1001, 1000, 998, 997, 996, 994, 993, 992, 991, 990, 988, 987, 986, 984, 983, 981, 980, 975, 974, 973, 972, 971, 970, 969, 966, 965, 963, 962]
Starting structural reductions, iteration 1 : 480/752 places, 1032/1412 transitions.
Reduce places removed 2 places and 20 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 478 transition count 1012
Reduce places removed 10 places and 20 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 12 place count 468 transition count 992
Deduced a syphon composed of 10 places in 1 ms
Applied a total of 12 rules in 31 ms. Remains 468 /480 variables (removed 12) and now considering 992/1032 (removed 40) transitions.
Finished structural reductions, in 2 iterations. Remains : 468/752 places, 992/1412 transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 972 out of 992 initially.
// Phase 1: matrix 972 rows 458 cols
[2021-05-16 20:27:04] [INFO ] Computed 52 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 360 resets, run finished after 4199 ms. (steps per millisecond=238 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 1672 ms. (steps per millisecond=598 ) properties (out of 1) seen :1
[2021-05-16 20:27:10] [INFO ] Flow matrix only has 972 transitions (discarded 20 similar events)
// Phase 1: matrix 972 rows 458 cols
[2021-05-16 20:27:10] [INFO ] Computed 52 place invariants in 13 ms
[2021-05-16 20:27:10] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2021-05-16 20:27:10] [INFO ] [Real]Absence check using 11 positive and 41 generalized place invariants in 57 ms returned sat
[2021-05-16 20:27:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:27:11] [INFO ] [Real]Absence check using state equation in 1154 ms returned sat
[2021-05-16 20:27:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:27:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-16 20:27:11] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 16 ms returned sat
[2021-05-16 20:27:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:27:12] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2021-05-16 20:27:12] [INFO ] State equation strengthened by 130 read => feed constraints.
[2021-05-16 20:27:12] [INFO ] [Nat]Added 130 Read/Feed constraints in 602 ms returned sat
[2021-05-16 20:27:13] [INFO ] Deduced a trap composed of 92 places in 239 ms of which 6 ms to minimize.
[2021-05-16 20:27:13] [INFO ] Deduced a trap composed of 131 places in 246 ms of which 3 ms to minimize.
[2021-05-16 20:27:13] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 1 ms to minimize.
[2021-05-16 20:27:13] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 4 ms to minimize.
[2021-05-16 20:27:14] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2021-05-16 20:27:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1123 ms
[2021-05-16 20:27:14] [INFO ] Computed and/alt/rep : 340/718/330 causal constraints (skipped 640 transitions) in 58 ms.
[2021-05-16 20:27:16] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2021-05-16 20:27:16] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2021-05-16 20:27:16] [INFO ] Deduced a trap composed of 184 places in 162 ms of which 7 ms to minimize.
[2021-05-16 20:27:17] [INFO ] Deduced a trap composed of 163 places in 227 ms of which 0 ms to minimize.
[2021-05-16 20:27:17] [INFO ] Deduced a trap composed of 195 places in 134 ms of which 1 ms to minimize.
[2021-05-16 20:27:17] [INFO ] Deduced a trap composed of 37 places in 23 ms of which 1 ms to minimize.
[2021-05-16 20:27:17] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2021-05-16 20:27:17] [INFO ] Deduced a trap composed of 176 places in 139 ms of which 0 ms to minimize.
[2021-05-16 20:27:17] [INFO ] Deduced a trap composed of 36 places in 19 ms of which 0 ms to minimize.
[2021-05-16 20:27:17] [INFO ] Deduced a trap composed of 37 places in 20 ms of which 0 ms to minimize.
[2021-05-16 20:27:18] [INFO ] Deduced a trap composed of 37 places in 23 ms of which 0 ms to minimize.
[2021-05-16 20:27:18] [INFO ] Deduced a trap composed of 197 places in 158 ms of which 1 ms to minimize.
[2021-05-16 20:27:18] [INFO ] Deduced a trap composed of 201 places in 149 ms of which 1 ms to minimize.
[2021-05-16 20:27:18] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 1 ms to minimize.
[2021-05-16 20:27:18] [INFO ] Deduced a trap composed of 182 places in 149 ms of which 1 ms to minimize.
[2021-05-16 20:27:19] [INFO ] Deduced a trap composed of 197 places in 152 ms of which 1 ms to minimize.
[2021-05-16 20:27:19] [INFO ] Deduced a trap composed of 191 places in 145 ms of which 1 ms to minimize.
[2021-05-16 20:27:19] [INFO ] Deduced a trap composed of 164 places in 136 ms of which 0 ms to minimize.
[2021-05-16 20:27:19] [INFO ] Deduced a trap composed of 160 places in 150 ms of which 0 ms to minimize.
[2021-05-16 20:27:19] [INFO ] Deduced a trap composed of 206 places in 155 ms of which 0 ms to minimize.
[2021-05-16 20:27:19] [INFO ] Deduced a trap composed of 179 places in 126 ms of which 0 ms to minimize.
[2021-05-16 20:27:20] [INFO ] Deduced a trap composed of 188 places in 135 ms of which 1 ms to minimize.
[2021-05-16 20:27:20] [INFO ] Deduced a trap composed of 186 places in 132 ms of which 0 ms to minimize.
[2021-05-16 20:27:20] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 0 ms to minimize.
[2021-05-16 20:27:20] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 0 ms to minimize.
[2021-05-16 20:27:20] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 1 ms to minimize.
[2021-05-16 20:27:21] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 1 ms to minimize.
[2021-05-16 20:27:21] [INFO ] Deduced a trap composed of 190 places in 139 ms of which 1 ms to minimize.
[2021-05-16 20:27:21] [INFO ] Deduced a trap composed of 172 places in 139 ms of which 1 ms to minimize.
[2021-05-16 20:27:21] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 4 ms to minimize.
[2021-05-16 20:27:21] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 1 ms to minimize.
[2021-05-16 20:27:22] [INFO ] Deduced a trap composed of 203 places in 141 ms of which 0 ms to minimize.
[2021-05-16 20:27:22] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 0 ms to minimize.
[2021-05-16 20:27:22] [INFO ] Deduced a trap composed of 84 places in 165 ms of which 1 ms to minimize.
[2021-05-16 20:27:22] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 0 ms to minimize.
[2021-05-16 20:27:22] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 0 ms to minimize.
[2021-05-16 20:27:23] [INFO ] Deduced a trap composed of 187 places in 161 ms of which 1 ms to minimize.
[2021-05-16 20:27:23] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 0 ms to minimize.
[2021-05-16 20:27:23] [INFO ] Deduced a trap composed of 199 places in 164 ms of which 0 ms to minimize.
[2021-05-16 20:27:23] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 0 ms to minimize.
[2021-05-16 20:27:24] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 0 ms to minimize.
[2021-05-16 20:27:24] [INFO ] Deduced a trap composed of 193 places in 151 ms of which 0 ms to minimize.
[2021-05-16 20:27:24] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 0 ms to minimize.
[2021-05-16 20:27:24] [INFO ] Deduced a trap composed of 211 places in 147 ms of which 0 ms to minimize.
[2021-05-16 20:27:24] [INFO ] Deduced a trap composed of 184 places in 155 ms of which 1 ms to minimize.
[2021-05-16 20:27:25] [INFO ] Deduced a trap composed of 170 places in 155 ms of which 1 ms to minimize.
[2021-05-16 20:27:25] [INFO ] Deduced a trap composed of 192 places in 151 ms of which 1 ms to minimize.
[2021-05-16 20:27:25] [INFO ] Deduced a trap composed of 209 places in 149 ms of which 0 ms to minimize.
[2021-05-16 20:27:25] [INFO ] Deduced a trap composed of 195 places in 134 ms of which 1 ms to minimize.
[2021-05-16 20:27:25] [INFO ] Deduced a trap composed of 181 places in 147 ms of which 0 ms to minimize.
[2021-05-16 20:27:26] [INFO ] Deduced a trap composed of 192 places in 144 ms of which 0 ms to minimize.
[2021-05-16 20:27:26] [INFO ] Deduced a trap composed of 189 places in 155 ms of which 6 ms to minimize.
[2021-05-16 20:27:26] [INFO ] Deduced a trap composed of 187 places in 165 ms of which 1 ms to minimize.
[2021-05-16 20:27:26] [INFO ] Deduced a trap composed of 165 places in 164 ms of which 1 ms to minimize.
[2021-05-16 20:27:27] [INFO ] Deduced a trap composed of 250 places in 151 ms of which 0 ms to minimize.
[2021-05-16 20:27:27] [INFO ] Deduced a trap composed of 200 places in 145 ms of which 0 ms to minimize.
[2021-05-16 20:27:27] [INFO ] Deduced a trap composed of 173 places in 184 ms of which 0 ms to minimize.
[2021-05-16 20:27:27] [INFO ] Deduced a trap composed of 208 places in 161 ms of which 0 ms to minimize.
[2021-05-16 20:27:27] [INFO ] Deduced a trap composed of 197 places in 141 ms of which 0 ms to minimize.
[2021-05-16 20:27:28] [INFO ] Deduced a trap composed of 180 places in 142 ms of which 0 ms to minimize.
[2021-05-16 20:27:28] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 2 ms to minimize.
[2021-05-16 20:27:28] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 0 ms to minimize.
[2021-05-16 20:27:29] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 2 ms to minimize.
[2021-05-16 20:27:29] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 1 ms to minimize.
[2021-05-16 20:27:29] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 0 ms to minimize.
[2021-05-16 20:27:29] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 1 ms to minimize.
[2021-05-16 20:27:30] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 0 ms to minimize.
[2021-05-16 20:27:30] [INFO ] Deduced a trap composed of 151 places in 140 ms of which 0 ms to minimize.
[2021-05-16 20:27:30] [INFO ] Deduced a trap composed of 112 places in 135 ms of which 0 ms to minimize.
[2021-05-16 20:27:30] [INFO ] Deduced a trap composed of 104 places in 154 ms of which 0 ms to minimize.
[2021-05-16 20:27:30] [INFO ] Deduced a trap composed of 88 places in 152 ms of which 1 ms to minimize.
[2021-05-16 20:27:31] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 0 ms to minimize.
[2021-05-16 20:27:31] [INFO ] Deduced a trap composed of 108 places in 140 ms of which 0 ms to minimize.
[2021-05-16 20:27:31] [INFO ] Deduced a trap composed of 151 places in 144 ms of which 1 ms to minimize.
[2021-05-16 20:27:31] [INFO ] Deduced a trap composed of 116 places in 139 ms of which 0 ms to minimize.
[2021-05-16 20:27:31] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 1 ms to minimize.
[2021-05-16 20:27:32] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 1 ms to minimize.
[2021-05-16 20:27:32] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 0 ms to minimize.
[2021-05-16 20:27:32] [INFO ] Deduced a trap composed of 155 places in 145 ms of which 1 ms to minimize.
[2021-05-16 20:27:32] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 0 ms to minimize.
[2021-05-16 20:27:32] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 1 ms to minimize.
[2021-05-16 20:27:33] [INFO ] Deduced a trap composed of 126 places in 143 ms of which 1 ms to minimize.
[2021-05-16 20:27:33] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 0 ms to minimize.
[2021-05-16 20:27:33] [INFO ] Deduced a trap composed of 115 places in 171 ms of which 0 ms to minimize.
[2021-05-16 20:27:33] [INFO ] Deduced a trap composed of 122 places in 174 ms of which 1 ms to minimize.
[2021-05-16 20:27:33] [INFO ] Deduced a trap composed of 221 places in 143 ms of which 1 ms to minimize.
[2021-05-16 20:27:34] [INFO ] Deduced a trap composed of 130 places in 144 ms of which 1 ms to minimize.
[2021-05-16 20:27:34] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 1 ms to minimize.
[2021-05-16 20:27:34] [INFO ] Deduced a trap composed of 120 places in 134 ms of which 1 ms to minimize.
[2021-05-16 20:27:34] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 1 ms to minimize.
[2021-05-16 20:27:34] [INFO ] Deduced a trap composed of 143 places in 142 ms of which 1 ms to minimize.
[2021-05-16 20:27:35] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 1 ms to minimize.
[2021-05-16 20:27:35] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 1 ms to minimize.
[2021-05-16 20:27:35] [INFO ] Deduced a trap composed of 222 places in 139 ms of which 0 ms to minimize.
[2021-05-16 20:27:35] [INFO ] Deduced a trap composed of 203 places in 146 ms of which 0 ms to minimize.
[2021-05-16 20:27:35] [INFO ] Deduced a trap composed of 201 places in 144 ms of which 0 ms to minimize.
[2021-05-16 20:27:36] [INFO ] Deduced a trap composed of 189 places in 144 ms of which 1 ms to minimize.
[2021-05-16 20:27:36] [INFO ] Deduced a trap composed of 187 places in 161 ms of which 0 ms to minimize.
[2021-05-16 20:27:36] [INFO ] Deduced a trap composed of 101 places in 152 ms of which 0 ms to minimize.
[2021-05-16 20:27:36] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 1 ms to minimize.
[2021-05-16 20:27:37] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 0 ms to minimize.
[2021-05-16 20:27:37] [INFO ] Deduced a trap composed of 196 places in 130 ms of which 0 ms to minimize.
[2021-05-16 20:27:37] [INFO ] Deduced a trap composed of 212 places in 131 ms of which 0 ms to minimize.
[2021-05-16 20:27:37] [INFO ] Deduced a trap composed of 58 places in 186 ms of which 1 ms to minimize.
[2021-05-16 20:27:38] [INFO ] Deduced a trap composed of 206 places in 172 ms of which 0 ms to minimize.
[2021-05-16 20:27:38] [INFO ] Deduced a trap composed of 227 places in 133 ms of which 0 ms to minimize.
[2021-05-16 20:27:38] [INFO ] Deduced a trap composed of 192 places in 131 ms of which 0 ms to minimize.
[2021-05-16 20:27:38] [INFO ] Deduced a trap composed of 187 places in 163 ms of which 0 ms to minimize.
[2021-05-16 20:27:38] [INFO ] Deduced a trap composed of 182 places in 147 ms of which 0 ms to minimize.
[2021-05-16 20:27:39] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2021-05-16 20:27:39] [INFO ] Deduced a trap composed of 157 places in 152 ms of which 0 ms to minimize.
[2021-05-16 20:27:39] [INFO ] Deduced a trap composed of 183 places in 132 ms of which 1 ms to minimize.
[2021-05-16 20:27:39] [INFO ] Deduced a trap composed of 187 places in 134 ms of which 0 ms to minimize.
[2021-05-16 20:27:40] [INFO ] Deduced a trap composed of 182 places in 131 ms of which 1 ms to minimize.
[2021-05-16 20:27:40] [INFO ] Deduced a trap composed of 197 places in 134 ms of which 1 ms to minimize.
[2021-05-16 20:27:40] [INFO ] Deduced a trap composed of 208 places in 133 ms of which 0 ms to minimize.
[2021-05-16 20:27:40] [INFO ] Deduced a trap composed of 166 places in 130 ms of which 1 ms to minimize.
[2021-05-16 20:27:40] [INFO ] Deduced a trap composed of 205 places in 131 ms of which 1 ms to minimize.
[2021-05-16 20:27:41] [INFO ] Deduced a trap composed of 229 places in 133 ms of which 1 ms to minimize.
[2021-05-16 20:27:41] [INFO ] Deduced a trap composed of 217 places in 133 ms of which 1 ms to minimize.
[2021-05-16 20:27:41] [INFO ] Trap strengthening (SAT) tested/added 121/120 trap constraints in 24957 ms
[2021-05-16 20:27:41] [INFO ] Added : 214 causal constraints over 43 iterations in 27488 ms.(timeout) Result :sat
Minimization took 703 ms.
Current structural bounds on expressions (after SMT) : [10, -1] Max seen :[1, 1]
Incomplete Parikh walk after 231500 steps, including 1002 resets, run finished after 979 ms. (steps per millisecond=236 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 458/458 places, 992/992 transitions.
Applied a total of 0 rules in 18 ms. Remains 458 /458 variables (removed 0) and now considering 992/992 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 458/458 places, 992/992 transitions.
Starting structural reductions, iteration 0 : 458/458 places, 992/992 transitions.
Applied a total of 0 rules in 21 ms. Remains 458 /458 variables (removed 0) and now considering 992/992 (removed 0) transitions.
[2021-05-16 20:27:43] [INFO ] Flow matrix only has 972 transitions (discarded 20 similar events)
// Phase 1: matrix 972 rows 458 cols
[2021-05-16 20:27:43] [INFO ] Computed 52 place invariants in 16 ms
[2021-05-16 20:27:43] [INFO ] Implicit Places using invariants in 415 ms returned [3, 56, 115, 164, 236, 262, 317, 346, 353, 407]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 418 ms to find 10 implicit places.
[2021-05-16 20:27:43] [INFO ] Redundant transitions in 47 ms returned []
[2021-05-16 20:27:43] [INFO ] Flow matrix only has 972 transitions (discarded 20 similar events)
// Phase 1: matrix 972 rows 448 cols
[2021-05-16 20:27:43] [INFO ] Computed 42 place invariants in 15 ms
[2021-05-16 20:27:44] [INFO ] Dead Transitions using invariants and state equation in 511 ms returned []
Starting structural reductions, iteration 1 : 448/458 places, 992/992 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 440 transition count 984
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 440 transition count 984
Applied a total of 16 rules in 29 ms. Remains 440 /448 variables (removed 8) and now considering 984/992 (removed 8) transitions.
[2021-05-16 20:27:44] [INFO ] Flow matrix only has 964 transitions (discarded 20 similar events)
// Phase 1: matrix 964 rows 440 cols
[2021-05-16 20:27:44] [INFO ] Computed 42 place invariants in 19 ms
[2021-05-16 20:27:44] [INFO ] Implicit Places using invariants in 569 ms returned []
[2021-05-16 20:27:44] [INFO ] Flow matrix only has 964 transitions (discarded 20 similar events)
// Phase 1: matrix 964 rows 440 cols
[2021-05-16 20:27:44] [INFO ] Computed 42 place invariants in 10 ms
[2021-05-16 20:27:45] [INFO ] State equation strengthened by 130 read => feed constraints.
[2021-05-16 20:27:50] [INFO ] Implicit Places using invariants and state equation in 5994 ms returned []
Implicit Place search using SMT with State Equation took 6585 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 440/458 places, 984/992 transitions.
Normalized transition count is 964 out of 984 initially.
// Phase 1: matrix 964 rows 440 cols
[2021-05-16 20:27:50] [INFO ] Computed 42 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 376 resets, run finished after 3518 ms. (steps per millisecond=284 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1484 ms. (steps per millisecond=673 ) properties (out of 1) seen :1
[2021-05-16 20:27:55] [INFO ] Flow matrix only has 964 transitions (discarded 20 similar events)
// Phase 1: matrix 964 rows 440 cols
[2021-05-16 20:27:56] [INFO ] Computed 42 place invariants in 19 ms
[2021-05-16 20:27:56] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2021-05-16 20:27:56] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-16 20:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:27:56] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2021-05-16 20:27:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:27:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2021-05-16 20:27:57] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 11 ms returned sat
[2021-05-16 20:27:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:27:59] [INFO ] [Nat]Absence check using state equation in 2008 ms returned sat
[2021-05-16 20:27:59] [INFO ] State equation strengthened by 130 read => feed constraints.
[2021-05-16 20:27:59] [INFO ] [Nat]Added 130 Read/Feed constraints in 247 ms returned sat
[2021-05-16 20:27:59] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 0 ms to minimize.
[2021-05-16 20:27:59] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 0 ms to minimize.
[2021-05-16 20:27:59] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2021-05-16 20:27:59] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2021-05-16 20:27:59] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2021-05-16 20:28:00] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2021-05-16 20:28:00] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2021-05-16 20:28:00] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2021-05-16 20:28:00] [INFO ] Deduced a trap composed of 36 places in 22 ms of which 0 ms to minimize.
[2021-05-16 20:28:00] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 0 ms to minimize.
[2021-05-16 20:28:00] [INFO ] Deduced a trap composed of 112 places in 136 ms of which 1 ms to minimize.
[2021-05-16 20:28:00] [INFO ] Deduced a trap composed of 129 places in 149 ms of which 1 ms to minimize.
[2021-05-16 20:28:00] [INFO ] Deduced a trap composed of 114 places in 133 ms of which 0 ms to minimize.
[2021-05-16 20:28:01] [INFO ] Deduced a trap composed of 115 places in 146 ms of which 0 ms to minimize.
[2021-05-16 20:28:01] [INFO ] Deduced a trap composed of 144 places in 127 ms of which 0 ms to minimize.
[2021-05-16 20:28:01] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 0 ms to minimize.
[2021-05-16 20:28:01] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 0 ms to minimize.
[2021-05-16 20:28:01] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 0 ms to minimize.
[2021-05-16 20:28:01] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 0 ms to minimize.
[2021-05-16 20:28:02] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 0 ms to minimize.
[2021-05-16 20:28:02] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 1 ms to minimize.
[2021-05-16 20:28:02] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2021-05-16 20:28:02] [INFO ] Deduced a trap composed of 181 places in 131 ms of which 1 ms to minimize.
[2021-05-16 20:28:02] [INFO ] Deduced a trap composed of 178 places in 126 ms of which 1 ms to minimize.
[2021-05-16 20:28:02] [INFO ] Deduced a trap composed of 158 places in 137 ms of which 0 ms to minimize.
[2021-05-16 20:28:03] [INFO ] Deduced a trap composed of 133 places in 123 ms of which 0 ms to minimize.
[2021-05-16 20:28:03] [INFO ] Deduced a trap composed of 159 places in 119 ms of which 0 ms to minimize.
[2021-05-16 20:28:03] [INFO ] Deduced a trap composed of 213 places in 131 ms of which 0 ms to minimize.
[2021-05-16 20:28:03] [INFO ] Deduced a trap composed of 225 places in 121 ms of which 1 ms to minimize.
[2021-05-16 20:28:03] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 0 ms to minimize.
[2021-05-16 20:28:04] [INFO ] Deduced a trap composed of 199 places in 137 ms of which 1 ms to minimize.
[2021-05-16 20:28:04] [INFO ] Deduced a trap composed of 111 places in 136 ms of which 0 ms to minimize.
[2021-05-16 20:28:04] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 0 ms to minimize.
[2021-05-16 20:28:04] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 1 ms to minimize.
[2021-05-16 20:28:04] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 1 ms to minimize.
[2021-05-16 20:28:04] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 5488 ms
[2021-05-16 20:28:04] [INFO ] Computed and/alt/rep : 332/702/322 causal constraints (skipped 640 transitions) in 56 ms.
[2021-05-16 20:28:07] [INFO ] Deduced a trap composed of 200 places in 153 ms of which 0 ms to minimize.
[2021-05-16 20:28:07] [INFO ] Deduced a trap composed of 205 places in 134 ms of which 1 ms to minimize.
[2021-05-16 20:28:07] [INFO ] Deduced a trap composed of 129 places in 128 ms of which 0 ms to minimize.
[2021-05-16 20:28:07] [INFO ] Deduced a trap composed of 206 places in 145 ms of which 3 ms to minimize.
[2021-05-16 20:28:07] [INFO ] Deduced a trap composed of 204 places in 128 ms of which 0 ms to minimize.
[2021-05-16 20:28:08] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 0 ms to minimize.
[2021-05-16 20:28:08] [INFO ] Deduced a trap composed of 37 places in 19 ms of which 0 ms to minimize.
[2021-05-16 20:28:08] [INFO ] Deduced a trap composed of 211 places in 118 ms of which 0 ms to minimize.
[2021-05-16 20:28:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1528 ms
[2021-05-16 20:28:08] [INFO ] Added : 229 causal constraints over 47 iterations in 3953 ms. Result :sat
Minimization took 519 ms.
Current structural bounds on expressions (after SMT) : [10, -1] Max seen :[1, 1]
Incomplete Parikh walk after 226400 steps, including 1002 resets, run finished after 857 ms. (steps per millisecond=264 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 440/440 places, 984/984 transitions.
Applied a total of 0 rules in 15 ms. Remains 440 /440 variables (removed 0) and now considering 984/984 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 440/440 places, 984/984 transitions.
Starting structural reductions, iteration 0 : 440/440 places, 984/984 transitions.
Applied a total of 0 rules in 14 ms. Remains 440 /440 variables (removed 0) and now considering 984/984 (removed 0) transitions.
[2021-05-16 20:28:10] [INFO ] Flow matrix only has 964 transitions (discarded 20 similar events)
// Phase 1: matrix 964 rows 440 cols
[2021-05-16 20:28:10] [INFO ] Computed 42 place invariants in 9 ms
[2021-05-16 20:28:10] [INFO ] Implicit Places using invariants in 371 ms returned []
[2021-05-16 20:28:10] [INFO ] Flow matrix only has 964 transitions (discarded 20 similar events)
// Phase 1: matrix 964 rows 440 cols
[2021-05-16 20:28:10] [INFO ] Computed 42 place invariants in 12 ms
[2021-05-16 20:28:10] [INFO ] State equation strengthened by 130 read => feed constraints.
[2021-05-16 20:28:16] [INFO ] Implicit Places using invariants and state equation in 6422 ms returned []
Implicit Place search using SMT with State Equation took 6795 ms to find 0 implicit places.
[2021-05-16 20:28:17] [INFO ] Redundant transitions in 34 ms returned []
[2021-05-16 20:28:17] [INFO ] Flow matrix only has 964 transitions (discarded 20 similar events)
// Phase 1: matrix 964 rows 440 cols
[2021-05-16 20:28:17] [INFO ] Computed 42 place invariants in 9 ms
[2021-05-16 20:28:17] [INFO ] Dead Transitions using invariants and state equation in 658 ms returned []
Finished structural reductions, in 1 iterations. Remains : 440/440 places, 984/984 transitions.
Starting property specific reduction for PolyORBLF-PT-S02J04T10-UpperBounds-12
Normalized transition count is 964 out of 984 initially.
// Phase 1: matrix 964 rows 440 cols
[2021-05-16 20:28:17] [INFO ] Computed 42 place invariants in 15 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :1
[2021-05-16 20:28:17] [INFO ] Flow matrix only has 964 transitions (discarded 20 similar events)
// Phase 1: matrix 964 rows 440 cols
[2021-05-16 20:28:17] [INFO ] Computed 42 place invariants in 18 ms
[2021-05-16 20:28:17] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2021-05-16 20:28:17] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-16 20:28:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:28:18] [INFO ] [Real]Absence check using state equation in 882 ms returned sat
[2021-05-16 20:28:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:28:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2021-05-16 20:28:18] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 11 ms returned sat
[2021-05-16 20:28:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:28:20] [INFO ] [Nat]Absence check using state equation in 1959 ms returned sat
[2021-05-16 20:28:20] [INFO ] State equation strengthened by 130 read => feed constraints.
[2021-05-16 20:28:20] [INFO ] [Nat]Added 130 Read/Feed constraints in 239 ms returned sat
[2021-05-16 20:28:21] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 0 ms to minimize.
[2021-05-16 20:28:21] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2021-05-16 20:28:21] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2021-05-16 20:28:21] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2021-05-16 20:28:21] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2021-05-16 20:28:21] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2021-05-16 20:28:21] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2021-05-16 20:28:21] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 0 ms to minimize.
[2021-05-16 20:28:21] [INFO ] Deduced a trap composed of 36 places in 16 ms of which 0 ms to minimize.
[2021-05-16 20:28:22] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 1 ms to minimize.
[2021-05-16 20:28:22] [INFO ] Deduced a trap composed of 112 places in 120 ms of which 0 ms to minimize.
[2021-05-16 20:28:22] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 0 ms to minimize.
[2021-05-16 20:28:22] [INFO ] Deduced a trap composed of 114 places in 139 ms of which 0 ms to minimize.
[2021-05-16 20:28:22] [INFO ] Deduced a trap composed of 115 places in 144 ms of which 1 ms to minimize.
[2021-05-16 20:28:22] [INFO ] Deduced a trap composed of 144 places in 123 ms of which 1 ms to minimize.
[2021-05-16 20:28:23] [INFO ] Deduced a trap composed of 114 places in 129 ms of which 0 ms to minimize.
[2021-05-16 20:28:23] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 0 ms to minimize.
[2021-05-16 20:28:23] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 1 ms to minimize.
[2021-05-16 20:28:23] [INFO ] Deduced a trap composed of 110 places in 121 ms of which 1 ms to minimize.
[2021-05-16 20:28:23] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 1 ms to minimize.
[2021-05-16 20:28:23] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 0 ms to minimize.
[2021-05-16 20:28:23] [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 close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 440/440 places, 984/984 transitions.
Applied a total of 0 rules in 14 ms. Remains 440 /440 variables (removed 0) and now considering 984/984 (removed 0) transitions.
[2021-05-16 20:28:23] [INFO ] Flow matrix only has 964 transitions (discarded 20 similar events)
// Phase 1: matrix 964 rows 440 cols
[2021-05-16 20:28:23] [INFO ] Computed 42 place invariants in 12 ms
[2021-05-16 20:28:24] [INFO ] Dead Transitions using invariants and state equation in 577 ms returned []
Finished structural reductions, in 1 iterations. Remains : 440/440 places, 984/984 transitions.
Normalized transition count is 964 out of 984 initially.
// Phase 1: matrix 964 rows 440 cols
[2021-05-16 20:28:24] [INFO ] Computed 42 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 356 resets, run finished after 3493 ms. (steps per millisecond=286 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1484 ms. (steps per millisecond=673 ) properties (out of 1) seen :1
[2021-05-16 20:28:29] [INFO ] Flow matrix only has 964 transitions (discarded 20 similar events)
// Phase 1: matrix 964 rows 440 cols
[2021-05-16 20:28:29] [INFO ] Computed 42 place invariants in 18 ms
[2021-05-16 20:28:29] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2021-05-16 20:28:29] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 11 ms returned sat
[2021-05-16 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:28:30] [INFO ] [Real]Absence check using state equation in 877 ms returned sat
[2021-05-16 20:28:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:28:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2021-05-16 20:28:30] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 10 ms returned sat
[2021-05-16 20:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:28:32] [INFO ] [Nat]Absence check using state equation in 1973 ms returned sat
[2021-05-16 20:28:32] [INFO ] State equation strengthened by 130 read => feed constraints.
[2021-05-16 20:28:32] [INFO ] [Nat]Added 130 Read/Feed constraints in 246 ms returned sat
[2021-05-16 20:28:32] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 1 ms to minimize.
[2021-05-16 20:28:33] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2021-05-16 20:28:33] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 0 ms to minimize.
[2021-05-16 20:28:33] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 0 ms to minimize.
[2021-05-16 20:28:33] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2021-05-16 20:28:33] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2021-05-16 20:28:33] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2021-05-16 20:28:33] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 0 ms to minimize.
[2021-05-16 20:28:33] [INFO ] Deduced a trap composed of 36 places in 20 ms of which 0 ms to minimize.
[2021-05-16 20:28:33] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 0 ms to minimize.
[2021-05-16 20:28:34] [INFO ] Deduced a trap composed of 112 places in 156 ms of which 1 ms to minimize.
[2021-05-16 20:28:34] [INFO ] Deduced a trap composed of 129 places in 119 ms of which 1 ms to minimize.
[2021-05-16 20:28:34] [INFO ] Deduced a trap composed of 114 places in 135 ms of which 0 ms to minimize.
[2021-05-16 20:28:34] [INFO ] Deduced a trap composed of 115 places in 136 ms of which 0 ms to minimize.
[2021-05-16 20:28:34] [INFO ] Deduced a trap composed of 144 places in 126 ms of which 0 ms to minimize.
[2021-05-16 20:28:34] [INFO ] Deduced a trap composed of 114 places in 134 ms of which 0 ms to minimize.
[2021-05-16 20:28:35] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 0 ms to minimize.
[2021-05-16 20:28:35] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 1 ms to minimize.
[2021-05-16 20:28:35] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 0 ms to minimize.
[2021-05-16 20:28:35] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 0 ms to minimize.
[2021-05-16 20:28:35] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 1 ms to minimize.
[2021-05-16 20:28:35] [INFO ] Deduced a trap composed of 36 places in 20 ms of which 0 ms to minimize.
[2021-05-16 20:28:36] [INFO ] Deduced a trap composed of 181 places in 142 ms of which 1 ms to minimize.
[2021-05-16 20:28:36] [INFO ] Deduced a trap composed of 178 places in 125 ms of which 0 ms to minimize.
[2021-05-16 20:28:36] [INFO ] Deduced a trap composed of 158 places in 120 ms of which 0 ms to minimize.
[2021-05-16 20:28:36] [INFO ] Deduced a trap composed of 133 places in 125 ms of which 0 ms to minimize.
[2021-05-16 20:28:36] [INFO ] Deduced a trap composed of 159 places in 118 ms of which 1 ms to minimize.
[2021-05-16 20:28:36] [INFO ] Deduced a trap composed of 213 places in 137 ms of which 0 ms to minimize.
[2021-05-16 20:28:36] [INFO ] Deduced a trap composed of 225 places in 120 ms of which 0 ms to minimize.
[2021-05-16 20:28:37] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 0 ms to minimize.
[2021-05-16 20:28:37] [INFO ] Deduced a trap composed of 199 places in 130 ms of which 0 ms to minimize.
[2021-05-16 20:28:37] [INFO ] Deduced a trap composed of 111 places in 194 ms of which 0 ms to minimize.
[2021-05-16 20:28:37] [INFO ] Deduced a trap composed of 90 places in 164 ms of which 0 ms to minimize.
[2021-05-16 20:28:37] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 0 ms to minimize.
[2021-05-16 20:28:38] [INFO ] Deduced a trap composed of 105 places in 154 ms of which 0 ms to minimize.
[2021-05-16 20:28:38] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 5496 ms
[2021-05-16 20:28:38] [INFO ] Computed and/alt/rep : 332/702/322 causal constraints (skipped 640 transitions) in 40 ms.
[2021-05-16 20:28:40] [INFO ] Deduced a trap composed of 200 places in 136 ms of which 1 ms to minimize.
[2021-05-16 20:28:40] [INFO ] Deduced a trap composed of 205 places in 129 ms of which 0 ms to minimize.
[2021-05-16 20:28:40] [INFO ] Deduced a trap composed of 129 places in 122 ms of which 0 ms to minimize.
[2021-05-16 20:28:41] [INFO ] Deduced a trap composed of 206 places in 121 ms of which 1 ms to minimize.
[2021-05-16 20:28:41] [INFO ] Deduced a trap composed of 204 places in 123 ms of which 0 ms to minimize.
[2021-05-16 20:28:41] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 1 ms to minimize.
[2021-05-16 20:28:41] [INFO ] Deduced a trap composed of 37 places in 16 ms of which 0 ms to minimize.
[2021-05-16 20:28:41] [INFO ] Deduced a trap composed of 211 places in 133 ms of which 1 ms to minimize.
[2021-05-16 20:28:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1464 ms
[2021-05-16 20:28:42] [INFO ] Added : 229 causal constraints over 47 iterations in 3743 ms. Result :sat
Minimization took 510 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 226400 steps, including 1002 resets, run finished after 867 ms. (steps per millisecond=261 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 440/440 places, 984/984 transitions.
Applied a total of 0 rules in 26 ms. Remains 440 /440 variables (removed 0) and now considering 984/984 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 440/440 places, 984/984 transitions.
Starting structural reductions, iteration 0 : 440/440 places, 984/984 transitions.
Applied a total of 0 rules in 19 ms. Remains 440 /440 variables (removed 0) and now considering 984/984 (removed 0) transitions.
[2021-05-16 20:28:43] [INFO ] Flow matrix only has 964 transitions (discarded 20 similar events)
// Phase 1: matrix 964 rows 440 cols
[2021-05-16 20:28:43] [INFO ] Computed 42 place invariants in 9 ms
[2021-05-16 20:28:43] [INFO ] Implicit Places using invariants in 360 ms returned []
[2021-05-16 20:28:43] [INFO ] Flow matrix only has 964 transitions (discarded 20 similar events)
// Phase 1: matrix 964 rows 440 cols
[2021-05-16 20:28:43] [INFO ] Computed 42 place invariants in 17 ms
[2021-05-16 20:28:44] [INFO ] State equation strengthened by 130 read => feed constraints.
[2021-05-16 20:28:49] [INFO ] Implicit Places using invariants and state equation in 5638 ms returned []
Implicit Place search using SMT with State Equation took 6004 ms to find 0 implicit places.
[2021-05-16 20:28:49] [INFO ] Redundant transitions in 12 ms returned []
[2021-05-16 20:28:49] [INFO ] Flow matrix only has 964 transitions (discarded 20 similar events)
// Phase 1: matrix 964 rows 440 cols
[2021-05-16 20:28:49] [INFO ] Computed 42 place invariants in 9 ms
[2021-05-16 20:28:50] [INFO ] Dead Transitions using invariants and state equation in 526 ms returned []
Finished structural reductions, in 1 iterations. Remains : 440/440 places, 984/984 transitions.
Ending property specific reduction for PolyORBLF-PT-S02J04T10-UpperBounds-12 in 32355 ms.
[2021-05-16 20:28:50] [INFO ] Flatten gal took : 111 ms
[2021-05-16 20:28:50] [INFO ] Applying decomposition
[2021-05-16 20:28:50] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11741736018908415474.txt, -o, /tmp/graph11741736018908415474.bin, -w, /tmp/graph11741736018908415474.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11741736018908415474.bin, -l, -1, -v, -w, /tmp/graph11741736018908415474.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 20:28:50] [INFO ] Decomposing Gal with order
[2021-05-16 20:28:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 20:28:50] [INFO ] Removed a total of 735 redundant transitions.
[2021-05-16 20:28:50] [INFO ] Flatten gal took : 233 ms
[2021-05-16 20:28:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 565 labels/synchronizations in 30 ms.
[2021-05-16 20:28:51] [INFO ] Time to serialize gal into /tmp/UpperBounds18188308363645847994.gal : 16 ms
[2021-05-16 20:28:51] [INFO ] Time to serialize properties into /tmp/UpperBounds5461257730014919584.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds18188308363645847994.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds5461257730014919584.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds18188308363645847994.gal -t CGAL -reachable-file /tmp/UpperBounds5461257730014919584.prop --nowitness
Loading property file /tmp/UpperBounds5461257730014919584.prop.
Detected timeout of ITS tools.
[2021-05-16 20:49:34] [INFO ] Flatten gal took : 690 ms
[2021-05-16 20:49:35] [INFO ] Time to serialize gal into /tmp/UpperBounds16082101492397089079.gal : 135 ms
[2021-05-16 20:49:35] [INFO ] Time to serialize properties into /tmp/UpperBounds3667316841850155626.prop : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds16082101492397089079.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3667316841850155626.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds16082101492397089079.gal -t CGAL -reachable-file /tmp/UpperBounds3667316841850155626.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds3667316841850155626.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.6594e+08,1110.5,10201996,2,329002,5,1.27712e+07,6,0,2756,1.54476e+07,0
Total reachable state count : 265939788

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property PolyORBLF-PT-S02J04T10-UpperBounds-12 :0 <= AwakeTasks_2 <= 1
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-PT-S02J04T10-UpperBounds-12,0,1110.58,10201996,1,0,7,1.27712e+07,9,1,3259,1.54476e+07,4

BK_STOP 1621199287747

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S02J04T10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r159-oct2-162089268100235"
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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;