fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r319-tall-167873969800017
Last Updated
May 14, 2023

About the Execution of 2022-gold for Philosophers-COL-000500

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
771.995 164043.00 183032.00 377.80 500 250 500 500 500 500 250 500 500 500 500 500 250 500 500 250 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r319-tall-167873969800017.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is Philosophers-COL-000500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-167873969800017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 9.1K Feb 25 14:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 14:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 25 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 25 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 31K Mar 5 18:23 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 Philosophers-COL-000500-UpperBounds-00
FORMULA_NAME Philosophers-COL-000500-UpperBounds-01
FORMULA_NAME Philosophers-COL-000500-UpperBounds-02
FORMULA_NAME Philosophers-COL-000500-UpperBounds-03
FORMULA_NAME Philosophers-COL-000500-UpperBounds-04
FORMULA_NAME Philosophers-COL-000500-UpperBounds-05
FORMULA_NAME Philosophers-COL-000500-UpperBounds-06
FORMULA_NAME Philosophers-COL-000500-UpperBounds-07
FORMULA_NAME Philosophers-COL-000500-UpperBounds-08
FORMULA_NAME Philosophers-COL-000500-UpperBounds-09
FORMULA_NAME Philosophers-COL-000500-UpperBounds-10
FORMULA_NAME Philosophers-COL-000500-UpperBounds-11
FORMULA_NAME Philosophers-COL-000500-UpperBounds-12
FORMULA_NAME Philosophers-COL-000500-UpperBounds-13
FORMULA_NAME Philosophers-COL-000500-UpperBounds-14
FORMULA_NAME Philosophers-COL-000500-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678866331130

Running Version 202205111006
[2023-03-15 07:45:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 07:45:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:45:32] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 07:45:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 07:45:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 572 ms
[2023-03-15 07:45:33] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 2500 PT places and 2500.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-15 07:45:33] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2023-03-15 07:45:33] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2023-03-15 07:45:33] [INFO ] Computed 2 place invariants in 6 ms
FORMULA Philosophers-COL-000500-UpperBounds-14 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-13 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-11 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-10 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-09 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-05 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-04 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-03 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-02 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 5 rows 5 cols
[2023-03-15 07:45:33] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-15 07:45:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-15 07:45:33] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 07:45:33] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-15 07:45:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-15 07:45:33] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:33] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 11 ms.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-15 07:45:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-15 07:45:33] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 07:45:33] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-15 07:45:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-15 07:45:33] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:33] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-15 07:45:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-15 07:45:33] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:33] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 2 ms.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-15 07:45:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-15 07:45:33] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:33] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-15 07:45:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-15 07:45:33] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:33] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [500, 250, 250, 500, 500, 250, 250]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 500) 500) 500)]] contains successor/predecessor on variables of sort Philo
[2023-03-15 07:45:33] [INFO ] Unfolded HLPN to a Petri net with 2500 places and 2500 transitions 8000 arcs in 57 ms.
[2023-03-15 07:45:33] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1460 ms. (steps per millisecond=6 ) properties (out of 7) seen :1041
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 7) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 7) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 7) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 7) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 7) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 7) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 7) seen :11
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-15 07:45:37] [INFO ] Computed 1000 place invariants in 31 ms
[2023-03-15 07:45:37] [INFO ] [Real]Absence check using 1000 positive place invariants in 305 ms returned sat
[2023-03-15 07:45:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:38] [INFO ] [Real]Absence check using state equation in 1006 ms returned sat
[2023-03-15 07:45:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:39] [INFO ] [Nat]Absence check using 1000 positive place invariants in 248 ms returned sat
[2023-03-15 07:45:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:40] [INFO ] [Nat]Absence check using state equation in 966 ms returned sat
[2023-03-15 07:45:40] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 123 ms.
[2023-03-15 07:45:42] [INFO ] Added : 55 causal constraints over 11 iterations in 1584 ms. Result :sat
Minimization took 388 ms.
[2023-03-15 07:45:43] [INFO ] [Real]Absence check using 1000 positive place invariants in 210 ms returned sat
[2023-03-15 07:45:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using state equation in 987 ms returned sat
[2023-03-15 07:45:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using 1000 positive place invariants in 223 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:45] [INFO ] [Nat]Absence check using state equation in 1044 ms returned sat
[2023-03-15 07:45:45] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 140 ms.
[2023-03-15 07:45:47] [INFO ] Added : 82 causal constraints over 17 iterations in 2201 ms. Result :sat
Minimization took 769 ms.
[2023-03-15 07:45:49] [INFO ] [Real]Absence check using 1000 positive place invariants in 218 ms returned sat
[2023-03-15 07:45:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:50] [INFO ] [Real]Absence check using state equation in 1029 ms returned sat
[2023-03-15 07:45:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:50] [INFO ] [Nat]Absence check using 1000 positive place invariants in 218 ms returned sat
[2023-03-15 07:45:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:51] [INFO ] [Nat]Absence check using state equation in 1014 ms returned sat
[2023-03-15 07:45:52] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 119 ms.
[2023-03-15 07:45:54] [INFO ] Added : 82 causal constraints over 17 iterations in 2175 ms. Result :sat
Minimization took 717 ms.
[2023-03-15 07:45:55] [INFO ] [Real]Absence check using 1000 positive place invariants in 266 ms returned sat
[2023-03-15 07:45:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:56] [INFO ] [Real]Absence check using state equation in 936 ms returned sat
[2023-03-15 07:45:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:57] [INFO ] [Nat]Absence check using 1000 positive place invariants in 266 ms returned sat
[2023-03-15 07:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:58] [INFO ] [Nat]Absence check using state equation in 1016 ms returned sat
[2023-03-15 07:45:58] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 121 ms.
[2023-03-15 07:45:59] [INFO ] Added : 55 causal constraints over 11 iterations in 1509 ms. Result :sat
Minimization took 404 ms.
[2023-03-15 07:46:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 259 ms returned sat
[2023-03-15 07:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:01] [INFO ] [Real]Absence check using state equation in 999 ms returned sat
[2023-03-15 07:46:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:46:02] [INFO ] [Nat]Absence check using 1000 positive place invariants in 261 ms returned sat
[2023-03-15 07:46:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:03] [INFO ] [Nat]Absence check using state equation in 1038 ms returned sat
[2023-03-15 07:46:03] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 113 ms.
[2023-03-15 07:46:04] [INFO ] Added : 55 causal constraints over 11 iterations in 1544 ms. Result :sat
Minimization took 391 ms.
[2023-03-15 07:46:05] [INFO ] [Real]Absence check using 1000 positive place invariants in 219 ms returned sat
[2023-03-15 07:46:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:06] [INFO ] [Real]Absence check using state equation in 1004 ms returned sat
[2023-03-15 07:46:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:46:07] [INFO ] [Nat]Absence check using 1000 positive place invariants in 219 ms returned sat
[2023-03-15 07:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:08] [INFO ] [Nat]Absence check using state equation in 1048 ms returned sat
[2023-03-15 07:46:08] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 120 ms.
[2023-03-15 07:46:10] [INFO ] Added : 82 causal constraints over 17 iterations in 2214 ms. Result :sat
Minimization took 729 ms.
[2023-03-15 07:46:12] [INFO ] [Real]Absence check using 1000 positive place invariants in 212 ms returned sat
[2023-03-15 07:46:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:13] [INFO ] [Real]Absence check using state equation in 970 ms returned sat
[2023-03-15 07:46:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:46:13] [INFO ] [Nat]Absence check using 1000 positive place invariants in 213 ms returned sat
[2023-03-15 07:46:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:14] [INFO ] [Nat]Absence check using state equation in 990 ms returned sat
[2023-03-15 07:46:14] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 112 ms.
[2023-03-15 07:46:16] [INFO ] Added : 82 causal constraints over 17 iterations in 2159 ms. Result :sat
Minimization took 748 ms.
Current structural bounds on expressions (after SMT) : [500, 250, 250, 500, 500, 250, 250] Max seen :[239, 81, 81, 239, 239, 81, 81]
FORMULA Philosophers-COL-000500-UpperBounds-08 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-07 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-00 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Free-agglomeration rule (complex) applied 1000 times.
Iterating global reduction 0 with 1000 rules applied. Total rules applied 1000 place count 2500 transition count 1500
Reduce places removed 1000 places and 0 transitions.
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 1500 rules applied. Total rules applied 2500 place count 1500 transition count 1000
Applied a total of 2500 rules in 499 ms. Remains 1500 /2500 variables (removed 1000) and now considering 1000/2500 (removed 1500) transitions.
Finished structural reductions, in 1 iterations. Remains : 1500/2500 places, 1000/2500 transitions.
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-15 07:47:13] [INFO ] Computed 1000 place invariants in 4 ms
Finished random walk after 249177 steps, including 0 resets, run visited all 4 properties in 30001 ms. (steps per millisecond=8 )
Finished Best-First random walk after 180028 steps, including 0 resets, run visited all 4 properties in 5006 ms. (steps per millisecond=35 )
Finished Best-First random walk after 167544 steps, including 0 resets, run visited all 4 properties in 5008 ms. (steps per millisecond=33 )
Finished Best-First random walk after 163852 steps, including 0 resets, run visited all 4 properties in 5002 ms. (steps per millisecond=32 )
Finished Best-First random walk after 164084 steps, including 0 resets, run visited all 4 properties in 5001 ms. (steps per millisecond=32 )
// Phase 1: matrix 1000 rows 1500 cols
[2023-03-15 07:48:03] [INFO ] Computed 1000 place invariants in 7 ms
[2023-03-15 07:48:03] [INFO ] [Real]Absence check using 1000 positive place invariants in 282 ms returned sat
[2023-03-15 07:48:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:48:04] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2023-03-15 07:48:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:48:04] [INFO ] [Nat]Absence check using 1000 positive place invariants in 259 ms returned sat
[2023-03-15 07:48:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:48:04] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2023-03-15 07:48:05] [INFO ] Computed and/alt/rep : 500/500/500 causal constraints (skipped 0 transitions) in 60 ms.
[2023-03-15 07:48:05] [INFO ] Added : 0 causal constraints over 0 iterations in 163 ms. Result :sat
Minimization took 280 ms.
[2023-03-15 07:48:05] [INFO ] [Real]Absence check using 1000 positive place invariants in 255 ms returned sat
[2023-03-15 07:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:48:06] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2023-03-15 07:48:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:48:06] [INFO ] [Nat]Absence check using 1000 positive place invariants in 266 ms returned sat
[2023-03-15 07:48:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:48:07] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2023-03-15 07:48:07] [INFO ] Computed and/alt/rep : 500/500/500 causal constraints (skipped 0 transitions) in 38 ms.
[2023-03-15 07:48:07] [INFO ] Added : 0 causal constraints over 0 iterations in 132 ms. Result :sat
Minimization took 273 ms.
[2023-03-15 07:48:08] [INFO ] [Real]Absence check using 1000 positive place invariants in 267 ms returned sat
[2023-03-15 07:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:48:08] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2023-03-15 07:48:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:48:09] [INFO ] [Nat]Absence check using 1000 positive place invariants in 272 ms returned sat
[2023-03-15 07:48:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:48:09] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2023-03-15 07:48:09] [INFO ] Computed and/alt/rep : 500/500/500 causal constraints (skipped 0 transitions) in 46 ms.
[2023-03-15 07:48:09] [INFO ] Added : 0 causal constraints over 0 iterations in 147 ms. Result :sat
Minimization took 277 ms.
[2023-03-15 07:48:10] [INFO ] [Real]Absence check using 1000 positive place invariants in 267 ms returned sat
[2023-03-15 07:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:48:10] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2023-03-15 07:48:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:48:11] [INFO ] [Nat]Absence check using 1000 positive place invariants in 277 ms returned sat
[2023-03-15 07:48:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:48:11] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2023-03-15 07:48:12] [INFO ] Computed and/alt/rep : 500/500/500 causal constraints (skipped 0 transitions) in 46 ms.
[2023-03-15 07:48:12] [INFO ] Added : 0 causal constraints over 0 iterations in 141 ms. Result :sat
Minimization took 286 ms.
Current structural bounds on expressions (after SMT) : [250, 250, 250, 250] Max seen :[245, 245, 245, 245]
FORMULA Philosophers-COL-000500-UpperBounds-15 250 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-12 250 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-06 250 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-01 250 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 162642 ms.

BK_STOP 1678866495173

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="Philosophers-COL-000500"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is Philosophers-COL-000500, 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 r319-tall-167873969800017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000500.tgz
mv Philosophers-COL-000500 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 ;