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.r179-tall-165277026900154.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 gold2021
Input is PhilosophersDyn-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026900154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 14K Apr 30 07:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 30 07:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 30 07:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 30 07:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.2K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 87K 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-03-UpperBounds-00
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-01
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-02
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-03
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-04
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-05
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-06
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-07
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-08
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-09
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-10
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-11
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-12
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-13
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-14
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652831305967

Running Version 0
[2022-05-17 23:48:27] [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-17 23:48:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 23:48:27] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2022-05-17 23:48:27] [INFO ] Transformed 30 places.
[2022-05-17 23:48:27] [INFO ] Transformed 84 transitions.
[2022-05-17 23:48:27] [INFO ] Parsed PT model containing 30 places and 84 transitions in 79 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Normalized transition count is 57 out of 81 initially.
// Phase 1: matrix 57 rows 30 cols
[2022-05-17 23:48:27] [INFO ] Computed 11 place invariants in 15 ms
FORMULA PhilosophersDyn-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1445 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 15) seen :29
FORMULA PhilosophersDyn-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 239 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10000 steps, including 248 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10000 steps, including 241 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10001 steps, including 311 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :8
[2022-05-17 23:48:27] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2022-05-17 23:48:27] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-17 23:48:28] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-17 23:48:28] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 23:48:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:28] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 23:48:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 23:48:28] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 23:48:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:28] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-17 23:48:28] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-17 23:48:28] [INFO ] [Nat]Added 36 Read/Feed constraints in 11 ms returned sat
[2022-05-17 23:48:28] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 15 ms.
[2022-05-17 23:48:28] [INFO ] Added : 5 causal constraints over 1 iterations in 37 ms. Result :sat
Minimization took 13 ms.
[2022-05-17 23:48:28] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 23:48:28] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned unsat
[2022-05-17 23:48:28] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-17 23:48:28] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-17 23:48:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:28] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 23:48:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-17 23:48:28] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-17 23:48:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:28] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-17 23:48:28] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2022-05-17 23:48:28] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 9 ms.
[2022-05-17 23:48:28] [INFO ] Added : 5 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 12 ms.
[2022-05-17 23:48:28] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-17 23:48:28] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 23:48:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:28] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 23:48:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-17 23:48:28] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-17 23:48:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:28] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:48:28] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2022-05-17 23:48:28] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 5 ms.
[2022-05-17 23:48:28] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
[2022-05-17 23:48:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-05-17 23:48:28] [INFO ] Added : 6 causal constraints over 2 iterations in 81 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1, 3, -1, -1] Max seen :[2, 3, 2, 1]
FORMULA PhilosophersDyn-PT-03-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 3100 steps, including 536 resets, run finished after 13 ms. (steps per millisecond=238 ) properties (out of 3) seen :5 could not realise parikh vector
Incomplete Parikh walk after 4500 steps, including 722 resets, run finished after 10 ms. (steps per millisecond=450 ) properties (out of 3) seen :5 could not realise parikh vector
Incomplete Parikh walk after 4500 steps, including 721 resets, run finished after 10 ms. (steps per millisecond=450 ) properties (out of 3) seen :5 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 27 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2022-05-17 23:48:28] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2022-05-17 23:48:28] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 23:48:28] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned [0, 6, 7, 8, 12, 13, 15, 16, 19, 20, 21, 22, 23, 24, 26, 28, 39, 44, 45, 48, 53, 55, 56, 61, 64, 66, 71, 72, 74, 75]
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions :[75, 74, 72, 71, 66, 64, 61, 56, 55, 53, 48, 45, 44, 39, 28, 26, 24, 23, 22, 21, 20, 19, 16, 15, 13, 12, 8, 7, 6, 0]
Starting structural reductions, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/30 places, 51/81 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:28] [INFO ] Computed 11 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 143250 resets, run finished after 1442 ms. (steps per millisecond=693 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 23682 resets, run finished after 564 ms. (steps per millisecond=1773 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 23705 resets, run finished after 508 ms. (steps per millisecond=1968 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 30824 resets, run finished after 624 ms. (steps per millisecond=1602 ) properties (out of 3) seen :5
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:31] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-17 23:48:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-17 23:48:31] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-17 23:48:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:31] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-17 23:48:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 23:48:31] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-17 23:48:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:31] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:48:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:48:31] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-05-17 23:48:31] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2022-05-17 23:48:31] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 1 ms to minimize.
[2022-05-17 23:48:31] [INFO ] Deduced a trap composed of 11 places in 12 ms of which 0 ms to minimize.
[2022-05-17 23:48:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 63 ms
[2022-05-17 23:48:31] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2022-05-17 23:48:31] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 15 ms.
[2022-05-17 23:48:31] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 23:48:31] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 23:48:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:31] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:48:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-17 23:48:32] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 23:48:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:32] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-17 23:48:32] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-05-17 23:48:32] [INFO ] Deduced a trap composed of 9 places in 11 ms of which 0 ms to minimize.
[2022-05-17 23:48:32] [INFO ] Deduced a trap composed of 7 places in 10 ms of which 1 ms to minimize.
[2022-05-17 23:48:32] [INFO ] Deduced a trap composed of 11 places in 10 ms of which 1 ms to minimize.
[2022-05-17 23:48:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 45 ms
[2022-05-17 23:48:32] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2022-05-17 23:48:32] [INFO ] Added : 7 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 13 ms.
[2022-05-17 23:48:32] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 23:48:32] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 0 ms returned sat
[2022-05-17 23:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:32] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:48:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2022-05-17 23:48:32] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-17 23:48:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:32] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 23:48:32] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2022-05-17 23:48:32] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 1 ms to minimize.
[2022-05-17 23:48:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2022-05-17 23:48:32] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 6 ms.
[2022-05-17 23:48:32] [INFO ] Added : 9 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[2, 2, 1]
Incomplete Parikh walk after 4800 steps, including 646 resets, run finished after 9 ms. (steps per millisecond=533 ) properties (out of 3) seen :5 could not realise parikh vector
Incomplete Parikh walk after 4900 steps, including 631 resets, run finished after 10 ms. (steps per millisecond=490 ) properties (out of 3) seen :5 could not realise parikh vector
Incomplete Parikh walk after 4900 steps, including 619 resets, run finished after 10 ms. (steps per millisecond=490 ) properties (out of 3) seen :5 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:32] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 23:48:32] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:32] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:48:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:48:32] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2022-05-17 23:48:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:32] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:48:32] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Starting property specific reduction for PhilosophersDyn-PT-03-UpperBounds-00
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:32] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1417 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 236 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:32] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-17 23:48:32] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 23:48:32] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 23:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:32] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 23:48:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 23:48:32] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-17 23:48:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:32] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-17 23:48:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:48:32] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-05-17 23:48:32] [INFO ] Deduced a trap composed of 9 places in 13 ms of which 0 ms to minimize.
[2022-05-17 23:48:32] [INFO ] Deduced a trap composed of 7 places in 11 ms of which 0 ms to minimize.
[2022-05-17 23:48:32] [INFO ] Deduced a trap composed of 11 places in 11 ms of which 0 ms to minimize.
[2022-05-17 23:48:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 46 ms
[2022-05-17 23:48:32] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 6 ms.
[2022-05-17 23:48:32] [INFO ] Added : 7 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 4900 steps, including 629 resets, run finished after 14 ms. (steps per millisecond=350 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:32] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 23:48:32] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:32] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 143207 resets, run finished after 1176 ms. (steps per millisecond=850 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 23674 resets, run finished after 486 ms. (steps per millisecond=2057 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:34] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-17 23:48:34] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-17 23:48:34] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 23:48:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 23:48:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 23:48:34] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 0 ms returned sat
[2022-05-17 23:48:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:34] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:48:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:48:34] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2022-05-17 23:48:34] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2022-05-17 23:48:34] [INFO ] Deduced a trap composed of 7 places in 10 ms of which 0 ms to minimize.
[2022-05-17 23:48:34] [INFO ] Deduced a trap composed of 11 places in 14 ms of which 1 ms to minimize.
[2022-05-17 23:48:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 57 ms
[2022-05-17 23:48:34] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2022-05-17 23:48:34] [INFO ] Added : 7 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 4900 steps, including 634 resets, run finished after 12 ms. (steps per millisecond=408 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:34] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 23:48:34] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:34] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:48:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:48:34] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2022-05-17 23:48:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:34] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-17 23:48:34] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Ending property specific reduction for PhilosophersDyn-PT-03-UpperBounds-00 in 2210 ms.
Starting property specific reduction for PhilosophersDyn-PT-03-UpperBounds-07
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:34] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 240 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:34] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 23:48:34] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-17 23:48:34] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 23:48:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 23:48:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 23:48:34] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 23:48:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:34] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:48:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:48:34] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-05-17 23:48:34] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 0 ms to minimize.
[2022-05-17 23:48:34] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 1 ms to minimize.
[2022-05-17 23:48:34] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
[2022-05-17 23:48:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 58 ms
[2022-05-17 23:48:34] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2022-05-17 23:48:34] [INFO ] Added : 7 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 4900 steps, including 645 resets, run finished after 16 ms. (steps per millisecond=306 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:34] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:48:34] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:34] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 143197 resets, run finished after 1176 ms. (steps per millisecond=850 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 23662 resets, run finished after 487 ms. (steps per millisecond=2053 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:36] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 23:48:36] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 23:48:36] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 0 ms returned sat
[2022-05-17 23:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:36] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:48:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-17 23:48:36] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-17 23:48:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:36] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 23:48:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:48:36] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2022-05-17 23:48:36] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2022-05-17 23:48:36] [INFO ] Deduced a trap composed of 7 places in 11 ms of which 0 ms to minimize.
[2022-05-17 23:48:36] [INFO ] Deduced a trap composed of 11 places in 14 ms of which 0 ms to minimize.
[2022-05-17 23:48:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 66 ms
[2022-05-17 23:48:36] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 6 ms.
[2022-05-17 23:48:36] [INFO ] Added : 7 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 4900 steps, including 619 resets, run finished after 13 ms. (steps per millisecond=376 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:36] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:48:36] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:36] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:48:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:48:36] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-17 23:48:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:36] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:48:36] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Ending property specific reduction for PhilosophersDyn-PT-03-UpperBounds-07 in 2212 ms.
Starting property specific reduction for PhilosophersDyn-PT-03-UpperBounds-09
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:36] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1433 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 314 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:48:36] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:48:36] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-17 23:48:36] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 23:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:36] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 23:48:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-17 23:48:36] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 23:48:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:36] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:48:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:48:36] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-05-17 23:48:36] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2022-05-17 23:48:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-17 23:48:36] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2022-05-17 23:48:36] [INFO ] Added : 9 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 4800 steps, including 649 resets, run finished after 12 ms. (steps per millisecond=400 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 49
Applied a total of 4 rules in 6 ms. Remains 28 /30 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 28 cols
[2022-05-17 23:48:36] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:48:37] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 49/51 transitions.
// Phase 1: matrix 49 rows 28 cols
[2022-05-17 23:48:37] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 142852 resets, run finished after 1131 ms. (steps per millisecond=884 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 30752 resets, run finished after 408 ms. (steps per millisecond=2450 ) properties (out of 1) seen :1
// Phase 1: matrix 49 rows 28 cols
[2022-05-17 23:48:38] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 23:48:38] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 23:48:38] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 23:48:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 23:48:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 23:48:38] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 23:48:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:38] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:48:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:48:38] [INFO ] [Nat]Added 30 Read/Feed constraints in 7 ms returned sat
[2022-05-17 23:48:38] [INFO ] Computed and/alt/rep : 13/103/13 causal constraints (skipped 33 transitions) in 4 ms.
[2022-05-17 23:48:38] [INFO ] Added : 5 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 3600 steps, including 544 resets, run finished after 12 ms. (steps per millisecond=300 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 49/49 transitions.
Applied a total of 0 rules in 4 ms. Remains 28 /28 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 49/49 transitions.
Starting structural reductions, iteration 0 : 28/28 places, 49/49 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 49/49 (removed 0) transitions.
// Phase 1: matrix 49 rows 28 cols
[2022-05-17 23:48:38] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 23:48:38] [INFO ] Implicit Places using invariants in 30 ms returned [1, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
[2022-05-17 23:48:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 49 rows 26 cols
[2022-05-17 23:48:38] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-17 23:48:38] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 26/28 places, 49/49 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 24 transition count 47
Applied a total of 4 rules in 6 ms. Remains 24 /26 variables (removed 2) and now considering 47/49 (removed 2) transitions.
// Phase 1: matrix 47 rows 24 cols
[2022-05-17 23:48:38] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-17 23:48:38] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 47 rows 24 cols
[2022-05-17 23:48:38] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-17 23:48:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:48:38] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 24/28 places, 47/49 transitions.
// Phase 1: matrix 47 rows 24 cols
[2022-05-17 23:48:38] [INFO ] Computed 9 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 176249 resets, run finished after 1111 ms. (steps per millisecond=900 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 41730 resets, run finished after 361 ms. (steps per millisecond=2770 ) properties (out of 1) seen :1
// Phase 1: matrix 47 rows 24 cols
[2022-05-17 23:48:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-17 23:48:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-17 23:48:40] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 23:48:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 23:48:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 23:48:40] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-17 23:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:40] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 23:48:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:48:40] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2022-05-17 23:48:40] [INFO ] Computed and/alt/rep : 11/87/11 causal constraints (skipped 33 transitions) in 9 ms.
[2022-05-17 23:48:40] [INFO ] Added : 6 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 3100 steps, including 450 resets, run finished after 7 ms. (steps per millisecond=442 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 47/47 transitions.
Starting structural reductions, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
// Phase 1: matrix 47 rows 24 cols
[2022-05-17 23:48:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-17 23:48:40] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 47 rows 24 cols
[2022-05-17 23:48:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-17 23:48:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:48:40] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2022-05-17 23:48:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 47 rows 24 cols
[2022-05-17 23:48:40] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-17 23:48:40] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 47/47 transitions.
Ending property specific reduction for PhilosophersDyn-PT-03-UpperBounds-09 in 3687 ms.
[2022-05-17 23:48:40] [INFO ] Flatten gal took : 31 ms
[2022-05-17 23:48:40] [INFO ] Applying decomposition
[2022-05-17 23:48:40] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5242315191908932742.txt, -o, /tmp/graph5242315191908932742.bin, -w, /tmp/graph5242315191908932742.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5242315191908932742.bin, -l, -1, -v, -w, /tmp/graph5242315191908932742.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-17 23:48:40] [INFO ] Decomposing Gal with order
[2022-05-17 23:48:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 23:48:40] [INFO ] Removed a total of 100 redundant transitions.
[2022-05-17 23:48:40] [INFO ] Flatten gal took : 34 ms
[2022-05-17 23:48:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-17 23:48:40] [INFO ] Time to serialize gal into /tmp/UpperBounds219924018569265092.gal : 4 ms
[2022-05-17 23:48:40] [INFO ] Time to serialize properties into /tmp/UpperBounds14936183014755547156.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds219924018569265092.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14936183014755547156.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds219924018569265092.gal -t CGAL -reachable-file /tmp/UpperBounds14936183014755547156.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds14936183014755547156.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,325,0.034749,4448,2,448,5,2008,6,0,180,1633,0
Total reachable state count : 325

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-03-UpperBounds-00 :0 <= gi0.gu3.Forks_1+gi1.gi1.gu4.Forks_2+gi2.gu5.Forks_3 <= 2
FORMULA PhilosophersDyn-PT-03-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-03-UpperBounds-00,0,0.035709,4448,1,0,7,2008,9,1,261,1633,4
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-03-UpperBounds-07 :0 <= gi0.gu3.Forks_1+gi1.gi1.gu4.Forks_2+gi2.gu5.Forks_3 <= 2
FORMULA PhilosophersDyn-PT-03-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-03-UpperBounds-07,0,0.035793,4448,1,0,7,2008,9,1,261,1633,4
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property PhilosophersDyn-PT-03-UpperBounds-09 :0 <= gi0.gu3.Forks_1 <= 1
FORMULA PhilosophersDyn-PT-03-UpperBounds-09 1 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-03-UpperBounds-09,0,0.03603,4448,1,0,8,2008,10,1,288,1633,5

BK_STOP 1652831321857

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is PhilosophersDyn-PT-03, 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 r179-tall-165277026900154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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