About the Execution of 2021-gold for PhilosophersDyn-COL-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 371.271 | 16874.00 | 27909.00 | 293.90 | 2 3 3 3 3 3 3 2 3 3 3 2 3 2 3 3 | normal |
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-165277026800139.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-COL-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026800139
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 7.9K Apr 30 07:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 30 07:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 30 07:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 3.7K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 31K 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-COL-03-UpperBounds-00
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-01
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-02
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-03
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-04
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-05
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-06
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-07
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-08
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-09
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-10
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-11
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-12
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-13
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-14
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652830440856
Running Version 0
[2022-05-17 23:34:02] [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:34:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 23:34:02] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-17 23:34:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 23:34:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 549 ms
[2022-05-17 23:34:03] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-17 23:34:03] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions in 3 ms.
[2022-05-17 23:34:03] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_11992823711990534532.dot
// Phase 1: matrix 7 rows 8 cols
[2022-05-17 23:34:03] [INFO ] Computed 3 place invariants in 4 ms
FORMULA PhilosophersDyn-COL-03-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-17 23:34:03] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions in 11 ms.
[2022-05-17 23:34:03] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 7 rows 8 cols
[2022-05-17 23:34:03] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 23:34:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 23:34:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-17 23:34:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 23:34:03] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 9 ms.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 23:34:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 23:34:03] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 12 ms.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 23:34:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 23:34:03] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 23:34:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 23:34:03] [INFO ] Added : 6 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 23:34:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-17 23:34:03] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 23:34:03] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 23:34:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 23:34:03] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 23:34:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 23:34:03] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 23:34:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-17 23:34:03] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 23:34:03] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 23:34:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 23:34:03] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 23:34:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:03] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 23:34:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:03] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 23:34:03] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 23:34:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:04] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 23:34:04] [INFO ] Added : 6 causal constraints over 2 iterations in 71 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 23:34:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:04] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 23:34:04] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 23:34:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-17 23:34:04] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 23:34:04] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 8 ms.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 23:34:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:04] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 23:34:04] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 23:34:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-17 23:34:04] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 23:34:04] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [-1, 3, 3, 3, 3, 3, 3, -1, 3, 3, 3, 3, -1, 3, 3]
[2022-05-17 23:34:04] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions in 4 ms.
[2022-05-17 23:34:04] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_10524598047593673928.dot
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 15) seen :41
FORMULA PhilosophersDyn-COL-03-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 236 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10001 steps, including 237 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10001 steps, including 380 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10001 steps, including 238 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :8
[2022-05-17 23:34:04] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2022-05-17 23:34:04] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 18 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-17 23:34:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-17 23:34:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-17 23:34:04] [INFO ] [Nat]Added 36 Read/Feed constraints in 20 ms returned sat
[2022-05-17 23:34:04] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 7 ms.
[2022-05-17 23:34:04] [INFO ] Added : 5 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 19 ms.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-17 23:34:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2022-05-17 23:34:04] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 7 ms.
[2022-05-17 23:34:04] [INFO ] Added : 5 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 12 ms.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 23:34:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2022-05-17 23:34:04] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 7 ms.
[2022-05-17 23:34:04] [INFO ] Added : 6 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 14 ms.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:04] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 23:34:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:05] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-17 23:34:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:05] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 23:34:05] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2022-05-17 23:34:05] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 7 ms.
[2022-05-17 23:34:05] [INFO ] Added : 5 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [2147483647, 2147483647, 3, 2147483647] Max seen :[2, 2, 2, 2]
Incomplete Parikh walk after 2700 steps, including 571 resets, run finished after 12 ms. (steps per millisecond=225 ) properties (out of 4) seen :8 could not realise parikh vector
Incomplete Parikh walk after 2400 steps, including 412 resets, run finished after 8 ms. (steps per millisecond=300 ) properties (out of 4) seen :8 could not realise parikh vector
Incomplete Parikh walk after 2700 steps, including 572 resets, run finished after 7 ms. (steps per millisecond=385 ) properties (out of 4) seen :8 could not realise parikh vector
Incomplete Parikh walk after 2700 steps, including 581 resets, run finished after 18 ms. (steps per millisecond=150 ) properties (out of 4) seen :8 could not realise parikh vector
Support contains 6 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 37 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2022-05-17 23:34:05] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2022-05-17 23:34:05] [INFO ] Computed 11 place invariants in 8 ms
[2022-05-17 23:34:05] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned [3, 6, 7, 9, 11, 12, 13, 16, 19, 20, 21, 23, 25, 26, 29, 30, 33, 34, 36, 38, 39, 40, 43, 46, 47, 48, 50, 52, 53, 56]
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions :[56, 53, 52, 50, 48, 47, 46, 43, 40, 39, 38, 36, 34, 33, 30, 29, 26, 25, 23, 21, 20, 19, 16, 13, 12, 11, 9, 7, 6, 3]
Starting structural reductions, 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 2 iterations. Remains : 30/30 places, 51/81 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:05] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 143272 resets, run finished after 1272 ms. (steps per millisecond=786 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 23677 resets, run finished after 470 ms. (steps per millisecond=2127 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 23665 resets, run finished after 436 ms. (steps per millisecond=2293 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 38217 resets, run finished after 494 ms. (steps per millisecond=2024 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 23678 resets, run finished after 461 ms. (steps per millisecond=2169 ) properties (out of 4) seen :8
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:08] [INFO ] Computed 11 place invariants in 6 ms
[2022-05-17 23:34:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:08] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 23:34:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:08] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-17 23:34:08] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:34:08] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-05-17 23:34:08] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 4 ms to minimize.
[2022-05-17 23:34:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-17 23:34:08] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2022-05-17 23:34:08] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 12 ms.
[2022-05-17 23:34:08] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:08] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 23:34:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:08] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2022-05-17 23:34:08] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2022-05-17 23:34:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2022-05-17 23:34:08] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2022-05-17 23:34:08] [INFO ] Added : 7 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 13 ms.
[2022-05-17 23:34:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:08] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 23:34:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:08] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2022-05-17 23:34:08] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 1 ms to minimize.
[2022-05-17 23:34:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2022-05-17 23:34:08] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 6 ms.
[2022-05-17 23:34:08] [INFO ] Added : 7 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 12 ms.
[2022-05-17 23:34:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:08] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:34:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:08] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-17 23:34:08] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-05-17 23:34:08] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 2 ms to minimize.
[2022-05-17 23:34:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2022-05-17 23:34:08] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2022-05-17 23:34:08] [INFO ] Added : 7 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [2147483647, 2147483647, 3, 2147483647] Max seen :[2, 2, 2, 2]
Incomplete Parikh walk after 3300 steps, including 410 resets, run finished after 10 ms. (steps per millisecond=330 ) properties (out of 4) seen :8 could not realise parikh vector
Incomplete Parikh walk after 4900 steps, including 633 resets, run finished after 10 ms. (steps per millisecond=490 ) properties (out of 4) seen :8 could not realise parikh vector
Incomplete Parikh walk after 3300 steps, including 399 resets, run finished after 7 ms. (steps per millisecond=471 ) properties (out of 4) seen :8 could not realise parikh vector
Incomplete Parikh walk after 3300 steps, including 416 resets, run finished after 7 ms. (steps per millisecond=471 ) properties (out of 4) seen :8 could not realise parikh vector
Support contains 6 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.
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 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-17 23:34:08] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 23:34:08] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:08] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:34:08] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:34:09] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2022-05-17 23:34:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:09] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:34:09] [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.
Starting property specific reduction for PhilosophersDyn-COL-03-UpperBounds-00
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:09] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1431 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 239 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:09] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-17 23:34:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:09] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:09] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 23:34:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:09] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 23:34:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:09] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-17 23:34:09] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:34:09] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-05-17 23:34:09] [INFO ] Deduced a trap composed of 7 places in 11 ms of which 1 ms to minimize.
[2022-05-17 23:34:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2022-05-17 23:34:09] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2022-05-17 23:34:09] [INFO ] Added : 7 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 3300 steps, including 405 resets, run finished after 9 ms. (steps per millisecond=366 ) 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:34:09] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:34:09] [INFO ] Dead Transitions using invariants and state equation in 29 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:34:09] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 143413 resets, run finished after 1020 ms. (steps per millisecond=980 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 23674 resets, run finished after 406 ms. (steps per millisecond=2463 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:10] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-17 23:34:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:10] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:34:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:10] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:10] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:34:10] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:34:10] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-05-17 23:34:10] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2022-05-17 23:34:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-17 23:34:10] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2022-05-17 23:34:10] [INFO ] Added : 7 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 3300 steps, including 402 resets, run finished after 5 ms. (steps per millisecond=660 ) 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.
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:34:10] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 23:34:10] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:10] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:34:10] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:34:10] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-05-17 23:34:10] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:10] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-17 23:34:10] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Ending property specific reduction for PhilosophersDyn-COL-03-UpperBounds-00 in 1849 ms.
Starting property specific reduction for PhilosophersDyn-COL-03-UpperBounds-07
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:10] [INFO ] Computed 11 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 1441 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 233 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:10] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 23:34:10] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:10] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:10] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 23:34:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:10] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:10] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:34:10] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:34:10] [INFO ] [Nat]Added 30 Read/Feed constraints in 9 ms returned sat
[2022-05-17 23:34:10] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 1 ms to minimize.
[2022-05-17 23:34:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-17 23:34:10] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2022-05-17 23:34:11] [INFO ] Added : 7 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 3300 steps, including 409 resets, run finished after 8 ms. (steps per millisecond=412 ) 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:34:11] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 23:34:11] [INFO ] Dead Transitions using invariants and state equation in 27 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:34:11] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 143266 resets, run finished after 1013 ms. (steps per millisecond=987 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 23690 resets, run finished after 396 ms. (steps per millisecond=2525 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:12] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:34:12] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:12] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:12] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:34:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:12] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 23:34:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:12] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-17 23:34:12] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:34:12] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-05-17 23:34:12] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2022-05-17 23:34:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-17 23:34:12] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2022-05-17 23:34:12] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 3300 steps, including 410 resets, run finished after 9 ms. (steps per millisecond=366 ) 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.
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:34:12] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 23:34:12] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:12] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 23:34:12] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:34:12] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-05-17 23:34:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:12] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-17 23:34:12] [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.
Ending property specific reduction for PhilosophersDyn-COL-03-UpperBounds-07 in 1861 ms.
Starting property specific reduction for PhilosophersDyn-COL-03-UpperBounds-11
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:12] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1415 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 379 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:12] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:34:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:12] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 23:34:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:12] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 23:34:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:12] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:12] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 23:34:12] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:34:12] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-05-17 23:34:12] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 1 ms to minimize.
[2022-05-17 23:34:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2022-05-17 23:34:12] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2022-05-17 23:34:12] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[2]
Incomplete Parikh walk after 4900 steps, including 627 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 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:34:12] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:34:12] [INFO ] Dead Transitions using invariants and state equation in 24 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:34:12] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 143175 resets, run finished after 1005 ms. (steps per millisecond=995 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 38274 resets, run finished after 396 ms. (steps per millisecond=2525 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:14] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:34:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:14] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 23:34:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:14] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 23:34:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:14] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 23:34:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:14] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-17 23:34:14] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:34:14] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2022-05-17 23:34:14] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 0 ms to minimize.
[2022-05-17 23:34:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2022-05-17 23:34:14] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2022-05-17 23:34:14] [INFO ] Added : 7 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[2]
Incomplete Parikh walk after 4900 steps, including 625 resets, run finished after 10 ms. (steps per millisecond=490 ) 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.
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:34:14] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:34:14] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:14] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 23:34:14] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:34:14] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-17 23:34:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:14] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 23:34:14] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Ending property specific reduction for PhilosophersDyn-COL-03-UpperBounds-11 in 1817 ms.
Starting property specific reduction for PhilosophersDyn-COL-03-UpperBounds-13
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:14] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1423 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 236 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:14] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:34:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:14] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:14] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:34:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:14] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 23:34:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:14] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-17 23:34:14] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:34:14] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-05-17 23:34:14] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2022-05-17 23:34:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-17 23:34:14] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2022-05-17 23:34:14] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 3300 steps, including 402 resets, run finished after 8 ms. (steps per millisecond=412 ) 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:34:14] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 23:34:14] [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:34:14] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 143014 resets, run finished after 996 ms. (steps per millisecond=1004 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 23685 resets, run finished after 394 ms. (steps per millisecond=2538 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:16] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:34:16] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:16] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:16] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:34:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:16] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 23:34:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:16] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 23:34:16] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:34:16] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-05-17 23:34:16] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
[2022-05-17 23:34:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2022-05-17 23:34:16] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 6 ms.
[2022-05-17 23:34:16] [INFO ] Added : 7 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 3300 steps, including 397 resets, run finished after 6 ms. (steps per millisecond=550 ) 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.
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:34:16] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:34:16] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:16] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:34:16] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 23:34:16] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2022-05-17 23:34:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-17 23:34:16] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 23:34:16] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Ending property specific reduction for PhilosophersDyn-COL-03-UpperBounds-13 in 1836 ms.
[2022-05-17 23:34:16] [INFO ] Flatten gal took : 28 ms
[2022-05-17 23:34:16] [INFO ] Applying decomposition
[2022-05-17 23:34:16] [INFO ] Flatten gal took : 9 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/graph6457259675961843350.txt, -o, /tmp/graph6457259675961843350.bin, -w, /tmp/graph6457259675961843350.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/graph6457259675961843350.bin, -l, -1, -v, -w, /tmp/graph6457259675961843350.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-17 23:34:16] [INFO ] Decomposing Gal with order
[2022-05-17 23:34:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 23:34:16] [INFO ] Removed a total of 96 redundant transitions.
[2022-05-17 23:34:16] [INFO ] Flatten gal took : 30 ms
[2022-05-17 23:34:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-17 23:34:16] [INFO ] Time to serialize gal into /tmp/UpperBounds7010059764785144605.gal : 3 ms
[2022-05-17 23:34:16] [INFO ] Time to serialize properties into /tmp/UpperBounds3403319274876461288.prop : 0 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/UpperBounds7010059764785144605.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3403319274876461288.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/UpperBounds7010059764785144605.gal -t CGAL -reachable-file /tmp/UpperBounds3403319274876461288.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds3403319274876461288.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.034888,4368,2,552,5,2507,6,0,180,2015,0
Total reachable state count : 325
Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-03-UpperBounds-00 :0 <= gi0.gu3.Forks_0+gi1.gu5.Forks_1+gi2.gu4.Forks_2 <= 2
FORMULA PhilosophersDyn-COL-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-COL-03-UpperBounds-00,0,0.036045,4368,1,0,7,2507,9,1,259,2015,4
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-03-UpperBounds-07 :0 <= gi0.gu3.Forks_0+gi1.gu5.Forks_1+gi2.gu4.Forks_2 <= 2
FORMULA PhilosophersDyn-COL-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-COL-03-UpperBounds-07,0,0.03613,4368,1,0,7,2507,9,1,259,2015,4
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-03-UpperBounds-11 :0 <= gi0.gu3.HasLeft_0+gi1.gu5.HasLeft_1+gi2.gu4.HasLeft_2 <= 2
FORMULA PhilosophersDyn-COL-03-UpperBounds-11 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-COL-03-UpperBounds-11,0,0.037576,4368,1,0,8,2507,10,1,320,2015,5
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-03-UpperBounds-13 :0 <= gi0.gu3.Forks_0+gi1.gu5.Forks_1+gi2.gu4.Forks_2 <= 2
FORMULA PhilosophersDyn-COL-03-UpperBounds-13 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-COL-03-UpperBounds-13,0,0.03765,4368,1,0,8,2507,10,1,320,2015,5
BK_STOP 1652830457730
--------------------
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-COL-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-COL-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-165277026800139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-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 '
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 ;