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.r138-smll-167819421000541.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 marciexred
Input is DoubleLock-PT-p2s2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819421000541
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 14:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 14:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 14:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 14:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 14:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 813K 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 DoubleLock-PT-p2s2-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678952781891

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 07:46:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-16 07:46:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 07:46:25] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2023-03-16 07:46:25] [INFO ] Transformed 184 places.
[2023-03-16 07:46:25] [INFO ] Transformed 1832 transitions.
[2023-03-16 07:46:25] [INFO ] Parsed PT model containing 184 places and 1832 transitions and 7424 arcs in 397 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 36 places in 9 ms
Reduce places removed 36 places and 64 transitions.
FORMULA DoubleLock-PT-p2s2-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1225 out of 1768 initially.
// Phase 1: matrix 1225 rows 148 cols
[2023-03-16 07:46:25] [INFO ] Computed 4 place invariants in 66 ms
Incomplete random walk after 10002 steps, including 101 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :20
FORMULA DoubleLock-PT-p2s2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :5
FORMULA DoubleLock-PT-p2s2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :7
FORMULA DoubleLock-PT-p2s2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :4
[2023-03-16 07:46:25] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
// Phase 1: matrix 1225 rows 148 cols
[2023-03-16 07:46:25] [INFO ] Computed 4 place invariants in 18 ms
[2023-03-16 07:46:25] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-16 07:46:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-16 07:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:46:26] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2023-03-16 07:46:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:46:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 07:46:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 07:46:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:46:26] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2023-03-16 07:46:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 07:46:27] [INFO ] [Nat]Added 116 Read/Feed constraints in 210 ms returned sat
[2023-03-16 07:46:27] [INFO ] Deduced a trap composed of 72 places in 453 ms of which 24 ms to minimize.
[2023-03-16 07:46:28] [INFO ] Deduced a trap composed of 67 places in 431 ms of which 1 ms to minimize.
[2023-03-16 07:46:28] [INFO ] Deduced a trap composed of 66 places in 292 ms of which 1 ms to minimize.
[2023-03-16 07:46:28] [INFO ] Deduced a trap composed of 66 places in 411 ms of which 3 ms to minimize.
[2023-03-16 07:46:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1918 ms
[2023-03-16 07:46:29] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 217 ms.
[2023-03-16 07:46:29] [INFO ] Added : 0 causal constraints over 0 iterations in 347 ms. Result :sat
Minimization took 453 ms.
[2023-03-16 07:46:29] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 07:46:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 07:46:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:46:30] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2023-03-16 07:46:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:46:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 07:46:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 07:46:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:46:30] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2023-03-16 07:46:31] [INFO ] [Nat]Added 116 Read/Feed constraints in 615 ms returned sat
[2023-03-16 07:46:31] [INFO ] Deduced a trap composed of 56 places in 352 ms of which 1 ms to minimize.
[2023-03-16 07:46:32] [INFO ] Deduced a trap composed of 29 places in 382 ms of which 1 ms to minimize.
[2023-03-16 07:46:32] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 1 ms to minimize.
[2023-03-16 07:46:33] [INFO ] Deduced a trap composed of 79 places in 288 ms of which 1 ms to minimize.
[2023-03-16 07:46:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2205 ms
[2023-03-16 07:46:33] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 162 ms.
[2023-03-16 07:46:34] [INFO ] Added : 4 causal constraints over 2 iterations in 497 ms. Result :sat
Minimization took 440 ms.
[2023-03-16 07:46:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 07:46:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 07:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:46:34] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2023-03-16 07:46:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:46:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 07:46:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 07:46:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:46:35] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2023-03-16 07:46:35] [INFO ] [Nat]Added 116 Read/Feed constraints in 232 ms returned sat
[2023-03-16 07:46:35] [INFO ] Deduced a trap composed of 58 places in 221 ms of which 1 ms to minimize.
[2023-03-16 07:46:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2023-03-16 07:46:36] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 102 ms.
[2023-03-16 07:46:36] [INFO ] Added : 0 causal constraints over 0 iterations in 198 ms. Result :sat
Minimization took 231 ms.
Current structural bounds on expressions (after SMT) : [-1, 10, -1] Max seen :[1, 9, 1]
Support contains 3 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1768/1768 transitions.
Graph (complete) has 2955 edges and 148 vertex of which 144 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.10 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 144 transition count 1736
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 143 transition count 1704
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 143 transition count 1704
Applied a total of 35 rules in 171 ms. Remains 143 /148 variables (removed 5) and now considering 1704/1768 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 143/148 places, 1704/1768 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 07:46:36] [INFO ] Computed 3 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 10180 resets, run finished after 1835 ms. (steps per millisecond=544 ) properties (out of 3) seen :15
FORMULA DoubleLock-PT-p2s2-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1960 resets, run finished after 708 ms. (steps per millisecond=1412 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 1934 resets, run finished after 689 ms. (steps per millisecond=1451 ) properties (out of 2) seen :4
[2023-03-16 07:46:39] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 07:46:40] [INFO ] Computed 3 place invariants in 25 ms
[2023-03-16 07:46:40] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-16 07:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:46:40] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2023-03-16 07:46:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:46:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 07:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:46:40] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2023-03-16 07:46:40] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 07:46:41] [INFO ] [Nat]Added 116 Read/Feed constraints in 372 ms returned sat
[2023-03-16 07:46:41] [INFO ] Deduced a trap composed of 62 places in 230 ms of which 1 ms to minimize.
[2023-03-16 07:46:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2023-03-16 07:46:41] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 153 ms.
[2023-03-16 07:46:41] [INFO ] Added : 0 causal constraints over 0 iterations in 259 ms. Result :sat
Minimization took 377 ms.
[2023-03-16 07:46:42] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-16 07:46:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:46:42] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2023-03-16 07:46:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:46:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 07:46:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:46:43] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2023-03-16 07:46:43] [INFO ] [Nat]Added 116 Read/Feed constraints in 296 ms returned sat
[2023-03-16 07:46:44] [INFO ] Deduced a trap composed of 73 places in 420 ms of which 1 ms to minimize.
[2023-03-16 07:46:44] [INFO ] Deduced a trap composed of 78 places in 364 ms of which 1 ms to minimize.
[2023-03-16 07:46:44] [INFO ] Deduced a trap composed of 80 places in 380 ms of which 1 ms to minimize.
[2023-03-16 07:46:45] [INFO ] Deduced a trap composed of 83 places in 365 ms of which 1 ms to minimize.
[2023-03-16 07:46:45] [INFO ] Deduced a trap composed of 62 places in 269 ms of which 1 ms to minimize.
[2023-03-16 07:46:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2055 ms
[2023-03-16 07:46:45] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 181 ms.
[2023-03-16 07:46:45] [INFO ] Added : 0 causal constraints over 0 iterations in 297 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[4, 4]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 86 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 07:46:46] [INFO ] Computed 3 place invariants in 8 ms
Incomplete random walk after 1000006 steps, including 10209 resets, run finished after 1896 ms. (steps per millisecond=527 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000000 steps, including 1935 resets, run finished after 708 ms. (steps per millisecond=1412 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 1928 resets, run finished after 617 ms. (steps per millisecond=1620 ) properties (out of 2) seen :2
[2023-03-16 07:46:50] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 07:46:50] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-16 07:46:50] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 07:46:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:46:50] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2023-03-16 07:46:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:46:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 07:46:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:46:50] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2023-03-16 07:46:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 07:46:51] [INFO ] [Nat]Added 116 Read/Feed constraints in 530 ms returned sat
[2023-03-16 07:46:51] [INFO ] Deduced a trap composed of 62 places in 151 ms of which 1 ms to minimize.
[2023-03-16 07:46:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-16 07:46:51] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 94 ms.
[2023-03-16 07:46:51] [INFO ] Added : 0 causal constraints over 0 iterations in 170 ms. Result :sat
Minimization took 488 ms.
[2023-03-16 07:46:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 07:46:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:46:52] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2023-03-16 07:46:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:46:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 07:46:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:46:53] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2023-03-16 07:46:53] [INFO ] [Nat]Added 116 Read/Feed constraints in 323 ms returned sat
[2023-03-16 07:46:53] [INFO ] Deduced a trap composed of 73 places in 249 ms of which 3 ms to minimize.
[2023-03-16 07:46:54] [INFO ] Deduced a trap composed of 78 places in 414 ms of which 1 ms to minimize.
[2023-03-16 07:46:54] [INFO ] Deduced a trap composed of 80 places in 347 ms of which 1 ms to minimize.
[2023-03-16 07:46:55] [INFO ] Deduced a trap composed of 83 places in 349 ms of which 1 ms to minimize.
[2023-03-16 07:46:55] [INFO ] Deduced a trap composed of 62 places in 264 ms of which 0 ms to minimize.
[2023-03-16 07:46:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1885 ms
[2023-03-16 07:46:55] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 144 ms.
[2023-03-16 07:46:55] [INFO ] Added : 0 causal constraints over 0 iterations in 251 ms. Result :sat
Minimization took 262 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[4, 4]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 70 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 68 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-16 07:46:56] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 07:46:56] [INFO ] Invariant cache hit.
[2023-03-16 07:46:56] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-16 07:46:56] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 07:46:56] [INFO ] Invariant cache hit.
[2023-03-16 07:46:57] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 07:46:58] [INFO ] Implicit Places using invariants and state equation in 1433 ms returned []
Implicit Place search using SMT with State Equation took 1758 ms to find 0 implicit places.
[2023-03-16 07:46:58] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-16 07:46:58] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 07:46:58] [INFO ] Invariant cache hit.
[2023-03-16 07:46:59] [INFO ] Dead Transitions using invariants and state equation in 1028 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2995 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-07
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 07:46:59] [INFO ] Computed 3 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 103 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-16 07:46:59] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 07:46:59] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-16 07:46:59] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 07:46:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:46:59] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2023-03-16 07:46:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:46:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 07:46:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:47:00] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2023-03-16 07:47:00] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 07:47:00] [INFO ] [Nat]Added 116 Read/Feed constraints in 170 ms returned sat
[2023-03-16 07:47:00] [INFO ] Deduced a trap composed of 70 places in 428 ms of which 1 ms to minimize.
[2023-03-16 07:47:01] [INFO ] Deduced a trap composed of 62 places in 246 ms of which 1 ms to minimize.
[2023-03-16 07:47:01] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 1 ms to minimize.
[2023-03-16 07:47:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1031 ms
[2023-03-16 07:47:01] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 143 ms.
[2023-03-16 07:47:01] [INFO ] Added : 0 causal constraints over 0 iterations in 278 ms. Result :sat
Minimization took 432 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 86 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 07:47:02] [INFO ] Computed 3 place invariants in 11 ms
Incomplete random walk after 1000001 steps, including 10191 resets, run finished after 1698 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1921 resets, run finished after 821 ms. (steps per millisecond=1218 ) properties (out of 1) seen :2
[2023-03-16 07:47:05] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 07:47:05] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-16 07:47:05] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 07:47:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:47:05] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2023-03-16 07:47:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:47:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 07:47:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:47:05] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2023-03-16 07:47:05] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 07:47:08] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-16 07:47:09] [INFO ] [Nat]Added 116 Read/Feed constraints in 3786 ms returned sat
[2023-03-16 07:47:09] [INFO ] Deduced a trap composed of 67 places in 277 ms of which 1 ms to minimize.
[2023-03-16 07:47:10] [INFO ] Deduced a trap composed of 79 places in 252 ms of which 1 ms to minimize.
[2023-03-16 07:47:10] [INFO ] Deduced a trap composed of 68 places in 263 ms of which 1 ms to minimize.
[2023-03-16 07:47:10] [INFO ] Deduced a trap composed of 61 places in 253 ms of which 1 ms to minimize.
[2023-03-16 07:47:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1198 ms
[2023-03-16 07:47:10] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 129 ms.
[2023-03-16 07:47:11] [INFO ] Added : 0 causal constraints over 0 iterations in 257 ms. Result :sat
Minimization took 336 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 66 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 57 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-16 07:47:11] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 07:47:11] [INFO ] Invariant cache hit.
[2023-03-16 07:47:12] [INFO ] Implicit Places using invariants in 708 ms returned []
[2023-03-16 07:47:12] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 07:47:12] [INFO ] Invariant cache hit.
[2023-03-16 07:47:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 07:47:13] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 2274 ms to find 0 implicit places.
[2023-03-16 07:47:13] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-16 07:47:13] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 07:47:13] [INFO ] Invariant cache hit.
[2023-03-16 07:47:15] [INFO ] Dead Transitions using invariants and state equation in 1350 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3771 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 07:47:15] [INFO ] Computed 3 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 10230 resets, run finished after 1721 ms. (steps per millisecond=581 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 1948 resets, run finished after 610 ms. (steps per millisecond=1639 ) properties (out of 1) seen :1
[2023-03-16 07:47:17] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 07:47:17] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-16 07:47:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 07:47:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:47:18] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2023-03-16 07:47:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:47:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 07:47:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:47:18] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2023-03-16 07:47:18] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 07:47:21] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-16 07:47:22] [INFO ] [Nat]Added 116 Read/Feed constraints in 3507 ms returned sat
[2023-03-16 07:47:22] [INFO ] Deduced a trap composed of 54 places in 251 ms of which 1 ms to minimize.
[2023-03-16 07:47:22] [INFO ] Deduced a trap composed of 67 places in 372 ms of which 0 ms to minimize.
[2023-03-16 07:47:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 722 ms
[2023-03-16 07:47:22] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 158 ms.
[2023-03-16 07:47:23] [INFO ] Added : 0 causal constraints over 0 iterations in 280 ms. Result :sat
Minimization took 459 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 40 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 40 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-16 07:47:23] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 07:47:23] [INFO ] Invariant cache hit.
[2023-03-16 07:47:24] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-16 07:47:24] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 07:47:24] [INFO ] Invariant cache hit.
[2023-03-16 07:47:24] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 07:47:25] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 2133 ms to find 0 implicit places.
[2023-03-16 07:47:26] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-16 07:47:26] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 07:47:26] [INFO ] Invariant cache hit.
[2023-03-16 07:47:27] [INFO ] Dead Transitions using invariants and state equation in 1146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3406 ms. Remains : 143/143 places, 1704/1704 transitions.
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-07 in 27616 ms.
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-13
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 07:47:27] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 106 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :1
[2023-03-16 07:47:27] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 07:47:27] [INFO ] Computed 3 place invariants in 12 ms
[2023-03-16 07:47:27] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-16 07:47:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:47:27] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2023-03-16 07:47:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:47:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 07:47:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:47:28] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2023-03-16 07:47:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 07:47:28] [INFO ] [Nat]Added 116 Read/Feed constraints in 116 ms returned sat
[2023-03-16 07:47:28] [INFO ] Deduced a trap composed of 60 places in 312 ms of which 1 ms to minimize.
[2023-03-16 07:47:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 387 ms
[2023-03-16 07:47:28] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 128 ms.
[2023-03-16 07:47:29] [INFO ] Added : 0 causal constraints over 0 iterations in 237 ms. Result :sat
Minimization took 355 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 36 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 07:47:29] [INFO ] Computed 3 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 10147 resets, run finished after 1730 ms. (steps per millisecond=578 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 1965 resets, run finished after 694 ms. (steps per millisecond=1440 ) properties (out of 1) seen :4
[2023-03-16 07:47:32] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 07:47:32] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-16 07:47:32] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-16 07:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:47:32] [INFO ] [Real]Absence check using state equation in 723 ms returned sat
[2023-03-16 07:47:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:47:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-16 07:47:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:47:33] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2023-03-16 07:47:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 07:47:33] [INFO ] [Nat]Added 116 Read/Feed constraints in 450 ms returned sat
[2023-03-16 07:47:34] [INFO ] Deduced a trap composed of 73 places in 385 ms of which 1 ms to minimize.
[2023-03-16 07:47:34] [INFO ] Deduced a trap composed of 78 places in 379 ms of which 1 ms to minimize.
[2023-03-16 07:47:35] [INFO ] Deduced a trap composed of 80 places in 318 ms of which 2 ms to minimize.
[2023-03-16 07:47:35] [INFO ] Deduced a trap composed of 83 places in 281 ms of which 3 ms to minimize.
[2023-03-16 07:47:35] [INFO ] Deduced a trap composed of 62 places in 219 ms of which 1 ms to minimize.
[2023-03-16 07:47:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1857 ms
[2023-03-16 07:47:35] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 118 ms.
[2023-03-16 07:47:35] [INFO ] Added : 0 causal constraints over 0 iterations in 229 ms. Result :sat
Minimization took 402 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 42 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 39 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-16 07:47:36] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 07:47:36] [INFO ] Invariant cache hit.
[2023-03-16 07:47:37] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-16 07:47:37] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 07:47:37] [INFO ] Invariant cache hit.
[2023-03-16 07:47:37] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 07:47:38] [INFO ] Implicit Places using invariants and state equation in 1075 ms returned []
Implicit Place search using SMT with State Equation took 1594 ms to find 0 implicit places.
[2023-03-16 07:47:38] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-16 07:47:38] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 07:47:38] [INFO ] Invariant cache hit.
[2023-03-16 07:47:39] [INFO ] Dead Transitions using invariants and state equation in 1298 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3006 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 07:47:39] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000006 steps, including 10179 resets, run finished after 2282 ms. (steps per millisecond=438 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 1953 resets, run finished after 836 ms. (steps per millisecond=1196 ) properties (out of 1) seen :4
[2023-03-16 07:47:42] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 07:47:42] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-16 07:47:42] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 07:47:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:47:43] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2023-03-16 07:47:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:47:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-16 07:47:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:47:43] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2023-03-16 07:47:43] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 07:47:43] [INFO ] [Nat]Added 116 Read/Feed constraints in 393 ms returned sat
[2023-03-16 07:47:44] [INFO ] Deduced a trap composed of 73 places in 240 ms of which 0 ms to minimize.
[2023-03-16 07:47:44] [INFO ] Deduced a trap composed of 78 places in 248 ms of which 1 ms to minimize.
[2023-03-16 07:47:44] [INFO ] Deduced a trap composed of 80 places in 195 ms of which 1 ms to minimize.
[2023-03-16 07:47:45] [INFO ] Deduced a trap composed of 83 places in 228 ms of which 0 ms to minimize.
[2023-03-16 07:47:45] [INFO ] Deduced a trap composed of 62 places in 161 ms of which 0 ms to minimize.
[2023-03-16 07:47:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1265 ms
[2023-03-16 07:47:45] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 103 ms.
[2023-03-16 07:47:45] [INFO ] Added : 0 causal constraints over 0 iterations in 185 ms. Result :sat
Minimization took 397 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 38 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 37 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-16 07:47:46] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 07:47:46] [INFO ] Invariant cache hit.
[2023-03-16 07:47:46] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-16 07:47:46] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 07:47:46] [INFO ] Invariant cache hit.
[2023-03-16 07:47:46] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 07:47:47] [INFO ] Implicit Places using invariants and state equation in 1509 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
[2023-03-16 07:47:47] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-16 07:47:47] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 07:47:47] [INFO ] Invariant cache hit.
[2023-03-16 07:47:48] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2774 ms. Remains : 143/143 places, 1704/1704 transitions.
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-13 in 21637 ms.
[2023-03-16 07:47:49] [INFO ] Flatten gal took : 247 ms
[2023-03-16 07:47:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-16 07:47:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 143 places, 1704 transitions and 6880 arcs took 13 ms.
Total runtime 84669 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DoubleLock_PT_p2s2
(NrP: 143 NrTr: 1704 NrArc: 6880)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.052sec

net check time: 0m 0.001sec

init dd package: 0m 3.627sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4615920 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098596 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.010sec

1921 1924 2068 2161 2088 2289 2231 2384 2429 2618 2711 2638 2839 2790 3026 2963 3034 3250 3327 3404 3388 3419 3624 3713 3637 3792 3813 3886 3950 4189 4256 4317 4259 4332 4548 4475 4739 4806 4867 4809 4882 5098 5034 5151 5212 5401 5494 5422 5655 5592 5663 5879 5957 6008 6036 6068 6130 6201 6555 6507 6435 6503 6700 6792 6713 7097 7057 6985 7053 7250 7342 7278 7498 7501 7650 7592 7666 7796 7841 8030 8123 8050 8252 8307 8312 8374 8445 8698 8608 8723 8877 8944 9036 8957 9229 9158 9273 9427 9494 9586 9507 9792 9833 9894 9836 10033 10151 10130 10279 10221 10294 10496 10551 10556 10620 10689 10915 10895 10925 11131 11203 11291 11201 11452 11405 11475 11681 11753 11841 11751 12132 12084 12012 12210 12277 12509 12462 12397 12465 12662 12755 12795 12821 12864 12935 13150 13227 13211 13375 13447 13535 13445 13805 13777 13761 13925 13997 14085 13995 14280 14188 14300 14454 14521 14641 14570 14685 14839 14906 14999 14934 15065 15108 15179 15227 15478 15415 15486 15702 15779 15830 15884 16028 15965 16036 16252 16329 16380 16580 16472 16502 16708 16780 16864 16817 16929 17083 17165 17254 17178 17309 17354 17425 17487 17603 17664 17853 17946 17873 18074 18016 18153 18214 18403 18496 18423 18624 18728 18804 18788 18819 19024 19209 19101 19173 19337 19409 19498 19422 19577 19598 19669 19735 19950 19953 20102 20044 20117

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="DoubleLock-PT-p2s2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is DoubleLock-PT-p2s2, 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 r138-smll-167819421000541"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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