Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 37K Apr 30 07:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 182K Apr 30 07:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 318K Apr 30 07:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 30 07:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 28K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 126K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 469K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.8M May 10 09:34 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 PhilosophersDyn-PT-10-UpperBounds-00
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-01
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-02
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-03
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-04
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-05
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-06
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-07
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-08
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-09
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-10
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-11
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-12
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-13
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-14
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652844375819

Running Version 202205111006
[2022-05-18 03:26:16] [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]
[2022-05-18 03:26:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 03:26:17] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2022-05-18 03:26:17] [INFO ] Transformed 170 places.
[2022-05-18 03:26:17] [INFO ] Transformed 2310 transitions.
[2022-05-18 03:26:17] [INFO ] Parsed PT model containing 170 places and 2310 transitions in 334 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Normalized transition count is 1905 out of 2265 initially.
// Phase 1: matrix 1905 rows 170 cols
[2022-05-18 03:26:17] [INFO ] Computed 39 place invariants in 97 ms
FORMULA PhilosophersDyn-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1180 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 15) seen :33
FORMULA PhilosophersDyn-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :27
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :22
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :22
[2022-05-18 03:26:17] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2022-05-18 03:26:18] [INFO ] Computed 39 place invariants in 41 ms
[2022-05-18 03:26:18] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2022-05-18 03:26:18] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 5 ms returned sat
[2022-05-18 03:26:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:26:18] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2022-05-18 03:26:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:26:18] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-18 03:26:18] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-18 03:26:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:26:19] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2022-05-18 03:26:19] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2022-05-18 03:26:19] [INFO ] [Nat]Added 1030 Read/Feed constraints in 225 ms returned sat
[2022-05-18 03:26:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 308 ms.
[2022-05-18 03:26:19] [INFO ] Added : 0 causal constraints over 0 iterations in 472 ms. Result :sat
Minimization took 330 ms.
[2022-05-18 03:26:20] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-18 03:26:20] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-18 03:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:26:20] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2022-05-18 03:26:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:26:20] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2022-05-18 03:26:20] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-18 03:26:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:26:20] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2022-05-18 03:26:21] [INFO ] [Nat]Added 1030 Read/Feed constraints in 292 ms returned sat
[2022-05-18 03:26:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 185 ms.
[2022-05-18 03:26:21] [INFO ] Added : 0 causal constraints over 0 iterations in 327 ms. Result :sat
Minimization took 468 ms.
[2022-05-18 03:26:22] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-18 03:26:22] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-18 03:26:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:26:22] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2022-05-18 03:26:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:26:22] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2022-05-18 03:26:22] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-18 03:26:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:26:22] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2022-05-18 03:26:23] [INFO ] [Nat]Added 1030 Read/Feed constraints in 302 ms returned sat
[2022-05-18 03:26:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 190 ms.
[2022-05-18 03:26:23] [INFO ] Added : 0 causal constraints over 0 iterations in 335 ms. Result :sat
Minimization took 465 ms.
[2022-05-18 03:26:24] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2022-05-18 03:26:24] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-18 03:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:26:24] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2022-05-18 03:26:24] [INFO ] [Real]Added 1030 Read/Feed constraints in 189 ms returned sat
[2022-05-18 03:26:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:26:24] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-18 03:26:24] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 13 ms returned sat
[2022-05-18 03:26:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:26:25] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2022-05-18 03:26:25] [INFO ] [Nat]Added 1030 Read/Feed constraints in 177 ms returned sat
[2022-05-18 03:26:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 174 ms.
[2022-05-18 03:26:25] [INFO ] Added : 0 causal constraints over 0 iterations in 310 ms. Result :sat
Minimization took 506 ms.
[2022-05-18 03:26:26] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-18 03:26:26] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-18 03:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:26:26] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2022-05-18 03:26:26] [INFO ] [Real]Added 1030 Read/Feed constraints in 205 ms returned sat
[2022-05-18 03:26:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:26:26] [INFO ] [Nat]Absence check using 27 positive place invariants in 6 ms returned sat
[2022-05-18 03:26:26] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-18 03:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:26:27] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2022-05-18 03:26:27] [INFO ] [Nat]Added 1030 Read/Feed constraints in 192 ms returned sat
[2022-05-18 03:26:27] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 185 ms.
[2022-05-18 03:26:27] [INFO ] Added : 0 causal constraints over 0 iterations in 328 ms. Result :sat
Minimization took 518 ms.
[2022-05-18 03:26:28] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2022-05-18 03:26:28] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-18 03:26:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:26:28] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2022-05-18 03:26:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:26:28] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-18 03:26:28] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-18 03:26:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:26:29] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2022-05-18 03:26:29] [INFO ] [Nat]Added 1030 Read/Feed constraints in 206 ms returned sat
[2022-05-18 03:26:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 189 ms.
[2022-05-18 03:26:29] [INFO ] Added : 0 causal constraints over 0 iterations in 320 ms. Result :sat
Minimization took 634 ms.
[2022-05-18 03:26:30] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2022-05-18 03:26:30] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-18 03:26:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:26:30] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2022-05-18 03:26:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:26:30] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-18 03:26:30] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-18 03:26:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:26:31] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2022-05-18 03:26:31] [INFO ] [Nat]Added 1030 Read/Feed constraints in 307 ms returned sat
[2022-05-18 03:26:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 187 ms.
[2022-05-18 03:26:31] [INFO ] Added : 0 causal constraints over 0 iterations in 333 ms. Result :sat
Minimization took 500 ms.
[2022-05-18 03:26:32] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2022-05-18 03:26:32] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-18 03:26:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:26:32] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2022-05-18 03:26:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:26:32] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-18 03:26:32] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-18 03:26:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:26:33] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2022-05-18 03:26:33] [INFO ] [Nat]Added 1030 Read/Feed constraints in 210 ms returned sat
[2022-05-18 03:26:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 210 ms.
[2022-05-18 03:26:33] [INFO ] Added : 0 causal constraints over 0 iterations in 345 ms. Result :sat
Minimization took 325 ms.
[2022-05-18 03:26:34] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-18 03:26:34] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned unsat
[2022-05-18 03:26:34] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-18 03:26:34] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 10, 10, -1, -1, -1, 10, 10, 1, 1] Max seen :[2, 4, 4, 4, 4, 2, 4, 2, 1, 1]
FORMULA PhilosophersDyn-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 268 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2022-05-18 03:26:37] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2022-05-18 03:26:37] [INFO ] Computed 39 place invariants in 31 ms
[2022-05-18 03:26:38] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 380 transitions.
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 119 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/2265 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:26:38] [INFO ] Computed 39 place invariants in 42 ms
Incomplete random walk after 1000000 steps, including 119278 resets, run finished after 15252 ms. (steps per millisecond=65 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000000 steps, including 10019 resets, run finished after 1818 ms. (steps per millisecond=550 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000001 steps, including 9576 resets, run finished after 1851 ms. (steps per millisecond=540 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000000 steps, including 9577 resets, run finished after 1855 ms. (steps per millisecond=539 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000001 steps, including 9042 resets, run finished after 2738 ms. (steps per millisecond=365 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000001 steps, including 9041 resets, run finished after 2742 ms. (steps per millisecond=364 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000001 steps, including 8518 resets, run finished after 1751 ms. (steps per millisecond=571 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000001 steps, including 9574 resets, run finished after 1861 ms. (steps per millisecond=537 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000001 steps, including 10010 resets, run finished after 1828 ms. (steps per millisecond=547 ) properties (out of 8) seen :26
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:27:10] [INFO ] Computed 39 place invariants in 42 ms
[2022-05-18 03:27:10] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:27:10] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-18 03:27:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:27:10] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2022-05-18 03:27:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:27:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:27:10] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2022-05-18 03:27:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:27:10] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2022-05-18 03:27:10] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:27:12] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1774 ms returned sat
[2022-05-18 03:27:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 179 ms.
[2022-05-18 03:27:13] [INFO ] Added : 0 causal constraints over 0 iterations in 309 ms. Result :sat
Minimization took 3005 ms.
[2022-05-18 03:27:16] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:27:16] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-18 03:27:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:27:16] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2022-05-18 03:27:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:27:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:27:16] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-18 03:27:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:27:16] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2022-05-18 03:27:19] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:27:21] [INFO ] [Nat]Added 1010 Read/Feed constraints in 4729 ms returned sat
[2022-05-18 03:27:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 157 ms.
[2022-05-18 03:27:21] [INFO ] Added : 0 causal constraints over 0 iterations in 284 ms. Result :sat
Minimization took 3003 ms.
[2022-05-18 03:27:24] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-18 03:27:24] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-18 03:27:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:27:25] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2022-05-18 03:27:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:27:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:27:25] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-18 03:27:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:27:25] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2022-05-18 03:27:28] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:27:31] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6082 ms returned unknown
[2022-05-18 03:27:31] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:27:31] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-18 03:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:27:32] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2022-05-18 03:27:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:27:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-05-18 03:27:32] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-18 03:27:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:27:32] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2022-05-18 03:27:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:27:38] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6100 ms returned unknown
[2022-05-18 03:27:38] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:27:38] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2022-05-18 03:27:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:27:38] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2022-05-18 03:27:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:27:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:27:39] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2022-05-18 03:27:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:27:39] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2022-05-18 03:27:42] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:27:44] [INFO ] [Nat]Added 1010 Read/Feed constraints in 4908 ms returned sat
[2022-05-18 03:27:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 161 ms.
[2022-05-18 03:27:44] [INFO ] Added : 0 causal constraints over 0 iterations in 278 ms. Result :sat
Minimization took 3003 ms.
[2022-05-18 03:27:47] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2022-05-18 03:27:47] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2022-05-18 03:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:27:47] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2022-05-18 03:27:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:27:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:27:48] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-18 03:27:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:27:48] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2022-05-18 03:27:50] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1885 ms returned sat
[2022-05-18 03:27:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 161 ms.
[2022-05-18 03:27:50] [INFO ] Added : 0 causal constraints over 0 iterations in 305 ms. Result :sat
Minimization took 2663 ms.
[2022-05-18 03:27:53] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-18 03:27:53] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2022-05-18 03:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:27:53] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2022-05-18 03:27:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:27:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:27:53] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 14 ms returned sat
[2022-05-18 03:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:27:54] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2022-05-18 03:27:57] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:27:58] [INFO ] [Nat]Added 1010 Read/Feed constraints in 3978 ms returned sat
[2022-05-18 03:27:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 170 ms.
[2022-05-18 03:27:58] [INFO ] Added : 0 causal constraints over 0 iterations in 295 ms. Result :sat
Minimization took 3001 ms.
[2022-05-18 03:28:01] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-05-18 03:28:01] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2022-05-18 03:28:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:28:01] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2022-05-18 03:28:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:28:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:28:01] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-18 03:28:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:28:02] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2022-05-18 03:28:03] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1695 ms returned sat
[2022-05-18 03:28:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 182 ms.
[2022-05-18 03:28:04] [INFO ] Added : 0 causal constraints over 0 iterations in 308 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 10, -1, -1, -1, 10, 10] Max seen :[2, 4, 4, 4, 4, 2, 4, 2]
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 141 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 110 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:28:07] [INFO ] Computed 39 place invariants in 37 ms
[2022-05-18 03:28:07] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:28:07] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-18 03:28:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:28:09] [INFO ] Implicit Places using invariants and state equation in 2197 ms returned []
Implicit Place search using SMT with State Equation took 2343 ms to find 0 implicit places.
[2022-05-18 03:28:09] [INFO ] Redundant transitions in 140 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:28:09] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-18 03:28:10] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-00
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:28:10] [INFO ] Computed 39 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 1187 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:28:10] [INFO ] Computed 39 place invariants in 34 ms
[2022-05-18 03:28:10] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:28:10] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-18 03:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:28:11] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2022-05-18 03:28:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:28:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-18 03:28:11] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-18 03:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:28:11] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2022-05-18 03:28:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:28:13] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1685 ms returned sat
[2022-05-18 03:28:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 163 ms.
[2022-05-18 03:28:13] [INFO ] Added : 0 causal constraints over 0 iterations in 285 ms. Result :sat
Minimization took 2663 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 162 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:28:16] [INFO ] Computed 39 place invariants in 33 ms
[2022-05-18 03:28:16] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:28:16] [INFO ] Computed 39 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 119368 resets, run finished after 10969 ms. (steps per millisecond=91 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 9996 resets, run finished after 1443 ms. (steps per millisecond=693 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:28:29] [INFO ] Computed 39 place invariants in 44 ms
[2022-05-18 03:28:29] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:28:29] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-18 03:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:28:29] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2022-05-18 03:28:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:28:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-18 03:28:29] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-18 03:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:28:30] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2022-05-18 03:28:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:28:31] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1680 ms returned sat
[2022-05-18 03:28:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 168 ms.
[2022-05-18 03:28:32] [INFO ] Added : 0 causal constraints over 0 iterations in 293 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 113 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 103 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:28:35] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-18 03:28:35] [INFO ] Implicit Places using invariants in 371 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:28:35] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-18 03:28:36] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:28:42] [INFO ] Implicit Places using invariants and state equation in 6934 ms returned []
Implicit Place search using SMT with State Equation took 7309 ms to find 0 implicit places.
[2022-05-18 03:28:42] [INFO ] Redundant transitions in 106 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:28:42] [INFO ] Computed 39 place invariants in 33 ms
[2022-05-18 03:28:43] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-00 in 32913 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-01
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:28:43] [INFO ] Computed 39 place invariants in 38 ms
Incomplete random walk after 10000 steps, including 1185 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10000 steps, including 95 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:28:43] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-18 03:28:43] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:28:43] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-18 03:28:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:28:44] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2022-05-18 03:28:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:28:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-18 03:28:44] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-18 03:28:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:28:44] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2022-05-18 03:28:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:28:47] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:28:48] [INFO ] [Nat]Added 1010 Read/Feed constraints in 3913 ms returned sat
[2022-05-18 03:28:48] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 166 ms.
[2022-05-18 03:28:48] [INFO ] Added : 0 causal constraints over 0 iterations in 290 ms. Result :sat
Minimization took 394 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 237 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:28:49] [INFO ] Computed 39 place invariants in 37 ms
[2022-05-18 03:28:49] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:28:50] [INFO ] Computed 39 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 119283 resets, run finished after 11179 ms. (steps per millisecond=89 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9744 resets, run finished after 1498 ms. (steps per millisecond=667 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:29:02] [INFO ] Computed 39 place invariants in 32 ms
[2022-05-18 03:29:02] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 03:29:02] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2022-05-18 03:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:29:03] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2022-05-18 03:29:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:29:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 03:29:03] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2022-05-18 03:29:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:29:03] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2022-05-18 03:29:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:29:06] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:29:09] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6090 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 114 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 101 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:29:09] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-18 03:29:10] [INFO ] Implicit Places using invariants in 374 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 378 ms to find 10 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 99 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-18 03:29:10] [INFO ] Computed 29 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 119351 resets, run finished after 10771 ms. (steps per millisecond=92 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9739 resets, run finished after 1433 ms. (steps per millisecond=697 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2022-05-18 03:29:22] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-18 03:29:22] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 03:29:22] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 03:29:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:29:22] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2022-05-18 03:29:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:29:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 03:29:22] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 03:29:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:29:23] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-05-18 03:29:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:29:26] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:29:29] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6084 ms returned unknown
Current structural bounds on expressions (after SMT) : [411] Max seen :[4]
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 105 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 99 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-18 03:29:29] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-18 03:29:29] [INFO ] Implicit Places using invariants in 342 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-18 03:29:29] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-18 03:29:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:29:36] [INFO ] Implicit Places using invariants and state equation in 6492 ms returned []
Implicit Place search using SMT with State Equation took 6836 ms to find 0 implicit places.
[2022-05-18 03:29:36] [INFO ] Redundant transitions in 62 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-18 03:29:36] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-18 03:29:36] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-01 in 53479 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-02
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:29:36] [INFO ] Computed 39 place invariants in 37 ms
Incomplete random walk after 10000 steps, including 1193 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:29:37] [INFO ] Computed 39 place invariants in 33 ms
[2022-05-18 03:29:37] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:29:37] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-18 03:29:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:29:37] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2022-05-18 03:29:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:29:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:29:37] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-18 03:29:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:29:37] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2022-05-18 03:29:37] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:29:40] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:29:42] [INFO ] [Nat]Added 1010 Read/Feed constraints in 4399 ms returned sat
[2022-05-18 03:29:42] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 168 ms.
[2022-05-18 03:29:42] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 2 ms to minimize.
[2022-05-18 03:29:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 205 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:29:43] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-18 03:29:43] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:29:43] [INFO ] Computed 39 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 119252 resets, run finished after 11077 ms. (steps per millisecond=90 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9745 resets, run finished after 1474 ms. (steps per millisecond=678 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:29:56] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-18 03:29:56] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 03:29:56] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2022-05-18 03:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:29:56] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2022-05-18 03:29:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:29:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-18 03:29:56] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2022-05-18 03:29:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:29:57] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2022-05-18 03:29:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:30:00] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:30:03] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6074 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 120 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 96 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:30:03] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-18 03:30:03] [INFO ] Implicit Places using invariants in 375 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 378 ms to find 10 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 98 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-18 03:30:03] [INFO ] Computed 29 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 119393 resets, run finished after 10773 ms. (steps per millisecond=92 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9743 resets, run finished after 1443 ms. (steps per millisecond=693 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2022-05-18 03:30:16] [INFO ] Computed 29 place invariants in 27 ms
[2022-05-18 03:30:16] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-18 03:30:16] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 03:30:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:30:16] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2022-05-18 03:30:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:30:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 03:30:16] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 03:30:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:30:16] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2022-05-18 03:30:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:30:19] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:30:22] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6074 ms returned unknown
Current structural bounds on expressions (after SMT) : [411] Max seen :[4]
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 99 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 101 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-18 03:30:23] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-18 03:30:23] [INFO ] Implicit Places using invariants in 358 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-18 03:30:23] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-18 03:30:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:30:29] [INFO ] Implicit Places using invariants and state equation in 6468 ms returned []
Implicit Place search using SMT with State Equation took 6828 ms to find 0 implicit places.
[2022-05-18 03:30:29] [INFO ] Redundant transitions in 52 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-18 03:30:30] [INFO ] Computed 29 place invariants in 23 ms
[2022-05-18 03:30:30] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-02 in 53637 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-03
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:30:30] [INFO ] Computed 39 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 1188 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:30:30] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-18 03:30:30] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-18 03:30:30] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-18 03:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:30:31] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2022-05-18 03:30:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:30:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-18 03:30:31] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-18 03:30:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:30:31] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2022-05-18 03:30:31] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:30:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:30:36] [INFO ] [Nat]Added 1010 Read/Feed constraints in 4626 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 198 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:30:36] [INFO ] Computed 39 place invariants in 37 ms
[2022-05-18 03:30:37] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:30:37] [INFO ] Computed 39 place invariants in 30 ms
Incomplete random walk after 1000000 steps, including 119416 resets, run finished after 12185 ms. (steps per millisecond=82 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9402 resets, run finished after 2457 ms. (steps per millisecond=407 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:30:51] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-18 03:30:51] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 03:30:51] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2022-05-18 03:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:30:52] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2022-05-18 03:30:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:30:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 03:30:52] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2022-05-18 03:30:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:30:52] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2022-05-18 03:30:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:30:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:30:58] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6093 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 117 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 93 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:30:58] [INFO ] Computed 39 place invariants in 32 ms
[2022-05-18 03:30:58] [INFO ] Implicit Places using invariants in 226 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 230 ms to find 10 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 196 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-18 03:30:59] [INFO ] Computed 29 place invariants in 23 ms
[2022-05-18 03:30:59] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-18 03:30:59] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-18 03:30:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:31:01] [INFO ] Implicit Places using invariants and state equation in 2289 ms returned []
Implicit Place search using SMT with State Equation took 2507 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions, in 2 iterations. Remains : 140/160 places, 1865/1875 transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-18 03:31:01] [INFO ] Computed 29 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 178961 resets, run finished after 16793 ms. (steps per millisecond=59 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11363 resets, run finished after 2500 ms. (steps per millisecond=400 ) properties (out of 1) seen :4
// Phase 1: matrix 1865 rows 140 cols
[2022-05-18 03:31:21] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-18 03:31:21] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-18 03:31:21] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 5 ms returned sat
[2022-05-18 03:31:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:31:21] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2022-05-18 03:31:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:31:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-18 03:31:21] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 5 ms returned sat
[2022-05-18 03:31:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:31:21] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2022-05-18 03:31:21] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:31:24] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2913 ms returned sat
[2022-05-18 03:31:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 194 ms.
[2022-05-18 03:31:24] [INFO ] Added : 0 causal constraints over 0 iterations in 314 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 140 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 103 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 93 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-18 03:31:28] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-18 03:31:28] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-18 03:31:28] [INFO ] Computed 29 place invariants in 21 ms
[2022-05-18 03:31:28] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:31:30] [INFO ] Implicit Places using invariants and state equation in 2307 ms returned []
Implicit Place search using SMT with State Equation took 2529 ms to find 0 implicit places.
[2022-05-18 03:31:30] [INFO ] Redundant transitions in 52 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-18 03:31:30] [INFO ] Computed 29 place invariants in 23 ms
[2022-05-18 03:31:31] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-03 in 60758 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-04
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:31:31] [INFO ] Computed 39 place invariants in 34 ms
Incomplete random walk after 10000 steps, including 1207 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:31:31] [INFO ] Computed 39 place invariants in 37 ms
[2022-05-18 03:31:31] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-18 03:31:31] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-18 03:31:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:31:31] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2022-05-18 03:31:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:31:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-05-18 03:31:32] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2022-05-18 03:31:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:31:32] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2022-05-18 03:31:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:31:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:31:36] [INFO ] [Nat]Added 1010 Read/Feed constraints in 4616 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 197 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:31:37] [INFO ] Computed 39 place invariants in 37 ms
[2022-05-18 03:31:37] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:31:37] [INFO ] Computed 39 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 119364 resets, run finished after 12319 ms. (steps per millisecond=81 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9409 resets, run finished after 2467 ms. (steps per millisecond=405 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:31:52] [INFO ] Computed 39 place invariants in 42 ms
[2022-05-18 03:31:52] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 03:31:52] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2022-05-18 03:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:31:52] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2022-05-18 03:31:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:31:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 03:31:53] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 7 ms returned sat
[2022-05-18 03:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:31:53] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2022-05-18 03:31:53] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:31:56] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:31:59] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6092 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 101 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 92 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:31:59] [INFO ] Computed 39 place invariants in 33 ms
[2022-05-18 03:31:59] [INFO ] Implicit Places using invariants in 253 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 257 ms to find 10 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 193 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-18 03:32:00] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-18 03:32:00] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-18 03:32:00] [INFO ] Computed 29 place invariants in 16 ms
[2022-05-18 03:32:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:32:02] [INFO ] Implicit Places using invariants and state equation in 2327 ms returned []
Implicit Place search using SMT with State Equation took 2549 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions, in 2 iterations. Remains : 140/160 places, 1865/1875 transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-18 03:32:02] [INFO ] Computed 29 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 178898 resets, run finished after 17020 ms. (steps per millisecond=58 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11363 resets, run finished after 2554 ms. (steps per millisecond=391 ) properties (out of 1) seen :4
// Phase 1: matrix 1865 rows 140 cols
[2022-05-18 03:32:22] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-18 03:32:22] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-18 03:32:22] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 03:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:32:22] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2022-05-18 03:32:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:32:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-18 03:32:22] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 03:32:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:32:23] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2022-05-18 03:32:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:32:25] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2817 ms returned sat
[2022-05-18 03:32:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 176 ms.
[2022-05-18 03:32:26] [INFO ] Added : 0 causal constraints over 0 iterations in 298 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 140 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 96 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 98 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-18 03:32:29] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-18 03:32:29] [INFO ] Implicit Places using invariants in 214 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-18 03:32:29] [INFO ] Computed 29 place invariants in 23 ms
[2022-05-18 03:32:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:32:31] [INFO ] Implicit Places using invariants and state equation in 2287 ms returned []
Implicit Place search using SMT with State Equation took 2505 ms to find 0 implicit places.
[2022-05-18 03:32:31] [INFO ] Redundant transitions in 55 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-18 03:32:31] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-18 03:32:32] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-04 in 61171 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-05
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:32:32] [INFO ] Computed 39 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 1201 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:32:32] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-18 03:32:32] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:32:32] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-18 03:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:32:33] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2022-05-18 03:32:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:32:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:32:33] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-18 03:32:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:32:33] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2022-05-18 03:32:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:32:35] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2012 ms returned sat
[2022-05-18 03:32:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 180 ms.
[2022-05-18 03:32:35] [INFO ] Added : 0 causal constraints over 0 iterations in 299 ms. Result :sat
Minimization took 2271 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 103 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:32:38] [INFO ] Computed 39 place invariants in 37 ms
[2022-05-18 03:32:38] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:32:38] [INFO ] Computed 39 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 119319 resets, run finished after 11076 ms. (steps per millisecond=90 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 8516 resets, run finished after 1419 ms. (steps per millisecond=704 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:32:51] [INFO ] Computed 39 place invariants in 34 ms
[2022-05-18 03:32:51] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:32:51] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-18 03:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:32:51] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2022-05-18 03:32:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:32:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:32:51] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-18 03:32:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:32:52] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2022-05-18 03:32:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:32:54] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2003 ms returned sat
[2022-05-18 03:32:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 153 ms.
[2022-05-18 03:32:54] [INFO ] Added : 0 causal constraints over 0 iterations in 274 ms. Result :sat
Minimization took 2694 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 95 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 94 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:32:57] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-18 03:32:57] [INFO ] Implicit Places using invariants in 311 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:32:57] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-18 03:32:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:33:04] [INFO ] Implicit Places using invariants and state equation in 6883 ms returned []
Implicit Place search using SMT with State Equation took 7195 ms to find 0 implicit places.
[2022-05-18 03:33:04] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:33:04] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-18 03:33:05] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-05 in 32922 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-06
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:33:05] [INFO ] Computed 39 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 1191 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:33:05] [INFO ] Computed 39 place invariants in 37 ms
[2022-05-18 03:33:05] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:33:05] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-18 03:33:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:33:05] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2022-05-18 03:33:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:33:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-05-18 03:33:06] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-18 03:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:33:06] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2022-05-18 03:33:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:33:09] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:33:11] [INFO ] [Nat]Added 1010 Read/Feed constraints in 4647 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 217 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:33:11] [INFO ] Computed 39 place invariants in 39 ms
[2022-05-18 03:33:11] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:33:11] [INFO ] Computed 39 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 119393 resets, run finished after 11093 ms. (steps per millisecond=90 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9742 resets, run finished after 1477 ms. (steps per millisecond=677 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:33:24] [INFO ] Computed 39 place invariants in 39 ms
[2022-05-18 03:33:24] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 03:33:24] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2022-05-18 03:33:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:33:24] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2022-05-18 03:33:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:33:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 03:33:24] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 7 ms returned sat
[2022-05-18 03:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:33:25] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2022-05-18 03:33:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:33:28] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:33:31] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6078 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 103 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 99 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-18 03:33:31] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-18 03:33:31] [INFO ] Implicit Places using invariants in 404 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 408 ms to find 10 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 97 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-18 03:33:32] [INFO ] Computed 29 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 119284 resets, run finished after 10724 ms. (steps per millisecond=93 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9735 resets, run finished after 1431 ms. (steps per millisecond=698 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2022-05-18 03:33:44] [INFO ] Computed 29 place invariants in 29 ms
[2022-05-18 03:33:44] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 03:33:44] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 03:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:33:44] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2022-05-18 03:33:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:33:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 03:33:44] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 03:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:33:44] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2022-05-18 03:33:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:33:47] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 03:33:50] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6075 ms returned unknown
Current structural bounds on expressions (after SMT) : [411] Max seen :[4]
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 104 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 106 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-18 03:33:51] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-18 03:33:51] [INFO ] Implicit Places using invariants in 342 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-18 03:33:51] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-18 03:33:51] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:33:57] [INFO ] Implicit Places using invariants and state equation in 6412 ms returned []
Implicit Place search using SMT with State Equation took 6755 ms to find 0 implicit places.
[2022-05-18 03:33:57] [INFO ] Redundant transitions in 59 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-18 03:33:58] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-18 03:33:58] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-06 in 53128 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-07
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:33:58] [INFO ] Computed 39 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 1186 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:33:58] [INFO ] Computed 39 place invariants in 51 ms
[2022-05-18 03:33:58] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-05-18 03:33:58] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-18 03:33:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:33:59] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2022-05-18 03:33:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:33:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:33:59] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-18 03:33:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:33:59] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2022-05-18 03:33:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:34:01] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1683 ms returned sat
[2022-05-18 03:34:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 183 ms.
[2022-05-18 03:34:01] [INFO ] Added : 0 causal constraints over 0 iterations in 319 ms. Result :sat
Minimization took 2609 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 106 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:34:04] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-18 03:34:04] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:34:04] [INFO ] Computed 39 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 119425 resets, run finished after 11348 ms. (steps per millisecond=88 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 9980 resets, run finished after 1504 ms. (steps per millisecond=664 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:34:17] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-18 03:34:17] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 03:34:17] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-18 03:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:34:18] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2022-05-18 03:34:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:34:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-18 03:34:18] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-18 03:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:34:18] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2022-05-18 03:34:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:34:20] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1720 ms returned sat
[2022-05-18 03:34:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 168 ms.
[2022-05-18 03:34:20] [INFO ] Added : 0 causal constraints over 0 iterations in 286 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 96 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 97 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:34:23] [INFO ] Computed 39 place invariants in 34 ms
[2022-05-18 03:34:24] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:34:24] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-18 03:34:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 03:34:31] [INFO ] Implicit Places using invariants and state equation in 6912 ms returned []
Implicit Place search using SMT with State Equation took 7300 ms to find 0 implicit places.
[2022-05-18 03:34:31] [INFO ] Redundant transitions in 57 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 03:34:31] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-18 03:34:31] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-07 in 33275 ms.
[2022-05-18 03:34:32] [INFO ] Flatten gal took : 245 ms
[2022-05-18 03:34:32] [INFO ] Applying decomposition
[2022-05-18 03:34:32] [INFO ] Flatten gal took : 135 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/graph5035987365922405302.txt' '-o' '/tmp/graph5035987365922405302.bin' '-w' '/tmp/graph5035987365922405302.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5035987365922405302.bin' '-l' '-1' '-v' '-w' '/tmp/graph5035987365922405302.weights' '-q' '0' '-e' '0.001'
[2022-05-18 03:34:32] [INFO ] Decomposing Gal with order
[2022-05-18 03:34:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 03:34:33] [INFO ] Removed a total of 2660 redundant transitions.
[2022-05-18 03:34:33] [INFO ] Flatten gal took : 729 ms
[2022-05-18 03:34:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2022-05-18 03:34:34] [INFO ] Time to serialize gal into /tmp/UpperBounds10101482844445898809.gal : 20 ms
[2022-05-18 03:34:34] [INFO ] Time to serialize properties into /tmp/UpperBounds1809908867467236943.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/UpperBounds10101482844445898809.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1809908867467236943.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...296
Loading property file /tmp/UpperBounds1809908867467236943.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,199051,136.316,2320344,2,207674,5,2.73572e+06,6,0,2588,810524,0
Total reachable state count : 199051

Verifying 8 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-10-UpperBounds-00 :0 <= gu5.HasLeft_6+gu9.HasLeft_1+gu1.HasLeft_8+gu8.HasLeft_9+gu4.HasLeft_3+gu0.HasLeft_10+gu3.HasLeft...204
FORMULA PhilosophersDyn-PT-10-UpperBounds-00 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-00,0,136.558,2320344,1,0,7,2.73572e+06,9,1,3100,810524,4
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-01 :0 <= gu8.Think_9+gu1.Think_8+gu9.Think_1+gu3.Think_2+gu4.Think_3+gu7.Think_7+gu5.Think_6+gu2.Think_4+...184
FORMULA PhilosophersDyn-PT-10-UpperBounds-01 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-01,0,136.77,2320344,1,0,8,2.73572e+06,10,1,3388,810524,5
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-02 :0 <= gu8.Think_9+gu1.Think_8+gu9.Think_1+gu3.Think_2+gu4.Think_3+gu7.Think_7+gu5.Think_6+gu2.Think_4+...184
FORMULA PhilosophersDyn-PT-10-UpperBounds-02 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-02,0,136.771,2320344,1,0,8,2.73572e+06,10,1,3388,810524,5
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-03 :0 <= gu7.Neighbourhood_7_3+gu3.Neighbourhood_2_10+gu8.Neighbourhood_9_1+gu4.Neighbourhood_3_8+gu1.Nei...2283
FORMULA PhilosophersDyn-PT-10-UpperBounds-03 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-03,0,137.083,2320344,1,0,9,2.73572e+06,11,1,3802,810524,6
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-04 :0 <= gu7.Neighbourhood_7_3+gu3.Neighbourhood_2_10+gu8.Neighbourhood_9_1+gu4.Neighbourhood_3_8+gu1.Nei...2283
FORMULA PhilosophersDyn-PT-10-UpperBounds-04 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-04,0,137.093,2320344,1,0,9,2.73572e+06,11,1,3802,810524,6
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-10-UpperBounds-05 :0 <= gu0.Forks_10+gu1.Forks_8+gu9.Forks_1+gu7.Forks_7+gu5.Forks_6+gu6.Forks_5+gu2.Forks_4+gu4.Forks_3...184
FORMULA PhilosophersDyn-PT-10-UpperBounds-05 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-05,0,137.289,2320344,1,0,10,2.73572e+06,12,1,4082,810524,7
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-06 :0 <= gu8.Think_9+gu1.Think_8+gu9.Think_1+gu3.Think_2+gu4.Think_3+gu7.Think_7+gu5.Think_6+gu2.Think_4+...184
FORMULA PhilosophersDyn-PT-10-UpperBounds-06 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-06,0,137.289,2320344,1,0,10,2.73572e+06,12,1,4082,810524,7
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-10-UpperBounds-07 :0 <= gu5.HasLeft_6+gu9.HasLeft_1+gu1.HasLeft_8+gu8.HasLeft_9+gu4.HasLeft_3+gu0.HasLeft_10+gu3.HasLeft...204
FORMULA PhilosophersDyn-PT-10-UpperBounds-07 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-07,0,137.289,2320344,1,0,10,2.73572e+06,12,1,4082,810524,7
Total runtime 634799 ms.

BK_STOP 1652845011825

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PhilosophersDyn-PT-10, 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 r168-tall-165277016700421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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