Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r103-tall-167814478400477.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DES-PT-50a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478400477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 97K Mar 5 18:22 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 DES-PT-50a-UpperBounds-00
FORMULA_NAME DES-PT-50a-UpperBounds-01
FORMULA_NAME DES-PT-50a-UpperBounds-02
FORMULA_NAME DES-PT-50a-UpperBounds-03
FORMULA_NAME DES-PT-50a-UpperBounds-04
FORMULA_NAME DES-PT-50a-UpperBounds-05
FORMULA_NAME DES-PT-50a-UpperBounds-06
FORMULA_NAME DES-PT-50a-UpperBounds-07
FORMULA_NAME DES-PT-50a-UpperBounds-08
FORMULA_NAME DES-PT-50a-UpperBounds-09
FORMULA_NAME DES-PT-50a-UpperBounds-10
FORMULA_NAME DES-PT-50a-UpperBounds-11
FORMULA_NAME DES-PT-50a-UpperBounds-12
FORMULA_NAME DES-PT-50a-UpperBounds-13
FORMULA_NAME DES-PT-50a-UpperBounds-14
FORMULA_NAME DES-PT-50a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678254315083

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:45:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 05:45:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:45:16] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-08 05:45:16] [INFO ] Transformed 314 places.
[2023-03-08 05:45:16] [INFO ] Transformed 271 transitions.
[2023-03-08 05:45:16] [INFO ] Found NUPN structural information;
[2023-03-08 05:45:16] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 257 rows 314 cols
[2023-03-08 05:45:16] [INFO ] Computed 59 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 222 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :7
FORMULA DES-PT-50a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
[2023-03-08 05:45:17] [INFO ] Invariant cache hit.
[2023-03-08 05:45:17] [INFO ] [Real]Absence check using 34 positive place invariants in 22 ms returned sat
[2023-03-08 05:45:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 05:45:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:17] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2023-03-08 05:45:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:45:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 13 ms returned sat
[2023-03-08 05:45:17] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 71 ms returned sat
[2023-03-08 05:45:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:19] [INFO ] [Nat]Absence check using state equation in 1458 ms returned sat
[2023-03-08 05:45:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 05:45:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 179 ms returned sat
[2023-03-08 05:45:19] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 19 ms.
[2023-03-08 05:45:20] [INFO ] Added : 171 causal constraints over 35 iterations in 1095 ms. Result :sat
Minimization took 223 ms.
[2023-03-08 05:45:20] [INFO ] [Real]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-08 05:45:20] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 05:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:21] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2023-03-08 05:45:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:45:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 05:45:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 75 ms returned sat
[2023-03-08 05:45:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:21] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2023-03-08 05:45:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 702 ms returned sat
[2023-03-08 05:45:22] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 20 ms.
[2023-03-08 05:45:23] [INFO ] Added : 191 causal constraints over 39 iterations in 1195 ms. Result :sat
Minimization took 184 ms.
[2023-03-08 05:45:24] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 05:45:24] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:45:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:24] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-08 05:45:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:45:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 05:45:24] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 79 ms returned sat
[2023-03-08 05:45:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:25] [INFO ] [Nat]Absence check using state equation in 805 ms returned sat
[2023-03-08 05:45:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-08 05:45:25] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 21 ms.
[2023-03-08 05:45:25] [INFO ] Added : 85 causal constraints over 17 iterations in 573 ms. Result :sat
Minimization took 365 ms.
[2023-03-08 05:45:26] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-08 05:45:26] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 05:45:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:26] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-03-08 05:45:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:45:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 05:45:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 80 ms returned sat
[2023-03-08 05:45:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:27] [INFO ] [Nat]Absence check using state equation in 956 ms returned sat
[2023-03-08 05:45:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 341 ms returned sat
[2023-03-08 05:45:27] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 17 ms.
[2023-03-08 05:45:28] [INFO ] Added : 119 causal constraints over 24 iterations in 598 ms. Result :sat
Minimization took 192 ms.
[2023-03-08 05:45:28] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 05:45:28] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 05:45:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:28] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-03-08 05:45:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:45:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 05:45:29] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 142 ms returned sat
[2023-03-08 05:45:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:29] [INFO ] [Nat]Absence check using state equation in 926 ms returned sat
[2023-03-08 05:45:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2023-03-08 05:45:30] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 16 ms.
[2023-03-08 05:45:31] [INFO ] Added : 130 causal constraints over 26 iterations in 1261 ms. Result :sat
Minimization took 157 ms.
[2023-03-08 05:45:31] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 05:45:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:31] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-08 05:45:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:45:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 05:45:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 89 ms returned sat
[2023-03-08 05:45:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:32] [INFO ] [Nat]Absence check using state equation in 834 ms returned sat
[2023-03-08 05:45:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 63 ms returned sat
[2023-03-08 05:45:32] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-08 05:45:33] [INFO ] Added : 134 causal constraints over 27 iterations in 842 ms. Result :sat
Minimization took 189 ms.
[2023-03-08 05:45:33] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 05:45:33] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 05:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:33] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-08 05:45:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:45:34] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 05:45:34] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 77 ms returned sat
[2023-03-08 05:45:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:35] [INFO ] [Nat]Absence check using state equation in 878 ms returned sat
[2023-03-08 05:45:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-08 05:45:35] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 18 ms.
[2023-03-08 05:45:35] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 10 ms to minimize.
[2023-03-08 05:45:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-08 05:45:35] [INFO ] Added : 102 causal constraints over 21 iterations in 811 ms. Result :sat
Minimization took 1104 ms.
[2023-03-08 05:45:37] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 05:45:37] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:45:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:37] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2023-03-08 05:45:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:45:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 05:45:37] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 100 ms returned sat
[2023-03-08 05:45:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:37] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2023-03-08 05:45:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 106 ms returned sat
[2023-03-08 05:45:37] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 13 ms.
[2023-03-08 05:45:38] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2023-03-08 05:45:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-08 05:45:38] [INFO ] Added : 73 causal constraints over 15 iterations in 1216 ms. Result :sat
Minimization took 193 ms.
[2023-03-08 05:45:39] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 05:45:39] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:45:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:39] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-08 05:45:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:45:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 05:45:39] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 187 ms returned sat
[2023-03-08 05:45:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:40] [INFO ] [Nat]Absence check using state equation in 1312 ms returned sat
[2023-03-08 05:45:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2023-03-08 05:45:41] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 13 ms.
[2023-03-08 05:45:41] [INFO ] Added : 144 causal constraints over 29 iterations in 862 ms. Result :sat
Minimization took 142 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-50a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 314 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 313 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 313 transition count 254
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 313 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 312 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 311 transition count 253
Applied a total of 12 rules in 98 ms. Remains 311 /314 variables (removed 3) and now considering 253/257 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 311/314 places, 253/257 transitions.
// Phase 1: matrix 253 rows 311 cols
[2023-03-08 05:45:44] [INFO ] Computed 60 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 13624 resets, run finished after 1975 ms. (steps per millisecond=506 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2274 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2250 resets, run finished after 913 ms. (steps per millisecond=1095 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2269 resets, run finished after 900 ms. (steps per millisecond=1111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2299 resets, run finished after 878 ms. (steps per millisecond=1138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2250 resets, run finished after 902 ms. (steps per millisecond=1108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2294 resets, run finished after 871 ms. (steps per millisecond=1148 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2258 resets, run finished after 900 ms. (steps per millisecond=1111 ) properties (out of 7) seen :0
[2023-03-08 05:45:52] [INFO ] Invariant cache hit.
[2023-03-08 05:45:52] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:45:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:45:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:53] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-03-08 05:45:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:45:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:45:53] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 46 ms returned sat
[2023-03-08 05:45:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:53] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2023-03-08 05:45:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:45:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2023-03-08 05:45:53] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 17 ms.
[2023-03-08 05:45:54] [INFO ] Added : 198 causal constraints over 40 iterations in 729 ms. Result :sat
Minimization took 118 ms.
[2023-03-08 05:45:54] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:45:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 05:45:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:54] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-08 05:45:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:45:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:45:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-08 05:45:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:54] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-08 05:45:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2023-03-08 05:45:54] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2023-03-08 05:45:54] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2023-03-08 05:45:54] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2023-03-08 05:45:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 230 ms
[2023-03-08 05:45:54] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-08 05:45:55] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2023-03-08 05:45:55] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2023-03-08 05:45:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2023-03-08 05:45:56] [INFO ] Added : 238 causal constraints over 48 iterations in 1077 ms. Result :sat
Minimization took 72 ms.
[2023-03-08 05:45:56] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 05:45:56] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 05:45:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:56] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-08 05:45:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:45:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 05:45:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-08 05:45:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:56] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2023-03-08 05:45:56] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 05:45:56] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 05:45:56] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2023-03-08 05:45:56] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2023-03-08 05:45:56] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2023-03-08 05:45:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 179 ms
[2023-03-08 05:45:57] [INFO ] Added : 75 causal constraints over 17 iterations in 524 ms. Result :sat
Minimization took 47 ms.
[2023-03-08 05:45:57] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:45:57] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:45:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:57] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-08 05:45:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:45:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:45:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 67 ms returned sat
[2023-03-08 05:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:57] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-08 05:45:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2023-03-08 05:45:57] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2023-03-08 05:45:57] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2023-03-08 05:45:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2023-03-08 05:45:57] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-08 05:45:58] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 0 ms to minimize.
[2023-03-08 05:45:58] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2023-03-08 05:45:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2023-03-08 05:45:58] [INFO ] Added : 149 causal constraints over 30 iterations in 709 ms. Result :sat
Minimization took 85 ms.
[2023-03-08 05:45:58] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:45:58] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:45:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:58] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-08 05:45:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:45:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:45:58] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 51 ms returned sat
[2023-03-08 05:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:58] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-08 05:45:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 05:45:58] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 05:45:59] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2023-03-08 05:45:59] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
[2023-03-08 05:45:59] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2023-03-08 05:45:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 259 ms
[2023-03-08 05:45:59] [INFO ] Added : 74 causal constraints over 15 iterations in 545 ms. Result :sat
Minimization took 87 ms.
[2023-03-08 05:45:59] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 05:45:59] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:59] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-08 05:45:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:45:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:45:59] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-08 05:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:45:59] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2023-03-08 05:45:59] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-08 05:45:59] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-08 05:46:00] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2023-03-08 05:46:00] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2023-03-08 05:46:00] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2023-03-08 05:46:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 172 ms
[2023-03-08 05:46:00] [INFO ] Added : 87 causal constraints over 19 iterations in 531 ms. Result :sat
Minimization took 53 ms.
[2023-03-08 05:46:00] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:46:00] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:46:00] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-08 05:46:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:46:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:46:00] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 37 ms returned sat
[2023-03-08 05:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:46:01] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2023-03-08 05:46:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-08 05:46:01] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2023-03-08 05:46:01] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2023-03-08 05:46:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2023-03-08 05:46:01] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 16 ms.
[2023-03-08 05:46:02] [INFO ] Added : 188 causal constraints over 38 iterations in 705 ms. Result :sat
Minimization took 143 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-50a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 14 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 311/311 places, 253/253 transitions.
[2023-03-08 05:46:04] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13637 resets, run finished after 1778 ms. (steps per millisecond=562 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2321 resets, run finished after 811 ms. (steps per millisecond=1233 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2272 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties (out of 2) seen :0
[2023-03-08 05:46:07] [INFO ] Invariant cache hit.
[2023-03-08 05:46:07] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:46:07] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:46:07] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-08 05:46:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:46:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:46:07] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 45 ms returned sat
[2023-03-08 05:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:46:08] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2023-03-08 05:46:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:46:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 25 ms returned sat
[2023-03-08 05:46:08] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-08 05:46:08] [INFO ] Added : 198 causal constraints over 40 iterations in 759 ms. Result :sat
Minimization took 122 ms.
[2023-03-08 05:46:09] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:46:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:46:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:46:09] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-08 05:46:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:46:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:46:09] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 35 ms returned sat
[2023-03-08 05:46:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:46:09] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2023-03-08 05:46:09] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-08 05:46:09] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2023-03-08 05:46:09] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2023-03-08 05:46:09] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2023-03-08 05:46:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 217 ms
[2023-03-08 05:46:09] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-08 05:46:10] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2023-03-08 05:46:10] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2023-03-08 05:46:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2023-03-08 05:46:10] [INFO ] Added : 238 causal constraints over 48 iterations in 1027 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 10 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 10 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-08 05:46:11] [INFO ] Invariant cache hit.
[2023-03-08 05:46:11] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-08 05:46:11] [INFO ] Invariant cache hit.
[2023-03-08 05:46:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:46:12] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2023-03-08 05:46:12] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-08 05:46:12] [INFO ] Invariant cache hit.
[2023-03-08 05:46:12] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 790 ms. Remains : 311/311 places, 253/253 transitions.
Starting property specific reduction for DES-PT-50a-UpperBounds-00
[2023-03-08 05:46:12] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 05:46:12] [INFO ] Invariant cache hit.
[2023-03-08 05:46:12] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:46:12] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:46:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:46:12] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2023-03-08 05:46:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:46:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:46:12] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 45 ms returned sat
[2023-03-08 05:46:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:46:12] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2023-03-08 05:46:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:46:12] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2023-03-08 05:46:12] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 05:46:13] [INFO ] Added : 198 causal constraints over 40 iterations in 733 ms. Result :sat
Minimization took 118 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 10 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 311/311 places, 253/253 transitions.
[2023-03-08 05:46:14] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13654 resets, run finished after 1954 ms. (steps per millisecond=511 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2251 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 1) seen :0
[2023-03-08 05:46:16] [INFO ] Invariant cache hit.
[2023-03-08 05:46:17] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:46:17] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 28 ms returned sat
[2023-03-08 05:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:46:17] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-08 05:46:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:46:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:46:17] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 46 ms returned sat
[2023-03-08 05:46:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:46:17] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2023-03-08 05:46:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:46:17] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2023-03-08 05:46:17] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 05:46:18] [INFO ] Added : 198 causal constraints over 40 iterations in 722 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 20 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-08 05:46:18] [INFO ] Invariant cache hit.
[2023-03-08 05:46:18] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-08 05:46:18] [INFO ] Invariant cache hit.
[2023-03-08 05:46:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:46:19] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2023-03-08 05:46:19] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 05:46:19] [INFO ] Invariant cache hit.
[2023-03-08 05:46:19] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 768 ms. Remains : 311/311 places, 253/253 transitions.
Ending property specific reduction for DES-PT-50a-UpperBounds-00 in 7187 ms.
Starting property specific reduction for DES-PT-50a-UpperBounds-02
[2023-03-08 05:46:19] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 05:46:19] [INFO ] Invariant cache hit.
[2023-03-08 05:46:19] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:46:19] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:46:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:46:19] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-08 05:46:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:46:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:46:19] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2023-03-08 05:46:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:46:19] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-08 05:46:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:46:19] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2023-03-08 05:46:20] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2023-03-08 05:46:20] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2023-03-08 05:46:20] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2023-03-08 05:46:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2023-03-08 05:46:20] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-08 05:46:21] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 0 ms to minimize.
[2023-03-08 05:46:21] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2023-03-08 05:46:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2023-03-08 05:46:21] [INFO ] Added : 238 causal constraints over 48 iterations in 1050 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 311/311 places, 253/253 transitions.
[2023-03-08 05:46:21] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13658 resets, run finished after 1845 ms. (steps per millisecond=542 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2278 resets, run finished after 871 ms. (steps per millisecond=1148 ) properties (out of 1) seen :0
[2023-03-08 05:46:24] [INFO ] Invariant cache hit.
[2023-03-08 05:46:24] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:46:24] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:46:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:46:24] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-08 05:46:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:46:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:46:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 39 ms returned sat
[2023-03-08 05:46:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:46:24] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-08 05:46:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:46:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-08 05:46:24] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2023-03-08 05:46:25] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-03-08 05:46:25] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 4 ms to minimize.
[2023-03-08 05:46:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 236 ms
[2023-03-08 05:46:25] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 05:46:26] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 0 ms to minimize.
[2023-03-08 05:46:26] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 0 ms to minimize.
[2023-03-08 05:46:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2023-03-08 05:46:26] [INFO ] Added : 238 causal constraints over 48 iterations in 1052 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-08 05:46:26] [INFO ] Invariant cache hit.
[2023-03-08 05:46:26] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-08 05:46:26] [INFO ] Invariant cache hit.
[2023-03-08 05:46:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:46:27] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2023-03-08 05:46:27] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 05:46:27] [INFO ] Invariant cache hit.
[2023-03-08 05:46:27] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 804 ms. Remains : 311/311 places, 253/253 transitions.
Ending property specific reduction for DES-PT-50a-UpperBounds-02 in 8042 ms.
[2023-03-08 05:46:27] [INFO ] Flatten gal took : 62 ms
[2023-03-08 05:46:27] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 7 ms.
[2023-03-08 05:46:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 311 places, 253 transitions and 1219 arcs took 3 ms.
Total runtime 71215 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-50a
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
Upper Bounds

FORMULA DES-PT-50a-UpperBounds-02 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-UpperBounds-00 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678254389146

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 8 (type EXCL) for 3 DES-PT-50a-UpperBounds-02
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 3 DES-PT-50a-UpperBounds-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 3 DES-PT-50a-UpperBounds-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 6 (type FNDP) for DES-PT-50a-UpperBounds-02
lola: fired transitions : 2252
lola: tried executions : 1
lola: time used : 0.000000
lola: REPORT NUM
lola: FINISHED task # 8 (type EXCL) for DES-PT-50a-UpperBounds-02
lola: markings : 2254
lola: fired transitions : 2253
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 7 (type EQUN) for DES-PT-50a-UpperBounds-02 (obsolete)
sara: try reading problem file /home/mcc/execution/374/UpperBounds-7.sara.
sara: place or transition ordering is non-deterministic
lola: LAUNCH task # 11 (type EXCL) for 0 DES-PT-50a-UpperBounds-00
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 0 DES-PT-50a-UpperBounds-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 0 DES-PT-50a-UpperBounds-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
sara: try reading problem file /home/mcc/execution/374/UpperBounds-10.sara.
sara: place or transition ordering is non-deterministic
lola: REPORT NUM
lola: FINISHED task # 11 (type EXCL) for DES-PT-50a-UpperBounds-00
lola: markings : 45155
lola: fired transitions : 55021
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 9 (type FNDP) for DES-PT-50a-UpperBounds-00 (obsolete)
lola: CANCELED task # 10 (type EQUN) for DES-PT-50a-UpperBounds-00 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50a-UpperBounds-00: BOUND 1 state space
DES-PT-50a-UpperBounds-02: BOUND 1 findpath


Time elapsed: 1 secs. Pages in use: 1

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="DES-PT-50a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DES-PT-50a, 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 r103-tall-167814478400477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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