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-165277016600413.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-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016600413
=====================================================================

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

Running Version 202205111006
[2022-05-18 03:19:53] [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:19:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 03:19:53] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2022-05-18 03:19:53] [INFO ] Transformed 30 places.
[2022-05-18 03:19:53] [INFO ] Transformed 84 transitions.
[2022-05-18 03:19:53] [INFO ] Parsed PT model containing 30 places and 84 transitions in 173 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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-18 03:19:53] [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 1430 resets, run finished after 59 ms. (steps per millisecond=169 ) 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 237 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10001 steps, including 253 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10000 steps, including 232 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10001 steps, including 299 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :8
[2022-05-18 03:19:53] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2022-05-18 03:19:53] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 03:19:53] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-18 03:19:53] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-18 03:19:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:53] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-05-18 03:19:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:19:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-18 03:19:53] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-18 03:19:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:53] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-18 03:19:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-18 03:19:53] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2022-05-18 03:19:53] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 10 ms.
[2022-05-18 03:19:53] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Minimization took 12 ms.
[2022-05-18 03:19:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-05-18 03:19:53] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2022-05-18 03:19:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-18 03:19:53] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-18 03:19:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:53] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-18 03:19:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:19:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-18 03:19:53] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-18 03:19:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:53] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-18 03:19:53] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2022-05-18 03:19:53] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 7 ms.
[2022-05-18 03:19:53] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 9 ms.
[2022-05-18 03:19:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-18 03:19:53] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-18 03:19:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-18 03:19:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:19:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-18 03:19:53] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-18 03:19:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:53] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 03:19:53] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2022-05-18 03:19:53] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 6 ms.
[2022-05-18 03:19:53] [INFO ] Added : 4 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 18 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
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 14 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2022-05-18 03:19:53] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2022-05-18 03:19:53] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:54] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 30 transitions.
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 30/30 places, 51/81 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/81 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:54] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 143037 resets, run finished after 1380 ms. (steps per millisecond=724 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000000 steps, including 23693 resets, run finished after 567 ms. (steps per millisecond=1763 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 23646 resets, run finished after 515 ms. (steps per millisecond=1941 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 31002 resets, run finished after 502 ms. (steps per millisecond=1992 ) properties (out of 3) seen :5
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:56] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-18 03:19:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:57] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-18 03:19:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:19:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:57] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 03:19:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:57] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2022-05-18 03:19:57] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2022-05-18 03:19:57] [INFO ] Added : 6 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 14 ms.
[2022-05-18 03:19:57] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-18 03:19:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:19:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:57] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2022-05-18 03:19:57] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2022-05-18 03:19:57] [INFO ] Added : 6 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 19 ms.
[2022-05-18 03:19:57] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:57] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-18 03:19:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:19:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:57] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2022-05-18 03:19:57] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2022-05-18 03:19:57] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 3 ms to minimize.
[2022-05-18 03:19:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-18 03:19:57] [INFO ] Added : 8 causal constraints over 2 iterations in 63 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[2, 2, 1]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 4 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 in SAFETY mode, 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-18 03:19:57] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-18 03:19:57] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:57] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:57] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2022-05-18 03:19:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:57] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:57] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
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-18 03:19:57] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1444 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 237 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-18 03:19:57] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-18 03:19:57] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:57] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-18 03:19:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:19:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-18 03:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:57] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-18 03:19:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:57] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2022-05-18 03:19:57] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2022-05-18 03:19:57] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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-18 03:19:57] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:57] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:57] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 143323 resets, run finished after 1203 ms. (steps per millisecond=831 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 23651 resets, run finished after 484 ms. (steps per millisecond=2066 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 03:19:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 03:19:59] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-18 03:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:59] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-18 03:19:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:19:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 03:19:59] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-18 03:19:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:59] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-18 03:19:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:59] [INFO ] [Nat]Added 30 Read/Feed constraints in 8 ms returned sat
[2022-05-18 03:19:59] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 6 ms.
[2022-05-18 03:19:59] [INFO ] Added : 6 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 8 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 in SAFETY mode, 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-18 03:19:59] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 03:19:59] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:19:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:59] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2022-05-18 03:19:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:59] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Ending property specific reduction for PhilosophersDyn-PT-03-UpperBounds-00 in 2237 ms.
Starting property specific reduction for PhilosophersDyn-PT-03-UpperBounds-07
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1407 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 232 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 03:19:59] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-18 03:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:59] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-18 03:19:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:19:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 03:19:59] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-18 03:19:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:19:59] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-18 03:19:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:59] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2022-05-18 03:19:59] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2022-05-18 03:19:59] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-18 03:20:00] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:00] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 143087 resets, run finished after 1227 ms. (steps per millisecond=814 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 23651 resets, run finished after 493 ms. (steps per millisecond=2028 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:01] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 03:20:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 03:20:01] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-18 03:20:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:20:01] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-18 03:20:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:20:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 03:20:01] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-18 03:20:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:20:01] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-18 03:20:01] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:20:01] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2022-05-18 03:20:01] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2022-05-18 03:20:01] [INFO ] Added : 6 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 5 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 in SAFETY mode, 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-18 03:20:01] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:20:01] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:01] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 03:20:01] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:20:02] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2022-05-18 03:20:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:02] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:20:02] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Ending property specific reduction for PhilosophersDyn-PT-03-UpperBounds-07 in 2209 ms.
Starting property specific reduction for PhilosophersDyn-PT-03-UpperBounds-09
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:02] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 296 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:02] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:20:02] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 03:20:02] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-18 03:20:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:20:02] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-18 03:20:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:20:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 03:20:02] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-18 03:20:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:20:02] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 03:20:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:20:02] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2022-05-18 03:20:02] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 3 ms.
[2022-05-18 03:20:02] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2022-05-18 03:20:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-18 03:20:02] [INFO ] Added : 8 causal constraints over 2 iterations in 61 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 11 ms. Remains 28 /30 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 28 cols
[2022-05-18 03:20:02] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:20:02] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 49/51 transitions.
// Phase 1: matrix 49 rows 28 cols
[2022-05-18 03:20:02] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 142891 resets, run finished after 1145 ms. (steps per millisecond=873 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 30480 resets, run finished after 418 ms. (steps per millisecond=2392 ) properties (out of 1) seen :1
// Phase 1: matrix 49 rows 28 cols
[2022-05-18 03:20:03] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 03:20:03] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 03:20:03] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-18 03:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:20:03] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-18 03:20:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:20:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 03:20:03] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-18 03:20:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:20:03] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 03:20:03] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:20:03] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2022-05-18 03:20:03] [INFO ] Computed and/alt/rep : 13/103/13 causal constraints (skipped 33 transitions) in 3 ms.
[2022-05-18 03:20:03] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 28/28 places, 49/49 transitions.
Applied a total of 0 rules in 3 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 in SAFETY mode, iteration 0 : 28/28 places, 49/49 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 49/49 (removed 0) transitions.
// Phase 1: matrix 49 rows 28 cols
[2022-05-18 03:20:03] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:20:04] [INFO ] Implicit Places using invariants in 35 ms returned [1, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, 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-18 03:20:04] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-18 03:20:04] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 47 rows 24 cols
[2022-05-18 03:20:04] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-18 03:20:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:20:04] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 24/28 places, 47/49 transitions.
Finished structural reductions, in 2 iterations. Remains : 24/28 places, 47/49 transitions.
// Phase 1: matrix 47 rows 24 cols
[2022-05-18 03:20:04] [INFO ] Computed 9 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 176345 resets, run finished after 1148 ms. (steps per millisecond=871 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 41627 resets, run finished after 363 ms. (steps per millisecond=2754 ) properties (out of 1) seen :1
// Phase 1: matrix 47 rows 24 cols
[2022-05-18 03:20:05] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-18 03:20:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 03:20:05] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-18 03:20:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:20:05] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-18 03:20:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 03:20:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 03:20:05] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-18 03:20:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 03:20:05] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 03:20:05] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:20:05] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-05-18 03:20:05] [INFO ] Computed and/alt/rep : 11/87/11 causal constraints (skipped 33 transitions) in 5 ms.
[2022-05-18 03:20:05] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 in SAFETY mode, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
// Phase 1: matrix 47 rows 24 cols
[2022-05-18 03:20:05] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-18 03:20:05] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 47 rows 24 cols
[2022-05-18 03:20:05] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-18 03:20:05] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:20:05] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-18 03:20:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 47 rows 24 cols
[2022-05-18 03:20:05] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-18 03:20:05] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 47/47 transitions.
Ending property specific reduction for PhilosophersDyn-PT-03-UpperBounds-09 in 3837 ms.
[2022-05-18 03:20:06] [INFO ] Flatten gal took : 31 ms
[2022-05-18 03:20:06] [INFO ] Applying decomposition
[2022-05-18 03:20:06] [INFO ] Flatten gal took : 10 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/graph3162169508271454593.txt' '-o' '/tmp/graph3162169508271454593.bin' '-w' '/tmp/graph3162169508271454593.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3162169508271454593.bin' '-l' '-1' '-v' '-w' '/tmp/graph3162169508271454593.weights' '-q' '0' '-e' '0.001'
[2022-05-18 03:20:06] [INFO ] Decomposing Gal with order
[2022-05-18 03:20:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 03:20:06] [INFO ] Removed a total of 96 redundant transitions.
[2022-05-18 03:20:06] [INFO ] Flatten gal took : 41 ms
[2022-05-18 03:20:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-18 03:20:06] [INFO ] Time to serialize gal into /tmp/UpperBounds9801190940454401100.gal : 4 ms
[2022-05-18 03:20:06] [INFO ] Time to serialize properties into /tmp/UpperBounds8708346258222344940.prop : 0 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/UpperBounds9801190940454401100.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8708346258222344940.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...295
Loading property file /tmp/UpperBounds8708346258222344940.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.032666,4108,2,454,5,2219,6,0,180,1902,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 <= gi1.gu6.Forks_1+gi0.gu3.Forks_2+gi2.gu4.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.033262,4108,1,0,7,2219,9,1,261,1902,4
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-03-UpperBounds-07 :0 <= gi1.gu6.Forks_1+gi0.gu3.Forks_2+gi2.gu4.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.033334,4108,1,0,7,2219,9,1,261,1902,4
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property PhilosophersDyn-PT-03-UpperBounds-09 :0 <= gi1.gu6.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.033504,4108,1,0,8,2219,10,1,286,1902,5
Total runtime 13278 ms.

BK_STOP 1652844006352

--------------------
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-03"
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-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 r168-tall-165277016600413"
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 ;