MCC'2023- Execution of r293-tall-167873945200269

About the Execution of ITS-Tools for Philosophers-PT-010000

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
10061.100	3600000.00	3891670.00	18700.90	? ? ? ? ? 10000 10000 ? 1 1 1 1 1 1 1 1	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.r293-tall-167873945200269.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 itstools
Input is Philosophers-PT-010000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945200269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 321M
-rw-r--r-- 1 mcc users 11M Feb 26 03:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52M Feb 26 03:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9M Feb 25 19:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 34M Feb 25 19:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0M Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21M Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6M Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17M Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9M Feb 26 20:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47M Feb 26 20:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14M Feb 26 12:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79M Feb 26 12:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.1M Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 2.7M Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 22M 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-PT-010000-UpperBounds-00
FORMULA_NAME Philosophers-PT-010000-UpperBounds-01
FORMULA_NAME Philosophers-PT-010000-UpperBounds-02
FORMULA_NAME Philosophers-PT-010000-UpperBounds-03
FORMULA_NAME Philosophers-PT-010000-UpperBounds-04
FORMULA_NAME Philosophers-PT-010000-UpperBounds-05
FORMULA_NAME Philosophers-PT-010000-UpperBounds-06
FORMULA_NAME Philosophers-PT-010000-UpperBounds-07
FORMULA_NAME Philosophers-PT-010000-UpperBounds-08
FORMULA_NAME Philosophers-PT-010000-UpperBounds-09
FORMULA_NAME Philosophers-PT-010000-UpperBounds-10
FORMULA_NAME Philosophers-PT-010000-UpperBounds-11
FORMULA_NAME Philosophers-PT-010000-UpperBounds-12
FORMULA_NAME Philosophers-PT-010000-UpperBounds-13
FORMULA_NAME Philosophers-PT-010000-UpperBounds-14
FORMULA_NAME Philosophers-PT-010000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678817237481

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-010000
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-14 18:07:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 18:07:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 18:07:20] [INFO ] Load time of PNML (sax parser for PT used): 924 ms
[2023-03-14 18:07:20] [INFO ] Transformed 50000 places.
[2023-03-14 18:07:20] [INFO ] Transformed 50000 transitions.
[2023-03-14 18:07:20] [INFO ] Parsed PT model containing 50000 places and 50000 transitions and 160000 arcs in 1210 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18653 ms.
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-14 18:07:39] [INFO ] Computed 20000 place invariants in 276 ms
FORMULA Philosophers-PT-010000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-06 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-05 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 5186 steps, including 1 resets, run visited all 9 properties in 30001 ms. (steps per millisecond=0 )
FORMULA Philosophers-PT-010000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-010000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-010000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5045 ms. (steps per millisecond=1 ) properties seen 2
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5372 ms. (steps per millisecond=1 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5396 ms. (steps per millisecond=1 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5492 ms. (steps per millisecond=1 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5524 ms. (steps per millisecond=1 ) properties (out of 6) seen :0
[2023-03-14 18:08:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 10000, 10000] Max seen :[1327, 1449, 1327, 1449, 247, 1327]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 491 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 499 ms. Remains : 50000/50000 places, 50000/50000 transitions.
[2023-03-14 18:09:12] [INFO ] Invariant cache hit.
Finished random walk after 4353 steps, including 0 resets, run visited all 6 properties in 30005 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5026 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5017 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5176 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5509 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5053 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5369 ms. (steps per millisecond=1 ) properties seen 3
[2023-03-14 18:10:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 10000, 10000] Max seen :[1683, 1693, 1683, 1693, 407, 1683]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 319 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 319 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 265 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2023-03-14 18:11:05] [INFO ] Invariant cache hit.
[2023-03-14 18:11:08] [INFO ] Implicit Places using invariants in 3749 ms returned []
Implicit Place search using SMT only with invariants took 3752 ms to find 0 implicit places.
[2023-03-14 18:11:08] [INFO ] Invariant cache hit.
[2023-03-14 18:11:13] [INFO ] Dead Transitions using invariants and state equation in 4237 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8259 ms. Remains : 50000/50000 places, 50000/50000 transitions.
[2023-03-14 18:11:13] [INFO ] Invariant cache hit.
Finished random walk after 4218 steps, including 0 resets, run visited all 6 properties in 30004 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5542 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5437 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5441 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5537 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5037 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5568 ms. (steps per millisecond=1 ) properties seen 3
[2023-03-14 18:12:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 10000, 10000] Max seen :[1683, 1693, 1683, 1693, 407, 1683]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 245 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 257 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2023-03-14 18:13:09] [INFO ] Invariant cache hit.
[2023-03-14 18:13:13] [INFO ] Implicit Places using invariants in 3773 ms returned []
Implicit Place search using SMT only with invariants took 3775 ms to find 0 implicit places.
[2023-03-14 18:13:13] [INFO ] Invariant cache hit.
[2023-03-14 18:13:17] [INFO ] Dead Transitions using invariants and state equation in 4237 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8271 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-00
[2023-03-14 18:13:17] [INFO ] Invariant cache hit.
Finished random walk after 7153 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5416 ms. (steps per millisecond=1 )
[2023-03-14 18:13:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1433]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 11 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 19367 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19369 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-14 18:14:17] [INFO ] Computed 20000 place invariants in 62 ms
Finished random walk after 11361 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5444 ms. (steps per millisecond=1 )
[2023-03-14 18:14:53] [INFO ] Invariant cache hit.
[2023-03-14 18:15:38] [INFO ] [Real]Absence check using 20000 positive place invariants in 40902 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6032]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 201 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 164 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 18:15:38] [INFO ] Invariant cache hit.
[2023-03-14 18:15:40] [INFO ] Implicit Places using invariants in 2302 ms returned []
Implicit Place search using SMT only with invariants took 2305 ms to find 0 implicit places.
[2023-03-14 18:15:40] [INFO ] Invariant cache hit.
[2023-03-14 18:15:43] [INFO ] Dead Transitions using invariants and state equation in 2309 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4780 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 18:15:43] [INFO ] Invariant cache hit.
Finished random walk after 11155 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5278 ms. (steps per millisecond=1 )
[2023-03-14 18:16:18] [INFO ] Invariant cache hit.
[2023-03-14 18:17:03] [INFO ] [Real]Absence check using 20000 positive place invariants in 41252 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6032]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 164 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 160 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 18:17:04] [INFO ] Invariant cache hit.
[2023-03-14 18:17:06] [INFO ] Implicit Places using invariants in 2300 ms returned []
Implicit Place search using SMT only with invariants took 2303 ms to find 0 implicit places.
[2023-03-14 18:17:06] [INFO ] Invariant cache hit.
[2023-03-14 18:17:08] [INFO ] Dead Transitions using invariants and state equation in 2306 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4775 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-00 in 231133 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-01
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-14 18:17:08] [INFO ] Computed 20000 place invariants in 176 ms
Finished random walk after 7452 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5242 ms. (steps per millisecond=1 )
[2023-03-14 18:17:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1425]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 10 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 16648 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16650 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-14 18:18:06] [INFO ] Computed 20000 place invariants in 51 ms
Finished random walk after 11416 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5167 ms. (steps per millisecond=1 )
[2023-03-14 18:18:41] [INFO ] Invariant cache hit.
[2023-03-14 18:19:26] [INFO ] [Real]Absence check using 20000 positive place invariants in 41493 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6081]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 140 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 144 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 18:19:26] [INFO ] Invariant cache hit.
[2023-03-14 18:19:29] [INFO ] Implicit Places using invariants in 2330 ms returned []
Implicit Place search using SMT only with invariants took 2334 ms to find 0 implicit places.
[2023-03-14 18:19:29] [INFO ] Invariant cache hit.
[2023-03-14 18:19:31] [INFO ] Dead Transitions using invariants and state equation in 2242 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4722 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 18:19:31] [INFO ] Invariant cache hit.
Finished random walk after 11133 steps, including 0 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5154 ms. (steps per millisecond=1 )
[2023-03-14 18:20:06] [INFO ] Invariant cache hit.
[2023-03-14 18:20:51] [INFO ] [Real]Absence check using 20000 positive place invariants in 41381 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6081]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 178 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 128 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 18:20:52] [INFO ] Invariant cache hit.
[2023-03-14 18:20:54] [INFO ] Implicit Places using invariants in 2211 ms returned []
Implicit Place search using SMT only with invariants took 2212 ms to find 0 implicit places.
[2023-03-14 18:20:54] [INFO ] Invariant cache hit.
[2023-03-14 18:20:56] [INFO ] Dead Transitions using invariants and state equation in 2533 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4875 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-01 in 228055 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-02
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-14 18:20:56] [INFO ] Computed 20000 place invariants in 135 ms
Finished random walk after 7548 steps, including 2 resets, run visited all 1 properties in 30004 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5187 ms. (steps per millisecond=1 )
[2023-03-14 18:21:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1411]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 8 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 17691 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17692 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-14 18:21:55] [INFO ] Computed 20000 place invariants in 55 ms
Finished random walk after 11245 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5342 ms. (steps per millisecond=1 )
[2023-03-14 18:22:30] [INFO ] Invariant cache hit.
[2023-03-14 18:23:15] [INFO ] [Real]Absence check using 20000 positive place invariants in 41136 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[5995]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 141 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 139 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 18:23:15] [INFO ] Invariant cache hit.
[2023-03-14 18:23:18] [INFO ] Implicit Places using invariants in 2309 ms returned []
Implicit Place search using SMT only with invariants took 2310 ms to find 0 implicit places.
[2023-03-14 18:23:18] [INFO ] Invariant cache hit.
[2023-03-14 18:23:20] [INFO ] Dead Transitions using invariants and state equation in 2209 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4660 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 18:23:20] [INFO ] Invariant cache hit.
Finished random walk after 11385 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5249 ms. (steps per millisecond=1 )
[2023-03-14 18:23:55] [INFO ] Invariant cache hit.
[2023-03-14 18:24:40] [INFO ] [Real]Absence check using 20000 positive place invariants in 41156 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6063]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 148 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 132 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 18:24:41] [INFO ] Invariant cache hit.
[2023-03-14 18:24:43] [INFO ] Implicit Places using invariants in 2206 ms returned []
Implicit Place search using SMT only with invariants took 2215 ms to find 0 implicit places.
[2023-03-14 18:24:43] [INFO ] Invariant cache hit.
[2023-03-14 18:24:45] [INFO ] Dead Transitions using invariants and state equation in 2250 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4598 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 18:24:45] [INFO ] Invariant cache hit.
Finished random walk after 11358 steps, including 0 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5163 ms. (steps per millisecond=1 )
[2023-03-14 18:25:20] [INFO ] Invariant cache hit.
[2023-03-14 18:26:06] [INFO ] [Real]Absence check using 20000 positive place invariants in 41183 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6063]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 127 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 127 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 18:26:06] [INFO ] Invariant cache hit.
[2023-03-14 18:26:08] [INFO ] Implicit Places using invariants in 2182 ms returned []
Implicit Place search using SMT only with invariants took 2183 ms to find 0 implicit places.
[2023-03-14 18:26:08] [INFO ] Invariant cache hit.
[2023-03-14 18:26:10] [INFO ] Dead Transitions using invariants and state equation in 2202 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4514 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-02 in 313950 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-03
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-14 18:26:10] [INFO ] Computed 20000 place invariants in 124 ms
Finished random walk after 7596 steps, including 2 resets, run visited all 1 properties in 30004 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5135 ms. (steps per millisecond=1 )
[2023-03-14 18:26:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1433]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 8 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 16022 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16024 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-14 18:27:07] [INFO ] Computed 20000 place invariants in 40 ms
Finished random walk after 11178 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5182 ms. (steps per millisecond=1 )
[2023-03-14 18:27:42] [INFO ] Invariant cache hit.
[2023-03-14 18:28:27] [INFO ] [Real]Absence check using 20000 positive place invariants in 41065 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6045]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 144 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 133 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 18:28:27] [INFO ] Invariant cache hit.
[2023-03-14 18:28:30] [INFO ] Implicit Places using invariants in 2412 ms returned []
Implicit Place search using SMT only with invariants took 2415 ms to find 0 implicit places.
[2023-03-14 18:28:30] [INFO ] Invariant cache hit.
[2023-03-14 18:28:32] [INFO ] Dead Transitions using invariants and state equation in 2569 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5124 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 18:28:32] [INFO ] Invariant cache hit.
Finished random walk after 11273 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5109 ms. (steps per millisecond=1 )
[2023-03-14 18:29:08] [INFO ] Invariant cache hit.
[2023-03-14 18:29:53] [INFO ] [Real]Absence check using 20000 positive place invariants in 41267 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6045]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 168 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 161 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 18:29:53] [INFO ] Invariant cache hit.
[2023-03-14 18:29:56] [INFO ] Implicit Places using invariants in 2536 ms returned []
Implicit Place search using SMT only with invariants took 2545 ms to find 0 implicit places.
[2023-03-14 18:29:56] [INFO ] Invariant cache hit.
[2023-03-14 18:29:58] [INFO ] Dead Transitions using invariants and state equation in 2592 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5301 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-03 in 227985 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-04
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-14 18:29:58] [INFO ] Computed 20000 place invariants in 176 ms
Finished random walk after 7584 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5463 ms. (steps per millisecond=1 ) properties seen 0
[2023-03-14 18:30:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[256]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 50000 transition count 30000
Reduce places removed 20000 places and 0 transitions.
Ensure Unique test removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 30000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 26711 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26711 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-14 18:31:06] [INFO ] Computed 20000 place invariants in 54 ms
Finished random walk after 13671 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5271 ms. (steps per millisecond=1 )
[2023-03-14 18:31:41] [INFO ] Invariant cache hit.
[2023-03-14 18:32:26] [INFO ] [Real]Absence check using 20000 positive place invariants in 41369 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2795]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 148 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 158 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 18:32:27] [INFO ] Invariant cache hit.
[2023-03-14 18:32:29] [INFO ] Implicit Places using invariants in 2250 ms returned []
Implicit Place search using SMT only with invariants took 2251 ms to find 0 implicit places.
[2023-03-14 18:32:29] [INFO ] Invariant cache hit.
[2023-03-14 18:32:31] [INFO ] Dead Transitions using invariants and state equation in 2256 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4666 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 18:32:31] [INFO ] Invariant cache hit.
Finished random walk after 13643 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5227 ms. (steps per millisecond=1 )
[2023-03-14 18:33:06] [INFO ] Invariant cache hit.
[2023-03-14 18:33:49] [INFO ] [Real]Absence check using 20000 positive place invariants in 38739 ms returned sat
[2023-03-14 18:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 18:33:52] [INFO ] [Real]Absence check using state equation in 2597 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2795]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 160 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 136 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 18:33:52] [INFO ] Invariant cache hit.
[2023-03-14 18:33:54] [INFO ] Implicit Places using invariants in 2292 ms returned []
Implicit Place search using SMT only with invariants took 2293 ms to find 0 implicit places.
[2023-03-14 18:33:54] [INFO ] Invariant cache hit.
[2023-03-14 18:33:56] [INFO ] Dead Transitions using invariants and state equation in 2280 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4710 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-04 in 238271 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-07
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-14 18:33:57] [INFO ] Computed 20000 place invariants in 173 ms
Finished random walk after 7486 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5214 ms. (steps per millisecond=1 )
[2023-03-14 18:34:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1358]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 7 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 22357 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22357 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-14 18:34:59] [INFO ] Computed 20000 place invariants in 51 ms
Finished random walk after 11275 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5169 ms. (steps per millisecond=1 )
[2023-03-14 18:35:35] [INFO ] Invariant cache hit.
[2023-03-14 18:36:20] [INFO ] [Real]Absence check using 20000 positive place invariants in 41296 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[5939]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 172 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 138 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 18:36:20] [INFO ] Invariant cache hit.
[2023-03-14 18:36:22] [INFO ] Implicit Places using invariants in 2280 ms returned []
Implicit Place search using SMT only with invariants took 2282 ms to find 0 implicit places.
[2023-03-14 18:36:22] [INFO ] Invariant cache hit.
[2023-03-14 18:36:25] [INFO ] Dead Transitions using invariants and state equation in 2180 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4607 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 18:36:25] [INFO ] Invariant cache hit.
Finished random walk after 11275 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5220 ms. (steps per millisecond=1 )
[2023-03-14 18:37:00] [INFO ] Invariant cache hit.
[2023-03-14 18:37:45] [INFO ] [Real]Absence check using 20000 positive place invariants in 41286 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6034]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 126 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 135 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 18:37:45] [INFO ] Invariant cache hit.
[2023-03-14 18:37:48] [INFO ] Implicit Places using invariants in 2268 ms returned []
Implicit Place search using SMT only with invariants took 2269 ms to find 0 implicit places.
[2023-03-14 18:37:48] [INFO ] Invariant cache hit.
[2023-03-14 18:37:50] [INFO ] Dead Transitions using invariants and state equation in 2235 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4642 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 18:37:50] [INFO ] Invariant cache hit.
Finished random walk after 11317 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5175 ms. (steps per millisecond=1 )
[2023-03-14 18:38:25] [INFO ] Invariant cache hit.
[2023-03-14 18:39:10] [INFO ] [Real]Absence check using 20000 positive place invariants in 41440 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6035]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 124 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 149 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 18:39:11] [INFO ] Invariant cache hit.
[2023-03-14 18:39:13] [INFO ] Implicit Places using invariants in 2238 ms returned []
Implicit Place search using SMT only with invariants took 2239 ms to find 0 implicit places.
[2023-03-14 18:39:13] [INFO ] Invariant cache hit.
[2023-03-14 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 2222 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4612 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-14 18:39:15] [INFO ] Invariant cache hit.
Finished random walk after 11314 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5169 ms. (steps per millisecond=1 )
[2023-03-14 18:39:50] [INFO ] Invariant cache hit.
[2023-03-14 18:40:35] [INFO ] [Real]Absence check using 20000 positive place invariants in 41362 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6035]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 137 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 129 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-14 18:40:36] [INFO ] Invariant cache hit.
[2023-03-14 18:40:38] [INFO ] Implicit Places using invariants in 2203 ms returned []
Implicit Place search using SMT only with invariants took 2204 ms to find 0 implicit places.
[2023-03-14 18:40:38] [INFO ] Invariant cache hit.
[2023-03-14 18:40:40] [INFO ] Dead Transitions using invariants and state equation in 2210 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4554 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-07 in 403650 ms.
[2023-03-14 18:40:43] [INFO ] Flatten gal took : 1775 ms
[2023-03-14 18:40:44] [INFO ] Applying decomposition
[2023-03-14 18:40:45] [INFO ] Flatten gal took : 1374 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3833954036160187936.txt' '-o' '/tmp/graph3833954036160187936.bin' '-w' '/tmp/graph3833954036160187936.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3833954036160187936.bin' '-l' '-1' '-v' '-w' '/tmp/graph3833954036160187936.weights' '-q' '0' '-e' '0.001'
[2023-03-14 18:40:50] [INFO ] Decomposing Gal with order
[2023-03-14 18:41:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 18:52:47] [INFO ] Removed a total of 9905 redundant transitions.
[2023-03-14 18:52:48] [INFO ] Flatten gal took : 2369 ms
[2023-03-14 19:01:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 32772 labels/synchronizations in 821 ms.
[2023-03-14 19:01:38] [INFO ] Time to serialize gal into /tmp/UpperBounds10729782201911313568.gal : 401 ms
[2023-03-14 19:01:38] [INFO ] Time to serialize properties into /tmp/UpperBounds15310172648308247428.prop : 50 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10729782201911313568.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15310172648308247428.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds15310172648308247428.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8095808 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15728416 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-010000, 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 r293-tall-167873945200269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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