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.r069-tall-171620503700038.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 CANConstruction-PT-040, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503700038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 12 18:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.5M 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 CANConstruction-PT-040-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-11
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716366210198

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:23:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 08:23:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:23:31] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2024-05-22 08:23:31] [INFO ] Transformed 3682 places.
[2024-05-22 08:23:31] [INFO ] Transformed 6720 transitions.
[2024-05-22 08:23:31] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 366 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (54 resets) in 2357 ms. (16 steps per ms) remains 5/16 properties
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 398 ms. (100 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 499 ms. (80 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 757 ms. (52 steps per ms) remains 5/5 properties
// Phase 1: matrix 6720 rows 3682 cols
[2024-05-22 08:23:33] [INFO ] Computed 81 invariants in 86 ms
[2024-05-22 08:23:33] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem CANConstruction-PT-040-ReachabilityCardinality-2024-03 is UNSAT
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-040-ReachabilityCardinality-2024-10 is UNSAT
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-040-ReachabilityCardinality-2024-15 is UNSAT
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 3493/3643 variables, 41/41 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3643 variables, 2/43 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3643 variables, 0/43 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/3681 variables, 38/81 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3681 variables, 0/81 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6720/10401 variables, 3681/3762 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10401 variables, 3160/6922 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10401 variables, 0/6922 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/10402 variables, 1/6923 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/10402 variables, 0/6923 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/10402 variables, 0/6923 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10402/10402 variables, and 6923 constraints, problems are : Problem set: 3 solved, 2 unsolved in 4572 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 3682/3682 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3546/3640 variables, 39/39 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3640 variables, 1/40 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-22 08:23:42] [INFO ] Deduced a trap composed of 5 places in 3375 ms of which 161 ms to minimize.
[2024-05-22 08:23:45] [INFO ] Deduced a trap composed of 69 places in 2965 ms of which 19 ms to minimize.
SMT process timed out in 11912ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 94 out of 3682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 260 transitions
Trivial Post-agglo rules discarded 260 transitions
Performed 260 trivial Post agglomeration. Transition count delta: 260
Iterating post reduction 0 with 260 rules applied. Total rules applied 260 place count 3682 transition count 6460
Reduce places removed 260 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 265 rules applied. Total rules applied 525 place count 3422 transition count 6455
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 530 place count 3417 transition count 6455
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 530 place count 3417 transition count 6450
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 540 place count 3412 transition count 6450
Discarding 1468 places :
Symmetric choice reduction at 3 with 1468 rule applications. Total rules 2008 place count 1944 transition count 3514
Iterating global reduction 3 with 1468 rules applied. Total rules applied 3476 place count 1944 transition count 3514
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 6 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 3542 place count 1911 transition count 3481
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 3553 place count 1911 transition count 3470
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 3564 place count 1900 transition count 3470
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 3567 place count 1900 transition count 3467
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 3570 place count 1897 transition count 3467
Partial Free-agglomeration rule applied 73 times.
Drop transitions (Partial Free agglomeration) removed 73 transitions
Iterating global reduction 5 with 73 rules applied. Total rules applied 3643 place count 1897 transition count 3467
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 3648 place count 1897 transition count 3467
Applied a total of 3648 rules in 2034 ms. Remains 1897 /3682 variables (removed 1785) and now considering 3467/6720 (removed 3253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2046 ms. Remains : 1897/3682 places, 3467/6720 transitions.
RANDOM walk for 40000 steps (133 resets) in 1195 ms. (33 steps per ms) remains 1/2 properties
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
// Phase 1: matrix 3467 rows 1897 cols
[2024-05-22 08:23:47] [INFO ] Computed 81 invariants in 36 ms
[2024-05-22 08:23:47] [INFO ] State equation strengthened by 3224 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1810/1833 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1833 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1833 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/1857 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1857 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 39/1896 variables, 39/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1896 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3467/5363 variables, 1896/1977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5363 variables, 3224/5201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5363 variables, 0/5201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/5364 variables, 1/5202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5364 variables, 0/5202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/5364 variables, 0/5202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5364/5364 variables, and 5202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1615 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 1897/1897 constraints, ReadFeed: 3224/3224 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1810/1833 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1833 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:23:50] [INFO ] Deduced a trap composed of 2 places in 981 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1833 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1833 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/1857 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:23:52] [INFO ] Deduced a trap composed of 44 places in 1400 ms of which 12 ms to minimize.
[2024-05-22 08:23:53] [INFO ] Deduced a trap composed of 44 places in 1446 ms of which 12 ms to minimize.
[2024-05-22 08:23:55] [INFO ] Deduced a trap composed of 44 places in 1462 ms of which 13 ms to minimize.
[2024-05-22 08:23:56] [INFO ] Deduced a trap composed of 46 places in 1439 ms of which 12 ms to minimize.
[2024-05-22 08:23:58] [INFO ] Deduced a trap composed of 43 places in 1373 ms of which 12 ms to minimize.
[2024-05-22 08:23:59] [INFO ] Deduced a trap composed of 43 places in 1350 ms of which 12 ms to minimize.
[2024-05-22 08:24:00] [INFO ] Deduced a trap composed of 45 places in 1305 ms of which 11 ms to minimize.
[2024-05-22 08:24:02] [INFO ] Deduced a trap composed of 44 places in 1430 ms of which 12 ms to minimize.
[2024-05-22 08:24:03] [INFO ] Deduced a trap composed of 44 places in 1400 ms of which 12 ms to minimize.
[2024-05-22 08:24:05] [INFO ] Deduced a trap composed of 44 places in 1426 ms of which 12 ms to minimize.
[2024-05-22 08:24:06] [INFO ] Deduced a trap composed of 46 places in 1336 ms of which 12 ms to minimize.
[2024-05-22 08:24:08] [INFO ] Deduced a trap composed of 43 places in 1370 ms of which 12 ms to minimize.
[2024-05-22 08:24:09] [INFO ] Deduced a trap composed of 43 places in 1361 ms of which 12 ms to minimize.
[2024-05-22 08:24:10] [INFO ] Deduced a trap composed of 43 places in 1424 ms of which 13 ms to minimize.
[2024-05-22 08:24:12] [INFO ] Deduced a trap composed of 43 places in 1401 ms of which 12 ms to minimize.
[2024-05-22 08:24:13] [INFO ] Deduced a trap composed of 49 places in 1419 ms of which 13 ms to minimize.
[2024-05-22 08:24:15] [INFO ] Deduced a trap composed of 43 places in 1443 ms of which 13 ms to minimize.
[2024-05-22 08:24:16] [INFO ] Deduced a trap composed of 44 places in 1438 ms of which 13 ms to minimize.
[2024-05-22 08:24:18] [INFO ] Deduced a trap composed of 44 places in 1380 ms of which 12 ms to minimize.
[2024-05-22 08:24:19] [INFO ] Deduced a trap composed of 46 places in 1417 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1857 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:24:21] [INFO ] Deduced a trap composed of 44 places in 1366 ms of which 11 ms to minimize.
[2024-05-22 08:24:22] [INFO ] Deduced a trap composed of 43 places in 1321 ms of which 12 ms to minimize.
[2024-05-22 08:24:23] [INFO ] Deduced a trap composed of 44 places in 1329 ms of which 13 ms to minimize.
[2024-05-22 08:24:25] [INFO ] Deduced a trap composed of 48 places in 1405 ms of which 11 ms to minimize.
[2024-05-22 08:24:26] [INFO ] Deduced a trap composed of 45 places in 1333 ms of which 11 ms to minimize.
[2024-05-22 08:24:27] [INFO ] Deduced a trap composed of 48 places in 1350 ms of which 11 ms to minimize.
[2024-05-22 08:24:29] [INFO ] Deduced a trap composed of 47 places in 1338 ms of which 12 ms to minimize.
[2024-05-22 08:24:30] [INFO ] Deduced a trap composed of 43 places in 1402 ms of which 12 ms to minimize.
[2024-05-22 08:24:32] [INFO ] Deduced a trap composed of 52 places in 1396 ms of which 12 ms to minimize.
[2024-05-22 08:24:33] [INFO ] Deduced a trap composed of 47 places in 1390 ms of which 12 ms to minimize.
[2024-05-22 08:24:34] [INFO ] Deduced a trap composed of 50 places in 1329 ms of which 17 ms to minimize.
SMT process timed out in 47216ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 1897 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 3467/3467 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1897 transition count 3465
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1895 transition count 3465
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 18 place count 1881 transition count 3437
Iterating global reduction 2 with 14 rules applied. Total rules applied 32 place count 1881 transition count 3437
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 82 place count 1856 transition count 3412
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 102 place count 1846 transition count 3416
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 1846 transition count 3414
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 1844 transition count 3414
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 1843 transition count 3412
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 1843 transition count 3412
Applied a total of 108 rules in 681 ms. Remains 1843 /1897 variables (removed 54) and now considering 3412/3467 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 681 ms. Remains : 1843/1897 places, 3412/3467 transitions.
RANDOM walk for 40000 steps (142 resets) in 738 ms. (54 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 153832 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 1
Probabilistic random walk after 153832 steps, saw 78159 distinct states, run finished after 3005 ms. (steps per millisecond=51 ) properties seen :0
// Phase 1: matrix 3412 rows 1843 cols
[2024-05-22 08:24:38] [INFO ] Computed 81 invariants in 23 ms
[2024-05-22 08:24:39] [INFO ] State equation strengthened by 3270 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1756/1779 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1779 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1779 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/1803 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1803 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 39/1842 variables, 39/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1842 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3412/5254 variables, 1842/1923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5254 variables, 3270/5193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5254 variables, 0/5193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/5255 variables, 1/5194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5255 variables, 0/5194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/5255 variables, 0/5194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5255/5255 variables, and 5194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1375 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 1843/1843 constraints, ReadFeed: 3270/3270 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1756/1779 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1779 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:24:41] [INFO ] Deduced a trap composed of 2 places in 893 ms of which 11 ms to minimize.
[2024-05-22 08:24:42] [INFO ] Deduced a trap composed of 2 places in 864 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1779 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1779 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/1803 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:24:43] [INFO ] Deduced a trap composed of 45 places in 1290 ms of which 12 ms to minimize.
[2024-05-22 08:24:45] [INFO ] Deduced a trap composed of 43 places in 1315 ms of which 12 ms to minimize.
[2024-05-22 08:24:46] [INFO ] Deduced a trap composed of 43 places in 1323 ms of which 12 ms to minimize.
[2024-05-22 08:24:47] [INFO ] Deduced a trap composed of 43 places in 1292 ms of which 14 ms to minimize.
[2024-05-22 08:24:49] [INFO ] Deduced a trap composed of 49 places in 1259 ms of which 11 ms to minimize.
[2024-05-22 08:24:50] [INFO ] Deduced a trap composed of 43 places in 1145 ms of which 12 ms to minimize.
[2024-05-22 08:24:51] [INFO ] Deduced a trap composed of 45 places in 1309 ms of which 11 ms to minimize.
[2024-05-22 08:24:52] [INFO ] Deduced a trap composed of 43 places in 1167 ms of which 11 ms to minimize.
[2024-05-22 08:24:54] [INFO ] Deduced a trap composed of 48 places in 1335 ms of which 12 ms to minimize.
[2024-05-22 08:24:55] [INFO ] Deduced a trap composed of 43 places in 1294 ms of which 11 ms to minimize.
[2024-05-22 08:24:56] [INFO ] Deduced a trap composed of 43 places in 1279 ms of which 12 ms to minimize.
[2024-05-22 08:24:58] [INFO ] Deduced a trap composed of 43 places in 1206 ms of which 12 ms to minimize.
[2024-05-22 08:24:59] [INFO ] Deduced a trap composed of 43 places in 1223 ms of which 11 ms to minimize.
[2024-05-22 08:25:00] [INFO ] Deduced a trap composed of 48 places in 1259 ms of which 11 ms to minimize.
[2024-05-22 08:25:01] [INFO ] Deduced a trap composed of 43 places in 1193 ms of which 11 ms to minimize.
[2024-05-22 08:25:03] [INFO ] Deduced a trap composed of 50 places in 1249 ms of which 11 ms to minimize.
[2024-05-22 08:25:04] [INFO ] Deduced a trap composed of 44 places in 1297 ms of which 12 ms to minimize.
[2024-05-22 08:25:05] [INFO ] Deduced a trap composed of 43 places in 1239 ms of which 11 ms to minimize.
[2024-05-22 08:25:06] [INFO ] Deduced a trap composed of 50 places in 1208 ms of which 12 ms to minimize.
[2024-05-22 08:25:08] [INFO ] Deduced a trap composed of 46 places in 1284 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1803 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:25:09] [INFO ] Deduced a trap composed of 46 places in 1233 ms of which 12 ms to minimize.
[2024-05-22 08:25:10] [INFO ] Deduced a trap composed of 43 places in 1253 ms of which 12 ms to minimize.
[2024-05-22 08:25:12] [INFO ] Deduced a trap composed of 43 places in 1275 ms of which 12 ms to minimize.
[2024-05-22 08:25:13] [INFO ] Deduced a trap composed of 43 places in 1241 ms of which 11 ms to minimize.
[2024-05-22 08:25:14] [INFO ] Deduced a trap composed of 48 places in 1161 ms of which 10 ms to minimize.
[2024-05-22 08:25:15] [INFO ] Deduced a trap composed of 43 places in 1227 ms of which 11 ms to minimize.
[2024-05-22 08:25:17] [INFO ] Deduced a trap composed of 46 places in 1245 ms of which 12 ms to minimize.
[2024-05-22 08:25:18] [INFO ] Deduced a trap composed of 43 places in 1222 ms of which 11 ms to minimize.
[2024-05-22 08:25:19] [INFO ] Deduced a trap composed of 53 places in 1149 ms of which 10 ms to minimize.
[2024-05-22 08:25:20] [INFO ] Deduced a trap composed of 43 places in 1229 ms of which 12 ms to minimize.
[2024-05-22 08:25:22] [INFO ] Deduced a trap composed of 45 places in 1278 ms of which 12 ms to minimize.
[2024-05-22 08:25:23] [INFO ] Deduced a trap composed of 43 places in 1244 ms of which 11 ms to minimize.
[2024-05-22 08:25:24] [INFO ] Deduced a trap composed of 43 places in 1242 ms of which 12 ms to minimize.
[2024-05-22 08:25:25] [INFO ] Deduced a trap composed of 50 places in 1238 ms of which 11 ms to minimize.
[2024-05-22 08:25:27] [INFO ] Deduced a trap composed of 45 places in 1170 ms of which 11 ms to minimize.
[2024-05-22 08:25:28] [INFO ] Deduced a trap composed of 49 places in 1166 ms of which 11 ms to minimize.
[2024-05-22 08:25:29] [INFO ] Deduced a trap composed of 45 places in 1142 ms of which 10 ms to minimize.
[2024-05-22 08:25:30] [INFO ] Deduced a trap composed of 43 places in 1134 ms of which 11 ms to minimize.
[2024-05-22 08:25:31] [INFO ] Deduced a trap composed of 43 places in 1223 ms of which 11 ms to minimize.
[2024-05-22 08:25:33] [INFO ] Deduced a trap composed of 43 places in 1221 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1803 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:25:34] [INFO ] Deduced a trap composed of 43 places in 1161 ms of which 11 ms to minimize.
[2024-05-22 08:25:35] [INFO ] Deduced a trap composed of 43 places in 1212 ms of which 11 ms to minimize.
[2024-05-22 08:25:36] [INFO ] Deduced a trap composed of 49 places in 1174 ms of which 11 ms to minimize.
[2024-05-22 08:25:38] [INFO ] Deduced a trap composed of 44 places in 1208 ms of which 11 ms to minimize.
[2024-05-22 08:25:39] [INFO ] Deduced a trap composed of 53 places in 1141 ms of which 11 ms to minimize.
[2024-05-22 08:25:40] [INFO ] Deduced a trap composed of 43 places in 1129 ms of which 11 ms to minimize.
[2024-05-22 08:25:41] [INFO ] Deduced a trap composed of 49 places in 1119 ms of which 10 ms to minimize.
[2024-05-22 08:25:42] [INFO ] Deduced a trap composed of 43 places in 1164 ms of which 11 ms to minimize.
[2024-05-22 08:25:43] [INFO ] Deduced a trap composed of 47 places in 1190 ms of which 12 ms to minimize.
[2024-05-22 08:25:45] [INFO ] Deduced a trap composed of 43 places in 1098 ms of which 10 ms to minimize.
[2024-05-22 08:25:46] [INFO ] Deduced a trap composed of 47 places in 1229 ms of which 11 ms to minimize.
[2024-05-22 08:25:47] [INFO ] Deduced a trap composed of 45 places in 1210 ms of which 12 ms to minimize.
[2024-05-22 08:25:48] [INFO ] Deduced a trap composed of 51 places in 1125 ms of which 11 ms to minimize.
[2024-05-22 08:25:49] [INFO ] Deduced a trap composed of 50 places in 1141 ms of which 10 ms to minimize.
[2024-05-22 08:25:50] [INFO ] Deduced a trap composed of 46 places in 1067 ms of which 10 ms to minimize.
[2024-05-22 08:25:52] [INFO ] Deduced a trap composed of 45 places in 1174 ms of which 10 ms to minimize.
[2024-05-22 08:25:53] [INFO ] Deduced a trap composed of 45 places in 1242 ms of which 12 ms to minimize.
[2024-05-22 08:25:54] [INFO ] Deduced a trap composed of 49 places in 1129 ms of which 11 ms to minimize.
[2024-05-22 08:25:55] [INFO ] Deduced a trap composed of 48 places in 1182 ms of which 12 ms to minimize.
SMT process timed out in 76816ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 3412/3412 transitions.
Applied a total of 0 rules in 115 ms. Remains 1843 /1843 variables (removed 0) and now considering 3412/3412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 1843/1843 places, 3412/3412 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 3412/3412 transitions.
Applied a total of 0 rules in 99 ms. Remains 1843 /1843 variables (removed 0) and now considering 3412/3412 (removed 0) transitions.
[2024-05-22 08:25:55] [INFO ] Invariant cache hit.
[2024-05-22 08:25:57] [INFO ] Implicit Places using invariants in 1115 ms returned [5, 11, 17, 23, 27, 33, 37, 41, 47, 53, 59, 65, 71, 77, 83, 89, 95, 101, 107, 113, 119, 125, 131, 137, 143, 150, 154, 160, 166, 172, 176, 182, 188, 192, 205, 210, 216, 222, 230]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 1128 ms to find 39 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1804/1843 places, 3412/3412 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1804 transition count 3402
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1794 transition count 3402
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 1793 transition count 3401
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 1793 transition count 3401
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 128 place count 1740 transition count 3348
Applied a total of 128 rules in 474 ms. Remains 1740 /1804 variables (removed 64) and now considering 3348/3412 (removed 64) transitions.
// Phase 1: matrix 3348 rows 1740 cols
[2024-05-22 08:25:57] [INFO ] Computed 42 invariants in 35 ms
[2024-05-22 08:25:58] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2024-05-22 08:25:58] [INFO ] Invariant cache hit.
[2024-05-22 08:25:59] [INFO ] State equation strengthened by 3201 read => feed constraints.
[2024-05-22 08:26:19] [INFO ] Implicit Places using invariants and state equation in 20691 ms returned []
Implicit Place search using SMT with State Equation took 21693 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1740/1843 places, 3348/3412 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 23394 ms. Remains : 1740/1843 places, 3348/3412 transitions.
RANDOM walk for 40000 steps (143 resets) in 398 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 176856 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 176856 steps, saw 95817 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-22 08:26:22] [INFO ] Invariant cache hit.
[2024-05-22 08:26:22] [INFO ] State equation strengthened by 3201 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1692/1715 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1715 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1715 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/1739 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1739 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3348/5087 variables, 1739/1781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5087 variables, 3201/4982 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5087 variables, 0/4982 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/5088 variables, 1/4983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5088 variables, 0/4983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/5088 variables, 0/4983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5088/5088 variables, and 4983 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1740/1740 constraints, ReadFeed: 3201/3201 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1692/1715 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1715 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:26:24] [INFO ] Deduced a trap composed of 2 places in 873 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1715 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1715 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/1739 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:26:26] [INFO ] Deduced a trap composed of 43 places in 1235 ms of which 10 ms to minimize.
[2024-05-22 08:26:27] [INFO ] Deduced a trap composed of 43 places in 1280 ms of which 11 ms to minimize.
[2024-05-22 08:26:28] [INFO ] Deduced a trap composed of 43 places in 1283 ms of which 11 ms to minimize.
[2024-05-22 08:26:30] [INFO ] Deduced a trap composed of 43 places in 1223 ms of which 11 ms to minimize.
[2024-05-22 08:26:31] [INFO ] Deduced a trap composed of 43 places in 1231 ms of which 11 ms to minimize.
[2024-05-22 08:26:32] [INFO ] Deduced a trap composed of 43 places in 1246 ms of which 11 ms to minimize.
[2024-05-22 08:26:33] [INFO ] Deduced a trap composed of 42 places in 1255 ms of which 11 ms to minimize.
[2024-05-22 08:26:35] [INFO ] Deduced a trap composed of 43 places in 1290 ms of which 11 ms to minimize.
[2024-05-22 08:26:36] [INFO ] Deduced a trap composed of 48 places in 1313 ms of which 11 ms to minimize.
[2024-05-22 08:26:37] [INFO ] Deduced a trap composed of 47 places in 1327 ms of which 12 ms to minimize.
[2024-05-22 08:26:39] [INFO ] Deduced a trap composed of 49 places in 1235 ms of which 11 ms to minimize.
[2024-05-22 08:26:40] [INFO ] Deduced a trap composed of 43 places in 1275 ms of which 12 ms to minimize.
[2024-05-22 08:26:41] [INFO ] Deduced a trap composed of 43 places in 1247 ms of which 11 ms to minimize.
[2024-05-22 08:26:43] [INFO ] Deduced a trap composed of 45 places in 1261 ms of which 12 ms to minimize.
[2024-05-22 08:26:44] [INFO ] Deduced a trap composed of 44 places in 1250 ms of which 11 ms to minimize.
[2024-05-22 08:26:45] [INFO ] Deduced a trap composed of 47 places in 1258 ms of which 12 ms to minimize.
[2024-05-22 08:26:46] [INFO ] Deduced a trap composed of 46 places in 1228 ms of which 11 ms to minimize.
[2024-05-22 08:26:48] [INFO ] Deduced a trap composed of 43 places in 1287 ms of which 11 ms to minimize.
[2024-05-22 08:26:49] [INFO ] Deduced a trap composed of 43 places in 1242 ms of which 11 ms to minimize.
[2024-05-22 08:26:50] [INFO ] Deduced a trap composed of 46 places in 1303 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1739 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:26:52] [INFO ] Deduced a trap composed of 43 places in 1242 ms of which 12 ms to minimize.
[2024-05-22 08:26:53] [INFO ] Deduced a trap composed of 46 places in 1217 ms of which 11 ms to minimize.
[2024-05-22 08:26:54] [INFO ] Deduced a trap composed of 43 places in 1231 ms of which 12 ms to minimize.
[2024-05-22 08:26:55] [INFO ] Deduced a trap composed of 43 places in 1303 ms of which 12 ms to minimize.
[2024-05-22 08:26:57] [INFO ] Deduced a trap composed of 47 places in 1264 ms of which 11 ms to minimize.
[2024-05-22 08:26:58] [INFO ] Deduced a trap composed of 43 places in 1300 ms of which 11 ms to minimize.
[2024-05-22 08:26:59] [INFO ] Deduced a trap composed of 43 places in 1262 ms of which 10 ms to minimize.
[2024-05-22 08:27:01] [INFO ] Deduced a trap composed of 43 places in 1263 ms of which 11 ms to minimize.
[2024-05-22 08:27:02] [INFO ] Deduced a trap composed of 43 places in 1261 ms of which 11 ms to minimize.
[2024-05-22 08:27:03] [INFO ] Deduced a trap composed of 43 places in 1259 ms of which 25 ms to minimize.
[2024-05-22 08:27:04] [INFO ] Deduced a trap composed of 43 places in 1195 ms of which 11 ms to minimize.
[2024-05-22 08:27:06] [INFO ] Deduced a trap composed of 44 places in 1210 ms of which 11 ms to minimize.
[2024-05-22 08:27:07] [INFO ] Deduced a trap composed of 48 places in 1226 ms of which 11 ms to minimize.
[2024-05-22 08:27:08] [INFO ] Deduced a trap composed of 43 places in 1203 ms of which 11 ms to minimize.
[2024-05-22 08:27:09] [INFO ] Deduced a trap composed of 48 places in 1250 ms of which 11 ms to minimize.
[2024-05-22 08:27:11] [INFO ] Deduced a trap composed of 49 places in 1240 ms of which 11 ms to minimize.
[2024-05-22 08:27:12] [INFO ] Deduced a trap composed of 43 places in 1267 ms of which 11 ms to minimize.
[2024-05-22 08:27:13] [INFO ] Deduced a trap composed of 45 places in 1278 ms of which 11 ms to minimize.
[2024-05-22 08:27:15] [INFO ] Deduced a trap composed of 46 places in 1224 ms of which 11 ms to minimize.
[2024-05-22 08:27:16] [INFO ] Deduced a trap composed of 48 places in 1270 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1739 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:27:17] [INFO ] Deduced a trap composed of 46 places in 1269 ms of which 11 ms to minimize.
[2024-05-22 08:27:18] [INFO ] Deduced a trap composed of 43 places in 1264 ms of which 11 ms to minimize.
[2024-05-22 08:27:20] [INFO ] Deduced a trap composed of 43 places in 1249 ms of which 11 ms to minimize.
[2024-05-22 08:27:21] [INFO ] Deduced a trap composed of 48 places in 1276 ms of which 11 ms to minimize.
[2024-05-22 08:27:22] [INFO ] Deduced a trap composed of 47 places in 1260 ms of which 11 ms to minimize.
[2024-05-22 08:27:24] [INFO ] Deduced a trap composed of 43 places in 1201 ms of which 11 ms to minimize.
[2024-05-22 08:27:25] [INFO ] Deduced a trap composed of 45 places in 1282 ms of which 12 ms to minimize.
[2024-05-22 08:27:26] [INFO ] Deduced a trap composed of 43 places in 1278 ms of which 11 ms to minimize.
[2024-05-22 08:27:27] [INFO ] Deduced a trap composed of 43 places in 1296 ms of which 11 ms to minimize.
[2024-05-22 08:27:29] [INFO ] Deduced a trap composed of 43 places in 1161 ms of which 10 ms to minimize.
[2024-05-22 08:27:30] [INFO ] Deduced a trap composed of 43 places in 1194 ms of which 11 ms to minimize.
[2024-05-22 08:27:31] [INFO ] Deduced a trap composed of 45 places in 1246 ms of which 11 ms to minimize.
[2024-05-22 08:27:32] [INFO ] Deduced a trap composed of 44 places in 1154 ms of which 11 ms to minimize.
[2024-05-22 08:27:34] [INFO ] Deduced a trap composed of 44 places in 1211 ms of which 11 ms to minimize.
[2024-05-22 08:27:35] [INFO ] Deduced a trap composed of 45 places in 1167 ms of which 12 ms to minimize.
[2024-05-22 08:27:36] [INFO ] Deduced a trap composed of 43 places in 1140 ms of which 11 ms to minimize.
[2024-05-22 08:27:37] [INFO ] Deduced a trap composed of 43 places in 1128 ms of which 11 ms to minimize.
[2024-05-22 08:27:38] [INFO ] Deduced a trap composed of 45 places in 1130 ms of which 11 ms to minimize.
[2024-05-22 08:27:39] [INFO ] Deduced a trap composed of 44 places in 1138 ms of which 11 ms to minimize.
[2024-05-22 08:27:41] [INFO ] Deduced a trap composed of 43 places in 1133 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1739 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 08:27:42] [INFO ] Deduced a trap composed of 43 places in 1178 ms of which 11 ms to minimize.
[2024-05-22 08:27:43] [INFO ] Deduced a trap composed of 43 places in 1153 ms of which 11 ms to minimize.
[2024-05-22 08:27:44] [INFO ] Deduced a trap composed of 43 places in 1119 ms of which 11 ms to minimize.
[2024-05-22 08:27:45] [INFO ] Deduced a trap composed of 43 places in 1139 ms of which 10 ms to minimize.
[2024-05-22 08:27:46] [INFO ] Deduced a trap composed of 44 places in 1139 ms of which 11 ms to minimize.
[2024-05-22 08:27:48] [INFO ] Deduced a trap composed of 45 places in 1202 ms of which 11 ms to minimize.
[2024-05-22 08:27:49] [INFO ] Deduced a trap composed of 47 places in 1224 ms of which 11 ms to minimize.
[2024-05-22 08:27:50] [INFO ] Deduced a trap composed of 44 places in 1188 ms of which 10 ms to minimize.
[2024-05-22 08:27:51] [INFO ] Deduced a trap composed of 43 places in 1159 ms of which 11 ms to minimize.
[2024-05-22 08:27:53] [INFO ] Deduced a trap composed of 47 places in 1184 ms of which 10 ms to minimize.
[2024-05-22 08:27:54] [INFO ] Deduced a trap composed of 47 places in 1184 ms of which 11 ms to minimize.
SMT process timed out in 91893ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 1740 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1740/1740 places, 3348/3348 transitions.
Applied a total of 0 rules in 240 ms. Remains 1740 /1740 variables (removed 0) and now considering 3348/3348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 1740/1740 places, 3348/3348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1740/1740 places, 3348/3348 transitions.
Applied a total of 0 rules in 241 ms. Remains 1740 /1740 variables (removed 0) and now considering 3348/3348 (removed 0) transitions.
[2024-05-22 08:27:54] [INFO ] Invariant cache hit.
[2024-05-22 08:27:55] [INFO ] Implicit Places using invariants in 985 ms returned []
[2024-05-22 08:27:55] [INFO ] Invariant cache hit.
[2024-05-22 08:27:56] [INFO ] State equation strengthened by 3201 read => feed constraints.
[2024-05-22 08:28:17] [INFO ] Implicit Places using invariants and state equation in 21842 ms returned []
Implicit Place search using SMT with State Equation took 22829 ms to find 0 implicit places.
[2024-05-22 08:28:17] [INFO ] Redundant transitions in 176 ms returned []
Running 3308 sub problems to find dead transitions.
[2024-05-22 08:28:17] [INFO ] Invariant cache hit.
[2024-05-22 08:28:17] [INFO ] State equation strengthened by 3201 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1739 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3308 unsolved
SMT process timed out in 32437ms, After SMT, problems are : Problem set: 0 solved, 3308 unsolved
Search for dead transitions found 0 dead transitions in 32477ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55749 ms. Remains : 1740/1740 places, 3348/3348 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3169 edges and 1740 vertex of which 1501 / 1740 are part of one of the 37 SCC in 4 ms
Free SCC test removed 1464 places
Drop transitions (Empty/Sink Transition effects.) removed 2891 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 2931 transitions.
Graph (complete) has 553 edges and 276 vertex of which 186 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.0 ms
Discarding 90 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 169 rules applied. Total rules applied 171 place count 186 transition count 199
Ensure Unique test removed 1 places
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 1 with 225 rules applied. Total rules applied 396 place count 71 transition count 89
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 396 place count 71 transition count 83
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 408 place count 65 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 409 place count 64 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 410 place count 64 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 411 place count 64 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 413 place count 63 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 415 place count 63 transition count 78
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 418 place count 63 transition count 75
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 421 place count 60 transition count 75
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 432 place count 60 transition count 75
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 443 place count 49 transition count 64
Iterating global reduction 4 with 11 rules applied. Total rules applied 454 place count 49 transition count 64
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 458 place count 45 transition count 60
Applied a total of 458 rules in 38 ms. Remains 45 /1740 variables (removed 1695) and now considering 60/3348 (removed 3288) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 45 cols
[2024-05-22 08:28:50] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 08:28:50] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 08:28:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-22 08:28:50] [INFO ] [Nat]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 08:28:50] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 08:28:50] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 08:28:50] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 177 ms.
[2024-05-22 08:28:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-22 08:28:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1740 places, 3348 transitions and 13274 arcs took 18 ms.
[2024-05-22 08:28:50] [INFO ] Flatten gal took : 236 ms
Total runtime 319619 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANConstruction-PT-040

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1740
TRANSITIONS: 3348
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.057s, Sys 0.016s]


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


----------------------------------------------------------------------
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: 1159
MODEL NAME: /home/mcc/execution/412/model
1740 places, 3348 transitions.

Creating all event NSFs..
Creating all event NSFs..
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.

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="CANConstruction-PT-040"
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 CANConstruction-PT-040, 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 r069-tall-171620503700038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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