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.r159-smll-167819445200068.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 gold2022
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 r159-smll-167819445200068
=====================================================================

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

Running Version 202205111006
[2023-03-10 20:33:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 20:33:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 20:33:05] [INFO ] Load time of PNML (sax parser for PT used): 497 ms
[2023-03-10 20:33:05] [INFO ] Transformed 184 places.
[2023-03-10 20:33:05] [INFO ] Transformed 1832 transitions.
[2023-03-10 20:33:05] [INFO ] Parsed PT model containing 184 places and 1832 transitions in 760 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Deduced a syphon composed of 36 places in 16 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 20:33:05] [INFO ] Computed 4 place invariants in 55 ms
Incomplete random walk after 10006 steps, including 103 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :18
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 21 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :5
FORMULA DoubleLock-PT-p2s2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :6
FORMULA DoubleLock-PT-p2s2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-10 20:33:05] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
// Phase 1: matrix 1225 rows 148 cols
[2023-03-10 20:33:05] [INFO ] Computed 4 place invariants in 14 ms
[2023-03-10 20:33:05] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-10 20:33:05] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-10 20:33:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:06] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2023-03-10 20:33:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:33:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-10 20:33:06] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-10 20:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:07] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2023-03-10 20:33:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 20:33:07] [INFO ] [Nat]Added 116 Read/Feed constraints in 228 ms returned sat
[2023-03-10 20:33:07] [INFO ] Deduced a trap composed of 59 places in 460 ms of which 20 ms to minimize.
[2023-03-10 20:33:08] [INFO ] Deduced a trap composed of 61 places in 359 ms of which 3 ms to minimize.
[2023-03-10 20:33:08] [INFO ] Deduced a trap composed of 72 places in 396 ms of which 2 ms to minimize.
[2023-03-10 20:33:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1547 ms
[2023-03-10 20:33:09] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 282 ms.
[2023-03-10 20:33:09] [INFO ] Added : 0 causal constraints over 0 iterations in 469 ms. Result :sat
Minimization took 313 ms.
[2023-03-10 20:33:09] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 20:33:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 20:33:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:10] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2023-03-10 20:33:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:33:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 20:33:10] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 20:33:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:10] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2023-03-10 20:33:11] [INFO ] [Nat]Added 116 Read/Feed constraints in 625 ms returned sat
[2023-03-10 20:33:11] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 3 ms to minimize.
[2023-03-10 20:33:11] [INFO ] Deduced a trap composed of 73 places in 293 ms of which 2 ms to minimize.
[2023-03-10 20:33:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 635 ms
[2023-03-10 20:33:11] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 145 ms.
[2023-03-10 20:33:11] [INFO ] Added : 0 causal constraints over 0 iterations in 278 ms. Result :sat
Minimization took 301 ms.
[2023-03-10 20:33:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 20:33:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-10 20:33:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:12] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2023-03-10 20:33:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:33:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 20:33:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 20:33:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:13] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2023-03-10 20:33:14] [INFO ] [Nat]Added 116 Read/Feed constraints in 936 ms returned sat
[2023-03-10 20:33:14] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 1 ms to minimize.
[2023-03-10 20:33:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 372 ms
[2023-03-10 20:33:14] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 137 ms.
[2023-03-10 20:33:14] [INFO ] Added : 0 causal constraints over 0 iterations in 280 ms. Result :sat
Minimization took 460 ms.
Current structural bounds on expressions (after SMT) : [-1, 10, -1] Max seen :[1, 6, 2]
Support contains 3 out of 148 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.15 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 223 ms. Remains 143 /148 variables (removed 5) and now considering 1704/1768 (removed 64) transitions.
Finished structural reductions, in 1 iterations. 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 20:33:16] [INFO ] Computed 3 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 10148 resets, run finished after 2210 ms. (steps per millisecond=452 ) 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 1948 resets, run finished after 957 ms. (steps per millisecond=1044 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1954 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 2) seen :3
[2023-03-10 20:33:20] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:33:20] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-10 20:33:20] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 20:33:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:20] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2023-03-10 20:33:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:33:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 20:33:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:20] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2023-03-10 20:33:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 20:33:21] [INFO ] [Nat]Added 116 Read/Feed constraints in 647 ms returned sat
[2023-03-10 20:33:21] [INFO ] Deduced a trap composed of 42 places in 259 ms of which 1 ms to minimize.
[2023-03-10 20:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2023-03-10 20:33:22] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 167 ms.
[2023-03-10 20:33:22] [INFO ] Added : 0 causal constraints over 0 iterations in 296 ms. Result :sat
Minimization took 906 ms.
[2023-03-10 20:33:23] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 20:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:23] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2023-03-10 20:33:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:33:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 20:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:24] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2023-03-10 20:33:24] [INFO ] [Nat]Added 116 Read/Feed constraints in 272 ms returned sat
[2023-03-10 20:33:24] [INFO ] Deduced a trap composed of 54 places in 254 ms of which 1 ms to minimize.
[2023-03-10 20:33:24] [INFO ] Deduced a trap composed of 67 places in 337 ms of which 1 ms to minimize.
[2023-03-10 20:33:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 691 ms
[2023-03-10 20:33:25] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 148 ms.
[2023-03-10 20:33:25] [INFO ] Added : 0 causal constraints over 0 iterations in 260 ms. Result :sat
Minimization took 233 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 SAFETY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 61 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions, in 1 iterations. 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 20:33:29] [INFO ] Computed 3 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 10167 resets, run finished after 2147 ms. (steps per millisecond=465 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000000 steps, including 1982 resets, run finished after 661 ms. (steps per millisecond=1512 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 1942 resets, run finished after 672 ms. (steps per millisecond=1488 ) properties (out of 2) seen :3
[2023-03-10 20:33:33] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:33:33] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-10 20:33:33] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-10 20:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:33] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2023-03-10 20:33:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:33:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 20:33:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:33] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2023-03-10 20:33:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 20:33:34] [INFO ] [Nat]Added 116 Read/Feed constraints in 649 ms returned sat
[2023-03-10 20:33:34] [INFO ] Deduced a trap composed of 42 places in 296 ms of which 0 ms to minimize.
[2023-03-10 20:33:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2023-03-10 20:33:34] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 133 ms.
[2023-03-10 20:33:34] [INFO ] Added : 0 causal constraints over 0 iterations in 248 ms. Result :sat
Minimization took 1178 ms.
[2023-03-10 20:33:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 20:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:36] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2023-03-10 20:33:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:33:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-10 20:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:36] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2023-03-10 20:33:37] [INFO ] [Nat]Added 116 Read/Feed constraints in 322 ms returned sat
[2023-03-10 20:33:37] [INFO ] Deduced a trap composed of 54 places in 256 ms of which 1 ms to minimize.
[2023-03-10 20:33:37] [INFO ] Deduced a trap composed of 67 places in 256 ms of which 0 ms to minimize.
[2023-03-10 20:33:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 638 ms
[2023-03-10 20:33:38] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 120 ms.
[2023-03-10 20:33:38] [INFO ] Added : 0 causal constraints over 0 iterations in 237 ms. Result :sat
Minimization took 370 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 SAFETY 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.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in SAFETY 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 20:33:41] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:33:41] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-10 20:33:42] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-10 20:33:42] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:33:42] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-10 20:33:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 20:33:43] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1348 ms to find 0 implicit places.
[2023-03-10 20:33:43] [INFO ] Redundant transitions in 168 ms returned []
[2023-03-10 20:33:43] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:33:43] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-10 20:33:44] [INFO ] Dead Transitions using invariants and state equation in 1020 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 20:33:44] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 10001 steps, including 104 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-10 20:33:44] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:33:44] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-10 20:33:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 20:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:44] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2023-03-10 20:33:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:33:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-10 20:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:45] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2023-03-10 20:33:45] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 20:33:46] [INFO ] [Nat]Added 116 Read/Feed constraints in 964 ms returned sat
[2023-03-10 20:33:46] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 1 ms to minimize.
[2023-03-10 20:33:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-10 20:33:46] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 108 ms.
[2023-03-10 20:33:46] [INFO ] Added : 0 causal constraints over 0 iterations in 191 ms. Result :sat
Minimization took 1073 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 SAFETY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 26 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions, in 1 iterations. 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 20:33:50] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 10148 resets, run finished after 2226 ms. (steps per millisecond=449 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 1948 resets, run finished after 700 ms. (steps per millisecond=1428 ) properties (out of 1) seen :2
[2023-03-10 20:33:53] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:33:53] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-10 20:33:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 20:33:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:54] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2023-03-10 20:33:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:33:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 20:33:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:33:54] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2023-03-10 20:33:54] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 20:33:55] [INFO ] [Nat]Added 116 Read/Feed constraints in 643 ms returned sat
[2023-03-10 20:33:55] [INFO ] Deduced a trap composed of 42 places in 358 ms of which 0 ms to minimize.
[2023-03-10 20:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 429 ms
[2023-03-10 20:33:55] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 100 ms.
[2023-03-10 20:33:55] [INFO ] Added : 0 causal constraints over 0 iterations in 183 ms. Result :sat
Minimization took 904 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 SAFETY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 29 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 25 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-10 20:34:00] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:34:00] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-10 20:34:00] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-10 20:34:00] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:34:00] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-10 20:34:01] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 20:34:02] [INFO ] Implicit Places using invariants and state equation in 1443 ms returned []
Implicit Place search using SMT with State Equation took 1712 ms to find 0 implicit places.
[2023-03-10 20:34:02] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-10 20:34:02] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:34:02] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-10 20:34:03] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 1704/1704 transitions.
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-07 in 19300 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 20:34:03] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 95 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :1
[2023-03-10 20:34:03] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:34:03] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-10 20:34:03] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 20:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:34:04] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2023-03-10 20:34:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:34:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 20:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:34:04] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2023-03-10 20:34:04] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 20:34:04] [INFO ] [Nat]Added 116 Read/Feed constraints in 220 ms returned sat
[2023-03-10 20:34:05] [INFO ] Deduced a trap composed of 54 places in 322 ms of which 1 ms to minimize.
[2023-03-10 20:34:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 407 ms
[2023-03-10 20:34:05] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 101 ms.
[2023-03-10 20:34:05] [INFO ] Added : 0 causal constraints over 0 iterations in 185 ms. Result :sat
Minimization took 208 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 SAFETY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 26 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions, in 1 iterations. 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 20:34:05] [INFO ] Computed 3 place invariants in 8 ms
Incomplete random walk after 1000008 steps, including 10163 resets, run finished after 1756 ms. (steps per millisecond=569 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1933 resets, run finished after 676 ms. (steps per millisecond=1479 ) properties (out of 1) seen :2
[2023-03-10 20:34:08] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:34:08] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-10 20:34:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 20:34:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:34:08] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2023-03-10 20:34:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:34:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 20:34:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:34:08] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2023-03-10 20:34:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 20:34:09] [INFO ] [Nat]Added 116 Read/Feed constraints in 325 ms returned sat
[2023-03-10 20:34:09] [INFO ] Deduced a trap composed of 54 places in 271 ms of which 1 ms to minimize.
[2023-03-10 20:34:09] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 0 ms to minimize.
[2023-03-10 20:34:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 636 ms
[2023-03-10 20:34:10] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 131 ms.
[2023-03-10 20:34:10] [INFO ] Added : 0 causal constraints over 0 iterations in 242 ms. Result :sat
Minimization took 369 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 SAFETY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 25 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 41 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-10 20:34:10] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:34:10] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-10 20:34:11] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-10 20:34:11] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:34:11] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-10 20:34:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 20:34:12] [INFO ] Implicit Places using invariants and state equation in 1577 ms returned []
Implicit Place search using SMT with State Equation took 1923 ms to find 0 implicit places.
[2023-03-10 20:34:12] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-10 20:34:12] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:34:12] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-10 20:34:13] [INFO ] Dead Transitions using invariants and state equation in 1126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 20:34:13] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000003 steps, including 10178 resets, run finished after 2010 ms. (steps per millisecond=497 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1943 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 1) seen :3
[2023-03-10 20:34:16] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:34:16] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-10 20:34:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 20:34:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 20:34:16] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2023-03-10 20:34:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 20:34:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 20:34:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 20:34:17] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2023-03-10 20:34:17] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 20:34:17] [INFO ] [Nat]Added 116 Read/Feed constraints in 214 ms returned sat
[2023-03-10 20:34:17] [INFO ] Deduced a trap composed of 54 places in 322 ms of which 1 ms to minimize.
[2023-03-10 20:34:18] [INFO ] Deduced a trap composed of 67 places in 357 ms of which 0 ms to minimize.
[2023-03-10 20:34:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 775 ms
[2023-03-10 20:34:18] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 103 ms.
[2023-03-10 20:34:18] [INFO ] Added : 0 causal constraints over 0 iterations in 213 ms. Result :sat
Minimization took 235 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 SAFETY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 24 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 24 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-10 20:34:18] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:34:18] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-10 20:34:19] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-10 20:34:19] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:34:19] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-10 20:34:19] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-10 20:34:20] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1294 ms to find 0 implicit places.
[2023-03-10 20:34:20] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-10 20:34:20] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-10 20:34:20] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-10 20:34:21] [INFO ] Dead Transitions using invariants and state equation in 1347 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 1704/1704 transitions.
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-13 in 17904 ms.
[2023-03-10 20:34:22] [INFO ] Flatten gal took : 389 ms
[2023-03-10 20:34:22] [INFO ] Applying decomposition
[2023-03-10 20:34:22] [INFO ] Flatten gal took : 154 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15714956689802569239.txt' '-o' '/tmp/graph15714956689802569239.bin' '-w' '/tmp/graph15714956689802569239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15714956689802569239.bin' '-l' '-1' '-v' '-w' '/tmp/graph15714956689802569239.weights' '-q' '0' '-e' '0.001'
[2023-03-10 20:34:23] [INFO ] Decomposing Gal with order
[2023-03-10 20:34:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 20:34:23] [INFO ] Removed a total of 4071 redundant transitions.
[2023-03-10 20:34:23] [INFO ] Flatten gal took : 389 ms
[2023-03-10 20:34:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 192 labels/synchronizations in 99 ms.
[2023-03-10 20:34:24] [INFO ] Time to serialize gal into /tmp/UpperBounds7538002889986171471.gal : 52 ms
[2023-03-10 20:34:24] [INFO ] Time to serialize properties into /tmp/UpperBounds10329261717750321999.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7538002889986171471.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10329261717750321999.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds10329261717750321999.prop.
Detected timeout of ITS tools.
[2023-03-10 20:54:50] [INFO ] Flatten gal took : 126 ms
[2023-03-10 20:54:50] [INFO ] Time to serialize gal into /tmp/UpperBounds6163753755995573320.gal : 30 ms
[2023-03-10 20:54:50] [INFO ] Time to serialize properties into /tmp/UpperBounds666671161710634179.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6163753755995573320.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds666671161710634179.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...294
Loading property file /tmp/UpperBounds666671161710634179.prop.
Detected timeout of ITS tools.
[2023-03-10 21:15:17] [INFO ] Flatten gal took : 100 ms
[2023-03-10 21:15:17] [INFO ] Input system was already deterministic with 1704 transitions.
[2023-03-10 21:15:17] [INFO ] Transformed 143 places.
[2023-03-10 21:15:17] [INFO ] Transformed 1704 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-10 21:15:18] [INFO ] Time to serialize gal into /tmp/UpperBounds6567052027389187420.gal : 24 ms
[2023-03-10 21:15:18] [INFO ] Time to serialize properties into /tmp/UpperBounds5424412545619990484.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6567052027389187420.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5424412545619990484.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...340
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5424412545619990484.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="gold2022"
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 gold2022"
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 r159-smll-167819445200068"
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 ;