fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r003-smll-171620117500350
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Anderson-PT-08

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2723.191 135031.00 261656.00 398.00 TTTFTTFTTFTFFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r003-smll-171620117500350.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Anderson-PT-08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117500350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 667K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-00
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-01
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-02
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-03
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-04
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-05
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-06
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-07
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-08
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-09
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-10
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-11
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-12
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-13
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-14
FORMULA_NAME Anderson-PT-08-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716436978296

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 04:02:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 04:03:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 04:03:00] [INFO ] Load time of PNML (sax parser for PT used): 406 ms
[2024-05-23 04:03:00] [INFO ] Transformed 401 places.
[2024-05-23 04:03:00] [INFO ] Transformed 1328 transitions.
[2024-05-23 04:03:00] [INFO ] Found NUPN structural information;
[2024-05-23 04:03:00] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 592 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2789 ms. (14 steps per ms) remains 2/11 properties
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 449 ms. (88 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
// Phase 1: matrix 1328 rows 401 cols
[2024-05-23 04:03:01] [INFO ] Computed 19 invariants in 76 ms
[2024-05-23 04:03:01] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem Anderson-PT-08-ReachabilityCardinality-2024-11 is UNSAT
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 341/385 variables, 9/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 341/394 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/394 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/401 variables, 10/404 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 16/420 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/420 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1328/1729 variables, 401/821 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1729 variables, 56/877 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1729 variables, 0/877 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1729 variables, 0/877 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1729/1729 variables, and 877 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1277 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 401/401 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 360/384 variables, 9/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 360/393 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/393 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/401 variables, 10/403 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 17/420 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-23 04:03:04] [INFO ] Deduced a trap composed of 121 places in 491 ms of which 18 ms to minimize.
[2024-05-23 04:03:04] [INFO ] Deduced a trap composed of 111 places in 459 ms of which 35 ms to minimize.
[2024-05-23 04:03:05] [INFO ] Deduced a trap composed of 81 places in 373 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 3/423 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/423 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1328/1729 variables, 401/824 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1729 variables, 56/880 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1729 variables, 1/881 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 0/881 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1729 variables, 0/881 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1729/1729 variables, and 881 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2716 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 401/401 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 4233ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 24 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 48 Pre rules applied. Total rules applied 0 place count 401 transition count 1280
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 353 transition count 1280
Discarding 104 places :
Symmetric choice reduction at 0 with 104 rule applications. Total rules 200 place count 249 transition count 448
Iterating global reduction 0 with 104 rules applied. Total rules applied 304 place count 249 transition count 448
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 312 place count 245 transition count 444
Applied a total of 312 rules in 158 ms. Remains 245 /401 variables (removed 156) and now considering 444/1328 (removed 884) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 245/401 places, 444/1328 transitions.
RANDOM walk for 40000 steps (8 resets) in 423 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 989682 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :0 out of 1
Probabilistic random walk after 989682 steps, saw 636527 distinct states, run finished after 3006 ms. (steps per millisecond=329 ) properties seen :0
// Phase 1: matrix 444 rows 245 cols
[2024-05-23 04:03:09] [INFO ] Computed 19 invariants in 9 ms
[2024-05-23 04:03:09] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 212/236 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/245 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 444/689 variables, 245/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 56/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/689 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 320 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 245/245 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 212/236 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/245 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 444/689 variables, 245/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 56/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/689 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 808 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 245/245 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1166ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 24 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 444/444 transitions.
Applied a total of 0 rules in 25 ms. Remains 245 /245 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 245/245 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 444/444 transitions.
Applied a total of 0 rules in 35 ms. Remains 245 /245 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-05-23 04:03:10] [INFO ] Invariant cache hit.
[2024-05-23 04:03:11] [INFO ] Implicit Places using invariants in 398 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 410 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 244/245 places, 444/444 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 244 transition count 407
Reduce places removed 37 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 47 rules applied. Total rules applied 84 place count 207 transition count 397
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 94 place count 197 transition count 397
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 104 place count 197 transition count 387
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 114 place count 187 transition count 387
Applied a total of 114 rules in 36 ms. Remains 187 /244 variables (removed 57) and now considering 387/444 (removed 57) transitions.
// Phase 1: matrix 387 rows 187 cols
[2024-05-23 04:03:11] [INFO ] Computed 18 invariants in 7 ms
[2024-05-23 04:03:11] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-23 04:03:11] [INFO ] Invariant cache hit.
[2024-05-23 04:03:11] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 04:03:12] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 187/245 places, 387/444 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1691 ms. Remains : 187/245 places, 387/444 transitions.
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1005235 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :0 out of 1
Probabilistic random walk after 1005235 steps, saw 619395 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
[2024-05-23 04:03:15] [INFO ] Invariant cache hit.
[2024-05-23 04:03:15] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/187 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 387/574 variables, 187/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 56/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/574 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 187/187 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/187 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 387/574 variables, 187/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 56/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/574 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 187/187 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 784ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 24 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 387/387 transitions.
Applied a total of 0 rules in 11 ms. Remains 187 /187 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 187/187 places, 387/387 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 387/387 transitions.
Applied a total of 0 rules in 9 ms. Remains 187 /187 variables (removed 0) and now considering 387/387 (removed 0) transitions.
[2024-05-23 04:03:16] [INFO ] Invariant cache hit.
[2024-05-23 04:03:16] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-23 04:03:16] [INFO ] Invariant cache hit.
[2024-05-23 04:03:16] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 04:03:17] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
[2024-05-23 04:03:17] [INFO ] Redundant transitions in 26 ms returned []
Running 379 sub problems to find dead transitions.
[2024-05-23 04:03:17] [INFO ] Invariant cache hit.
[2024-05-23 04:03:17] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-23 04:03:20] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 3 ms to minimize.
[2024-05-23 04:03:20] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 2 ms to minimize.
[2024-05-23 04:03:21] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2024-05-23 04:03:21] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 2 ms to minimize.
[2024-05-23 04:03:21] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 3 ms to minimize.
[2024-05-23 04:03:21] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 2 ms to minimize.
[2024-05-23 04:03:21] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 3 ms to minimize.
[2024-05-23 04:03:21] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 2 ms to minimize.
[2024-05-23 04:03:21] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2024-05-23 04:03:22] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 2 ms to minimize.
[2024-05-23 04:03:22] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2024-05-23 04:03:22] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 2 ms to minimize.
[2024-05-23 04:03:22] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 3 ms to minimize.
[2024-05-23 04:03:22] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 2 ms to minimize.
[2024-05-23 04:03:22] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 2 ms to minimize.
[2024-05-23 04:03:22] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 2 ms to minimize.
[2024-05-23 04:03:23] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 2 ms to minimize.
[2024-05-23 04:03:23] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 2 ms to minimize.
[2024-05-23 04:03:23] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 3 ms to minimize.
[2024-05-23 04:03:23] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-23 04:03:24] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-05-23 04:03:24] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
[2024-05-23 04:03:24] [INFO ] Deduced a trap composed of 113 places in 144 ms of which 2 ms to minimize.
[2024-05-23 04:03:25] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 2 ms to minimize.
[2024-05-23 04:03:25] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 2 ms to minimize.
[2024-05-23 04:03:25] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 2 ms to minimize.
[2024-05-23 04:03:25] [INFO ] Deduced a trap composed of 63 places in 156 ms of which 3 ms to minimize.
[2024-05-23 04:03:25] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 2 ms to minimize.
[2024-05-23 04:03:25] [INFO ] Deduced a trap composed of 70 places in 142 ms of which 2 ms to minimize.
[2024-05-23 04:03:26] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 2 ms to minimize.
[2024-05-23 04:03:26] [INFO ] Deduced a trap composed of 58 places in 141 ms of which 3 ms to minimize.
[2024-05-23 04:03:26] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 4 ms to minimize.
[2024-05-23 04:03:26] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 3 ms to minimize.
[2024-05-23 04:03:26] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 2 ms to minimize.
[2024-05-23 04:03:26] [INFO ] Deduced a trap composed of 63 places in 139 ms of which 2 ms to minimize.
[2024-05-23 04:03:27] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 2 ms to minimize.
[2024-05-23 04:03:27] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 4 ms to minimize.
[2024-05-23 04:03:27] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 2 ms to minimize.
[2024-05-23 04:03:27] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 2 ms to minimize.
[2024-05-23 04:03:27] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-23 04:03:31] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2024-05-23 04:03:31] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 3 ms to minimize.
[2024-05-23 04:03:31] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 2 ms to minimize.
[2024-05-23 04:03:31] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 2 ms to minimize.
[2024-05-23 04:03:31] [INFO ] Deduced a trap composed of 63 places in 134 ms of which 2 ms to minimize.
[2024-05-23 04:03:31] [INFO ] Deduced a trap composed of 60 places in 135 ms of which 2 ms to minimize.
[2024-05-23 04:03:32] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 2 ms to minimize.
[2024-05-23 04:03:32] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 4 ms to minimize.
[2024-05-23 04:03:32] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 2 ms to minimize.
[2024-05-23 04:03:32] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 3 ms to minimize.
[2024-05-23 04:03:32] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 2 ms to minimize.
[2024-05-23 04:03:32] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 2 ms to minimize.
[2024-05-23 04:03:33] [INFO ] Deduced a trap composed of 69 places in 150 ms of which 2 ms to minimize.
[2024-05-23 04:03:33] [INFO ] Deduced a trap composed of 70 places in 141 ms of which 3 ms to minimize.
[2024-05-23 04:03:33] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 2 ms to minimize.
[2024-05-23 04:03:33] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 3 ms to minimize.
[2024-05-23 04:03:33] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 2 ms to minimize.
[2024-05-23 04:03:33] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 2 ms to minimize.
[2024-05-23 04:03:34] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 2 ms to minimize.
[2024-05-23 04:03:34] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-23 04:03:35] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 3 ms to minimize.
[2024-05-23 04:03:35] [INFO ] Deduced a trap composed of 68 places in 137 ms of which 2 ms to minimize.
[2024-05-23 04:03:35] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 2 ms to minimize.
[2024-05-23 04:03:36] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 2 ms to minimize.
[2024-05-23 04:03:36] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 3 ms to minimize.
[2024-05-23 04:03:36] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 3 ms to minimize.
[2024-05-23 04:03:37] [INFO ] Deduced a trap composed of 58 places in 147 ms of which 2 ms to minimize.
[2024-05-23 04:03:37] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 2 ms to minimize.
[2024-05-23 04:03:37] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 2 ms to minimize.
[2024-05-23 04:03:37] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 3 ms to minimize.
[2024-05-23 04:03:37] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 3 ms to minimize.
[2024-05-23 04:03:37] [INFO ] Deduced a trap composed of 75 places in 145 ms of which 2 ms to minimize.
[2024-05-23 04:03:37] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 2 ms to minimize.
[2024-05-23 04:03:38] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 2 ms to minimize.
[2024-05-23 04:03:38] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 3 ms to minimize.
[2024-05-23 04:03:38] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 3 ms to minimize.
[2024-05-23 04:03:38] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 2 ms to minimize.
[2024-05-23 04:03:38] [INFO ] Deduced a trap composed of 64 places in 151 ms of which 2 ms to minimize.
[2024-05-23 04:03:38] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 2 ms to minimize.
[2024-05-23 04:03:39] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-23 04:03:40] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 2 ms to minimize.
[2024-05-23 04:03:41] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 3 ms to minimize.
[2024-05-23 04:03:41] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 2 ms to minimize.
[2024-05-23 04:03:41] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 2 ms to minimize.
[2024-05-23 04:03:41] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 2 ms to minimize.
[2024-05-23 04:03:41] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-05-23 04:03:42] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2024-05-23 04:03:42] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 2 ms to minimize.
[2024-05-23 04:03:43] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 2 ms to minimize.
[2024-05-23 04:03:43] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 2 ms to minimize.
[2024-05-23 04:03:43] [INFO ] Deduced a trap composed of 63 places in 144 ms of which 2 ms to minimize.
[2024-05-23 04:03:43] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 2 ms to minimize.
[2024-05-23 04:03:43] [INFO ] Deduced a trap composed of 64 places in 143 ms of which 3 ms to minimize.
[2024-05-23 04:03:43] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 3 ms to minimize.
[2024-05-23 04:03:44] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 2 ms to minimize.
[2024-05-23 04:03:44] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 2 ms to minimize.
[2024-05-23 04:03:44] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 3 ms to minimize.
[2024-05-23 04:03:44] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 3 ms to minimize.
[2024-05-23 04:03:45] [INFO ] Deduced a trap composed of 69 places in 139 ms of which 2 ms to minimize.
[2024-05-23 04:03:45] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 187/574 variables, and 118 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/187 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 100/118 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-23 04:03:52] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 2 ms to minimize.
[2024-05-23 04:03:52] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 2 ms to minimize.
[2024-05-23 04:03:52] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2024-05-23 04:03:52] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 2 ms to minimize.
[2024-05-23 04:03:52] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 3 ms to minimize.
[2024-05-23 04:03:53] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 2 ms to minimize.
[2024-05-23 04:03:53] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 2 ms to minimize.
[2024-05-23 04:03:53] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 3 ms to minimize.
[2024-05-23 04:03:53] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 2 ms to minimize.
[2024-05-23 04:03:53] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 2 ms to minimize.
[2024-05-23 04:03:53] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 3 ms to minimize.
[2024-05-23 04:03:54] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 2 ms to minimize.
[2024-05-23 04:03:54] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 2 ms to minimize.
[2024-05-23 04:03:54] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 3 ms to minimize.
[2024-05-23 04:03:54] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 3 ms to minimize.
[2024-05-23 04:03:54] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 2 ms to minimize.
[2024-05-23 04:03:54] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-05-23 04:03:55] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 2 ms to minimize.
[2024-05-23 04:03:55] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 2 ms to minimize.
[2024-05-23 04:03:55] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 187/574 variables, and 138 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/187 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 0/379 constraints, Known Traps: 120/120 constraints]
After SMT, in 60412ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 60422ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61663 ms. Remains : 187/187 places, 387/387 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 0 place count 187 transition count 332
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 110 place count 132 transition count 332
Applied a total of 110 rules in 13 ms. Remains 132 /187 variables (removed 55) and now considering 332/387 (removed 55) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 332 rows 132 cols
[2024-05-23 04:04:18] [INFO ] Computed 18 invariants in 4 ms
[2024-05-23 04:04:18] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:04:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 04:04:18] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2024-05-23 04:04:18] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:04:18] [INFO ] After 346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:04:18] [INFO ] After 496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 593 ms.
[2024-05-23 04:04:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-05-23 04:04:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 187 places, 387 transitions and 1518 arcs took 8 ms.
[2024-05-23 04:04:18] [INFO ] Flatten gal took : 105 ms
Total runtime 78983 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 187
TRANSITIONS: 387
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.013s, Sys 0.000s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.002s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 969
MODEL NAME: /home/mcc/execution/414/model
187 places, 387 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716437113327

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

+ 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="Anderson-PT-08"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is Anderson-PT-08, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r003-smll-171620117500350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-08.tgz
mv Anderson-PT-08 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;