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.r139-smll-167819423400541.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 smartxred
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 r139-smll-167819423400541
=====================================================================

--------------------
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 1678469542320

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s2
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-10 17:32:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 17:32:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 17:32:25] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2023-03-10 17:32:25] [INFO ] Transformed 184 places.
[2023-03-10 17:32:25] [INFO ] Transformed 1832 transitions.
[2023-03-10 17:32:25] [INFO ] Parsed PT model containing 184 places and 1832 transitions and 7424 arcs in 387 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-10 17:32:25] [INFO ] Computed 4 place invariants in 55 ms
Incomplete random walk after 10007 steps, including 102 resets, run finished after 75 ms. (steps per millisecond=133 ) 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-12 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 20 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :5
FORMULA DoubleLock-PT-p2s2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-10 17:32:25] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
// Phase 1: matrix 1225 rows 148 cols
[2023-03-10 17:32:25] [INFO ] Computed 4 place invariants in 19 ms
[2023-03-10 17:32:25] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-10 17:32:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-10 17:32:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:26] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2023-03-10 17:32:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:32:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 17:32:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 17:32:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:26] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2023-03-10 17:32:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 17:32:26] [INFO ] [Nat]Added 116 Read/Feed constraints in 206 ms returned sat
[2023-03-10 17:32:27] [INFO ] Deduced a trap composed of 72 places in 320 ms of which 4 ms to minimize.
[2023-03-10 17:32:27] [INFO ] Deduced a trap composed of 67 places in 339 ms of which 1 ms to minimize.
[2023-03-10 17:32:27] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 1 ms to minimize.
[2023-03-10 17:32:28] [INFO ] Deduced a trap composed of 66 places in 273 ms of which 2 ms to minimize.
[2023-03-10 17:32:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1440 ms
[2023-03-10 17:32:28] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 215 ms.
[2023-03-10 17:32:28] [INFO ] Added : 0 causal constraints over 0 iterations in 316 ms. Result :sat
Minimization took 294 ms.
[2023-03-10 17:32:28] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 17:32:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 17:32:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:29] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2023-03-10 17:32:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:32:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 17:32:29] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 17:32:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:29] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2023-03-10 17:32:30] [INFO ] [Nat]Added 116 Read/Feed constraints in 451 ms returned sat
[2023-03-10 17:32:30] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 119 ms.
[2023-03-10 17:32:30] [INFO ] Added : 0 causal constraints over 0 iterations in 224 ms. Result :sat
Minimization took 306 ms.
[2023-03-10 17:32:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 17:32:30] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 17:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:31] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2023-03-10 17:32:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:32:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 17:32:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 17:32:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:31] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2023-03-10 17:32:31] [INFO ] [Nat]Added 116 Read/Feed constraints in 229 ms returned sat
[2023-03-10 17:32:31] [INFO ] Deduced a trap composed of 58 places in 249 ms of which 1 ms to minimize.
[2023-03-10 17:32:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-10 17:32:32] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 114 ms.
[2023-03-10 17:32:32] [INFO ] Added : 0 causal constraints over 0 iterations in 211 ms. Result :sat
Minimization took 228 ms.
Current structural bounds on expressions (after SMT) : [-1, 10, -1] Max seen :[1, 8, 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.9 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 149 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 150 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-10 17:32:32] [INFO ] Computed 3 place invariants in 9 ms
Incomplete random walk after 1000002 steps, including 10219 resets, run finished after 1731 ms. (steps per millisecond=577 ) 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 1971 resets, run finished after 682 ms. (steps per millisecond=1466 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 1935 resets, run finished after 616 ms. (steps per millisecond=1623 ) properties (out of 2) seen :2
[2023-03-10 17:32:35] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 17:32:35] [INFO ] Computed 3 place invariants in 14 ms
[2023-03-10 17:32:35] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-10 17:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:36] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2023-03-10 17:32:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:32:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 17:32:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:36] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2023-03-10 17:32:36] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 17:32:36] [INFO ] [Nat]Added 116 Read/Feed constraints in 152 ms returned sat
[2023-03-10 17:32:37] [INFO ] Deduced a trap composed of 62 places in 192 ms of which 1 ms to minimize.
[2023-03-10 17:32:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-10 17:32:37] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 101 ms.
[2023-03-10 17:32:37] [INFO ] Added : 0 causal constraints over 0 iterations in 186 ms. Result :sat
Minimization took 253 ms.
[2023-03-10 17:32:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 17:32:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:37] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2023-03-10 17:32:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:32:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 17:32:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:38] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2023-03-10 17:32:38] [INFO ] [Nat]Added 116 Read/Feed constraints in 331 ms returned sat
[2023-03-10 17:32:38] [INFO ] Deduced a trap composed of 54 places in 329 ms of which 1 ms to minimize.
[2023-03-10 17:32:39] [INFO ] Deduced a trap composed of 67 places in 330 ms of which 1 ms to minimize.
[2023-03-10 17:32:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 753 ms
[2023-03-10 17:32:39] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 104 ms.
[2023-03-10 17:32:39] [INFO ] Added : 0 causal constraints over 0 iterations in 186 ms. Result :sat
Minimization took 267 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[2, 3]
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 57 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 58 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-10 17:32:40] [INFO ] Computed 3 place invariants in 11 ms
Incomplete random walk after 1000005 steps, including 10163 resets, run finished after 1641 ms. (steps per millisecond=609 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 1949 resets, run finished after 611 ms. (steps per millisecond=1636 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 1974 resets, run finished after 614 ms. (steps per millisecond=1628 ) properties (out of 2) seen :3
[2023-03-10 17:32:43] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 17:32:43] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-10 17:32:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 17:32:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:43] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2023-03-10 17:32:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:32:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 17:32:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:43] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2023-03-10 17:32:43] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 17:32:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 17:32:47] [INFO ] [Nat]Added 116 Read/Feed constraints in 3608 ms returned sat
[2023-03-10 17:32:47] [INFO ] Deduced a trap composed of 59 places in 241 ms of which 1 ms to minimize.
[2023-03-10 17:32:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2023-03-10 17:32:47] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 102 ms.
[2023-03-10 17:32:47] [INFO ] Added : 0 causal constraints over 0 iterations in 194 ms. Result :sat
Minimization took 184 ms.
[2023-03-10 17:32:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 17:32:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:48] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2023-03-10 17:32:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:32:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 17:32:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:48] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2023-03-10 17:32:48] [INFO ] [Nat]Added 116 Read/Feed constraints in 329 ms returned sat
[2023-03-10 17:32:49] [INFO ] Deduced a trap composed of 54 places in 264 ms of which 1 ms to minimize.
[2023-03-10 17:32:49] [INFO ] Deduced a trap composed of 67 places in 259 ms of which 0 ms to minimize.
[2023-03-10 17:32:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 623 ms
[2023-03-10 17:32:49] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 103 ms.
[2023-03-10 17:32:49] [INFO ] Added : 0 causal constraints over 0 iterations in 189 ms. Result :sat
Minimization took 297 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[3, 3]
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 59 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 64 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 58 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-10 17:32:50] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:32:50] [INFO ] Invariant cache hit.
[2023-03-10 17:32:50] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-10 17:32:50] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:32:50] [INFO ] Invariant cache hit.
[2023-03-10 17:32:51] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 17:32:51] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
[2023-03-10 17:32:52] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-10 17:32:52] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:32:52] [INFO ] Invariant cache hit.
[2023-03-10 17:32:53] [INFO ] Dead Transitions using invariants and state equation in 954 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2637 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-10 17:32:53] [INFO ] Computed 3 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 10171 resets, run finished after 1686 ms. (steps per millisecond=593 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 1935 resets, run finished after 626 ms. (steps per millisecond=1597 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1928 resets, run finished after 620 ms. (steps per millisecond=1612 ) properties (out of 2) seen :2
[2023-03-10 17:32:56] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 17:32:56] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-10 17:32:56] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-10 17:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:56] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2023-03-10 17:32:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:32:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 17:32:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:56] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2023-03-10 17:32:56] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 17:32:59] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 17:33:00] [INFO ] [Nat]Added 116 Read/Feed constraints in 4026 ms returned sat
[2023-03-10 17:33:00] [INFO ] Deduced a trap composed of 62 places in 149 ms of which 1 ms to minimize.
[2023-03-10 17:33:01] [INFO ] Deduced a trap composed of 62 places in 145 ms of which 0 ms to minimize.
[2023-03-10 17:33:01] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 1 ms to minimize.
[2023-03-10 17:33:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 542 ms
[2023-03-10 17:33:01] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 98 ms.
[2023-03-10 17:33:01] [INFO ] Added : 0 causal constraints over 0 iterations in 182 ms. Result :sat
Minimization took 350 ms.
[2023-03-10 17:33:01] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 17:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:02] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2023-03-10 17:33:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:33:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 17:33:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:02] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2023-03-10 17:33:02] [INFO ] [Nat]Added 116 Read/Feed constraints in 380 ms returned sat
[2023-03-10 17:33:03] [INFO ] Deduced a trap composed of 54 places in 235 ms of which 1 ms to minimize.
[2023-03-10 17:33:03] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 1 ms to minimize.
[2023-03-10 17:33:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 600 ms
[2023-03-10 17:33:03] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 113 ms.
[2023-03-10 17:33:03] [INFO ] Added : 0 causal constraints over 0 iterations in 222 ms. Result :sat
Minimization took 440 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[3, 3]
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 35 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 36 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 33 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-10 17:33:04] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:33:04] [INFO ] Invariant cache hit.
[2023-03-10 17:33:04] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-10 17:33:04] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:33:04] [INFO ] Invariant cache hit.
[2023-03-10 17:33:04] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 17:33:05] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
[2023-03-10 17:33:06] [INFO ] Redundant transitions in 122 ms returned []
[2023-03-10 17:33:06] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:33:06] [INFO ] Invariant cache hit.
[2023-03-10 17:33:06] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2462 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-10 17:33:06] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 101 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2023-03-10 17:33:06] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 17:33:06] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-10 17:33:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 17:33:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:07] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2023-03-10 17:33:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:33:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 17:33:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:07] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2023-03-10 17:33:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 17:33:07] [INFO ] [Nat]Added 116 Read/Feed constraints in 154 ms returned sat
[2023-03-10 17:33:07] [INFO ] Deduced a trap composed of 70 places in 233 ms of which 0 ms to minimize.
[2023-03-10 17:33:08] [INFO ] Deduced a trap composed of 62 places in 138 ms of which 1 ms to minimize.
[2023-03-10 17:33:08] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 0 ms to minimize.
[2023-03-10 17:33:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 589 ms
[2023-03-10 17:33:08] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 99 ms.
[2023-03-10 17:33:08] [INFO ] Added : 0 causal constraints over 0 iterations in 177 ms. Result :sat
Minimization took 258 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 28 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 29 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-10 17:33:08] [INFO ] Computed 3 place invariants in 14 ms
Incomplete random walk after 1000001 steps, including 10182 resets, run finished after 1604 ms. (steps per millisecond=623 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 1934 resets, run finished after 693 ms. (steps per millisecond=1443 ) properties (out of 1) seen :3
[2023-03-10 17:33:11] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 17:33:11] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-10 17:33:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 17:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:11] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2023-03-10 17:33:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:33:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 17:33:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:11] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2023-03-10 17:33:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 17:33:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 17:33:15] [INFO ] [Nat]Added 116 Read/Feed constraints in 3232 ms returned sat
[2023-03-10 17:33:15] [INFO ] Deduced a trap composed of 62 places in 416 ms of which 1 ms to minimize.
[2023-03-10 17:33:16] [INFO ] Deduced a trap composed of 60 places in 439 ms of which 1 ms to minimize.
[2023-03-10 17:33:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 969 ms
[2023-03-10 17:33:16] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 149 ms.
[2023-03-10 17:33:16] [INFO ] Added : 0 causal constraints over 0 iterations in 258 ms. Result :sat
Minimization took 197 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 44 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 44 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 48 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-10 17:33:16] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:33:16] [INFO ] Invariant cache hit.
[2023-03-10 17:33:17] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-10 17:33:17] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:33:17] [INFO ] Invariant cache hit.
[2023-03-10 17:33:17] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 17:33:18] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
[2023-03-10 17:33:18] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-10 17:33:18] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:33:18] [INFO ] Invariant cache hit.
[2023-03-10 17:33:19] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2528 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-10 17:33:19] [INFO ] Computed 3 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 10173 resets, run finished after 1803 ms. (steps per millisecond=554 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1955 resets, run finished after 618 ms. (steps per millisecond=1618 ) properties (out of 1) seen :2
[2023-03-10 17:33:21] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 17:33:21] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-10 17:33:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 17:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:22] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2023-03-10 17:33:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:33:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 17:33:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:22] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2023-03-10 17:33:22] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 17:33:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 17:33:26] [INFO ] [Nat]Added 116 Read/Feed constraints in 3628 ms returned sat
[2023-03-10 17:33:26] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 151 ms.
[2023-03-10 17:33:26] [INFO ] Added : 0 causal constraints over 0 iterations in 278 ms. Result :sat
Minimization took 466 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 44 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 44 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 43 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-10 17:33:27] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:33:27] [INFO ] Invariant cache hit.
[2023-03-10 17:33:27] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-10 17:33:27] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:33:27] [INFO ] Invariant cache hit.
[2023-03-10 17:33:27] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 17:33:28] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 1824 ms to find 0 implicit places.
[2023-03-10 17:33:28] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-10 17:33:28] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:33:28] [INFO ] Invariant cache hit.
[2023-03-10 17:33:30] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2947 ms. Remains : 143/143 places, 1704/1704 transitions.
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-07 in 23091 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-10 17:33:30] [INFO ] Computed 3 place invariants in 4 ms
Incomplete random walk after 10002 steps, including 103 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2023-03-10 17:33:30] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 17:33:30] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-10 17:33:30] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 17:33:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:30] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2023-03-10 17:33:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:33:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 17:33:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:30] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2023-03-10 17:33:30] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 17:33:30] [INFO ] [Nat]Added 116 Read/Feed constraints in 86 ms returned sat
[2023-03-10 17:33:31] [INFO ] Deduced a trap composed of 60 places in 276 ms of which 1 ms to minimize.
[2023-03-10 17:33:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
[2023-03-10 17:33:31] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 118 ms.
[2023-03-10 17:33:31] [INFO ] Added : 0 causal constraints over 0 iterations in 225 ms. Result :sat
Minimization took 349 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 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 43 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-10 17:33:31] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000004 steps, including 10158 resets, run finished after 2154 ms. (steps per millisecond=464 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 1957 resets, run finished after 667 ms. (steps per millisecond=1499 ) properties (out of 1) seen :2
[2023-03-10 17:33:34] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 17:33:34] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-10 17:33:34] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 17:33:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:35] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2023-03-10 17:33:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:33:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 17:33:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:35] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2023-03-10 17:33:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 17:33:35] [INFO ] [Nat]Added 116 Read/Feed constraints in 437 ms returned sat
[2023-03-10 17:33:36] [INFO ] Deduced a trap composed of 73 places in 383 ms of which 1 ms to minimize.
[2023-03-10 17:33:36] [INFO ] Deduced a trap composed of 78 places in 435 ms of which 1 ms to minimize.
[2023-03-10 17:33:37] [INFO ] Deduced a trap composed of 80 places in 381 ms of which 1 ms to minimize.
[2023-03-10 17:33:37] [INFO ] Deduced a trap composed of 83 places in 379 ms of which 1 ms to minimize.
[2023-03-10 17:33:37] [INFO ] Deduced a trap composed of 62 places in 275 ms of which 1 ms to minimize.
[2023-03-10 17:33:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2149 ms
[2023-03-10 17:33:38] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 162 ms.
[2023-03-10 17:33:38] [INFO ] Added : 0 causal constraints over 0 iterations in 296 ms. Result :sat
Minimization took 403 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 37 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-10 17:33:39] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:33:39] [INFO ] Invariant cache hit.
[2023-03-10 17:33:39] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-10 17:33:39] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:33:39] [INFO ] Invariant cache hit.
[2023-03-10 17:33:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 17:33:40] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
[2023-03-10 17:33:40] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-10 17:33:40] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:33:40] [INFO ] Invariant cache hit.
[2023-03-10 17:33:42] [INFO ] Dead Transitions using invariants and state equation in 1527 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3462 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-10 17:33:42] [INFO ] Computed 3 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 10160 resets, run finished after 1735 ms. (steps per millisecond=576 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1958 resets, run finished after 904 ms. (steps per millisecond=1106 ) properties (out of 1) seen :2
[2023-03-10 17:33:45] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 17:33:45] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-10 17:33:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 17:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:45] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2023-03-10 17:33:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:33:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 17:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:45] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2023-03-10 17:33:45] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 17:33:46] [INFO ] [Nat]Added 116 Read/Feed constraints in 448 ms returned sat
[2023-03-10 17:33:46] [INFO ] Deduced a trap composed of 73 places in 438 ms of which 1 ms to minimize.
[2023-03-10 17:33:47] [INFO ] Deduced a trap composed of 78 places in 443 ms of which 1 ms to minimize.
[2023-03-10 17:33:47] [INFO ] Deduced a trap composed of 80 places in 367 ms of which 1 ms to minimize.
[2023-03-10 17:33:48] [INFO ] Deduced a trap composed of 83 places in 351 ms of which 1 ms to minimize.
[2023-03-10 17:33:48] [INFO ] Deduced a trap composed of 62 places in 261 ms of which 0 ms to minimize.
[2023-03-10 17:33:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2147 ms
[2023-03-10 17:33:48] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 156 ms.
[2023-03-10 17:33:48] [INFO ] Added : 0 causal constraints over 0 iterations in 289 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 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 40 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-10 17:33:49] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:33:49] [INFO ] Invariant cache hit.
[2023-03-10 17:33:49] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-10 17:33:49] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:33:49] [INFO ] Invariant cache hit.
[2023-03-10 17:33:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 17:33:51] [INFO ] Implicit Places using invariants and state equation in 1774 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
[2023-03-10 17:33:51] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-10 17:33:51] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-10 17:33:51] [INFO ] Invariant cache hit.
[2023-03-10 17:33:52] [INFO ] Dead Transitions using invariants and state equation in 1061 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3333 ms. Remains : 143/143 places, 1704/1704 transitions.
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-13 in 22816 ms.
[2023-03-10 17:33:53] [INFO ] Flatten gal took : 382 ms
[2023-03-10 17:33:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-10 17:33:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 143 places, 1704 transitions and 6880 arcs took 16 ms.
Total runtime 88799 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DoubleLock (PT), instance p2s2
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 143 places, 1704 transitions, 6880 arcs.
Final Score: 25849.619
Took : 24 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 1192080 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102712 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
Caught signal 15, terminating.

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="smartxred"
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 smartxred"
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 r139-smll-167819423400541"
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 ;