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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 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.6M 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 CANInsertWithFailure-PT-020-ReachabilityCardinality-2023-00
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2023-01
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-02
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2023-04
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-06
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-07
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-08
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2023-11
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-12
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-13
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-14
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716389985154

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 14:59:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 14:59:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 14:59:46] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2024-05-22 14:59:46] [INFO ] Transformed 1044 places.
[2024-05-22 14:59:46] [INFO ] Transformed 2520 transitions.
[2024-05-22 14:59:46] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 308 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (88 resets) in 2662 ms. (15 steps per ms) remains 12/16 properties
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 454 ms. (87 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 775 ms. (51 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 11/12 properties
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
// Phase 1: matrix 2520 rows 1044 cols
[2024-05-22 14:59:48] [INFO ] Computed 23 invariants in 74 ms
[2024-05-22 14:59:48] [INFO ] State equation strengthened by 780 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-12 is UNSAT
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 704/1038 variables, 19/19 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1038 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/1040 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1040 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/1042 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1042 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2520/3562 variables, 1042/1064 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3562 variables, 780/1844 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3562 variables, 0/1844 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/3564 variables, 2/1846 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3564 variables, 1/1847 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3564/3564 variables, and 1847 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5164 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1044/1044 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 725/1038 variables, 19/19 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-22 14:59:54] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 22 ms to minimize.
[2024-05-22 14:59:54] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1038 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1038 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/1040 variables, 1/22 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1040 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/1042 variables, 2/24 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-22 14:59:56] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 4 ms to minimize.
[2024-05-22 14:59:56] [INFO ] Deduced a trap composed of 43 places in 299 ms of which 8 ms to minimize.
[2024-05-22 14:59:57] [INFO ] Deduced a trap composed of 40 places in 318 ms of which 5 ms to minimize.
[2024-05-22 14:59:57] [INFO ] Deduced a trap composed of 46 places in 309 ms of which 4 ms to minimize.
[2024-05-22 14:59:57] [INFO ] Deduced a trap composed of 44 places in 370 ms of which 5 ms to minimize.
[2024-05-22 14:59:58] [INFO ] Deduced a trap composed of 46 places in 409 ms of which 5 ms to minimize.
[2024-05-22 14:59:58] [INFO ] Deduced a trap composed of 47 places in 362 ms of which 5 ms to minimize.
[2024-05-22 14:59:59] [INFO ] Deduced a trap composed of 46 places in 338 ms of which 5 ms to minimize.
SMT process timed out in 10785ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 313 out of 1044 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Graph (complete) has 3501 edges and 1044 vertex of which 1043 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 1043 transition count 2484
Reduce places removed 36 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 1 with 67 rules applied. Total rules applied 104 place count 1007 transition count 2453
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 135 place count 976 transition count 2453
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 135 place count 976 transition count 2446
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 149 place count 969 transition count 2446
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 2 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 301 place count 893 transition count 2370
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 3 with 71 rules applied. Total rules applied 372 place count 893 transition count 2299
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 378 place count 893 transition count 2293
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 384 place count 887 transition count 2293
Partial Free-agglomeration rule applied 512 times.
Drop transitions (Partial Free agglomeration) removed 512 transitions
Iterating global reduction 4 with 512 rules applied. Total rules applied 896 place count 887 transition count 2293
Partial Free-agglomeration rule applied 129 times.
Drop transitions (Partial Free agglomeration) removed 129 transitions
Iterating global reduction 4 with 129 rules applied. Total rules applied 1025 place count 887 transition count 2293
Applied a total of 1025 rules in 689 ms. Remains 887 /1044 variables (removed 157) and now considering 2293/2520 (removed 227) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 708 ms. Remains : 887/1044 places, 2293/2520 transitions.
RANDOM walk for 40000 steps (131 resets) in 826 ms. (48 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 9/10 properties
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 177 ms. (224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 8/9 properties
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
// Phase 1: matrix 2293 rows 887 cols
[2024-05-22 15:00:00] [INFO ] Computed 22 invariants in 52 ms
[2024-05-22 15:00:00] [INFO ] State equation strengthened by 896 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 603/880 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/880 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/884 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/884 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/884 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1/885 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/885 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2293/3178 variables, 885/907 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3178 variables, 896/1803 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3178 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 2/3180 variables, 2/1805 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3180 variables, 0/1805 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/3180 variables, 0/1805 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3180/3180 variables, and 1805 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4824 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 887/887 constraints, ReadFeed: 896/896 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 603/880 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 15:00:05] [INFO ] Deduced a trap composed of 2 places in 139 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/880 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/880 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 4/884 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/884 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/885 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 15:00:07] [INFO ] Deduced a trap composed of 31 places in 303 ms of which 4 ms to minimize.
[2024-05-22 15:00:07] [INFO ] Deduced a trap composed of 34 places in 294 ms of which 4 ms to minimize.
[2024-05-22 15:00:08] [INFO ] Deduced a trap composed of 40 places in 296 ms of which 4 ms to minimize.
[2024-05-22 15:00:08] [INFO ] Deduced a trap composed of 48 places in 263 ms of which 4 ms to minimize.
[2024-05-22 15:00:08] [INFO ] Deduced a trap composed of 38 places in 297 ms of which 4 ms to minimize.
[2024-05-22 15:00:09] [INFO ] Deduced a trap composed of 28 places in 295 ms of which 4 ms to minimize.
[2024-05-22 15:00:09] [INFO ] Deduced a trap composed of 37 places in 345 ms of which 5 ms to minimize.
[2024-05-22 15:00:09] [INFO ] Deduced a trap composed of 39 places in 358 ms of which 5 ms to minimize.
[2024-05-22 15:00:10] [INFO ] Deduced a trap composed of 37 places in 362 ms of which 5 ms to minimize.
[2024-05-22 15:00:10] [INFO ] Deduced a trap composed of 35 places in 387 ms of which 5 ms to minimize.
[2024-05-22 15:00:11] [INFO ] Deduced a trap composed of 41 places in 363 ms of which 12 ms to minimize.
[2024-05-22 15:00:11] [INFO ] Deduced a trap composed of 34 places in 356 ms of which 5 ms to minimize.
[2024-05-22 15:00:11] [INFO ] Deduced a trap composed of 41 places in 369 ms of which 5 ms to minimize.
[2024-05-22 15:00:12] [INFO ] Deduced a trap composed of 34 places in 303 ms of which 4 ms to minimize.
[2024-05-22 15:00:12] [INFO ] Deduced a trap composed of 36 places in 364 ms of which 5 ms to minimize.
[2024-05-22 15:00:12] [INFO ] Deduced a trap composed of 35 places in 376 ms of which 6 ms to minimize.
[2024-05-22 15:00:13] [INFO ] Deduced a trap composed of 35 places in 446 ms of which 6 ms to minimize.
[2024-05-22 15:00:13] [INFO ] Deduced a trap composed of 42 places in 356 ms of which 5 ms to minimize.
[2024-05-22 15:00:14] [INFO ] Deduced a trap composed of 29 places in 468 ms of which 22 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/885 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 15:00:15] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 4 ms to minimize.
[2024-05-22 15:00:15] [INFO ] Deduced a trap composed of 38 places in 317 ms of which 4 ms to minimize.
[2024-05-22 15:00:15] [INFO ] Deduced a trap composed of 37 places in 249 ms of which 4 ms to minimize.
[2024-05-22 15:00:15] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-22 15:00:16] [INFO ] Deduced a trap composed of 41 places in 277 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/885 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 15:00:17] [INFO ] Deduced a trap composed of 34 places in 315 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/885 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/885 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 2293/3178 variables, 885/933 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-15 is UNSAT
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (INCLUDED_ONLY) 0/3178 variables, 896/1829 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3178 variables, 7/1836 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3178 variables, 0/1836 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 2/3180 variables, 2/1838 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3180 variables, 0/1838 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3180/3180 variables, and 1838 constraints, problems are : Problem set: 1 solved, 7 unsolved in 45033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 887/887 constraints, ReadFeed: 896/896 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 26/26 constraints]
After SMT, in 50159ms problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 248 out of 887 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 887/887 places, 2293/2293 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 887 transition count 2284
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 13 rules applied. Total rules applied 22 place count 878 transition count 2280
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 874 transition count 2280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 26 place count 874 transition count 2279
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 873 transition count 2279
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 66 place count 854 transition count 2260
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 854 transition count 2256
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 854 transition count 2252
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 78 place count 850 transition count 2252
Partial Free-agglomeration rule applied 86 times.
Drop transitions (Partial Free agglomeration) removed 86 transitions
Iterating global reduction 4 with 86 rules applied. Total rules applied 164 place count 850 transition count 2252
Applied a total of 164 rules in 311 ms. Remains 850 /887 variables (removed 37) and now considering 2252/2293 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 850/887 places, 2252/2293 transitions.
RANDOM walk for 40000 steps (150 resets) in 621 ms. (64 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 208085 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 7
Probabilistic random walk after 208085 steps, saw 49430 distinct states, run finished after 3005 ms. (steps per millisecond=69 ) properties seen :0
// Phase 1: matrix 2252 rows 850 cols
[2024-05-22 15:00:54] [INFO ] Computed 22 invariants in 33 ms
[2024-05-22 15:00:54] [INFO ] State equation strengthened by 1025 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 595/843 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/843 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/847 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/848 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/848 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2252/3100 variables, 848/870 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3100 variables, 1025/1895 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3100 variables, 0/1895 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2/3102 variables, 2/1897 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3102 variables, 0/1897 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/3102 variables, 0/1897 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3102/3102 variables, and 1897 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4245 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 850/850 constraints, ReadFeed: 1025/1025 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 595/843 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 15:00:59] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/843 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/843 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 4/847 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/847 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/848 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 15:01:00] [INFO ] Deduced a trap composed of 30 places in 300 ms of which 4 ms to minimize.
[2024-05-22 15:01:00] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 4 ms to minimize.
[2024-05-22 15:01:00] [INFO ] Deduced a trap composed of 33 places in 310 ms of which 4 ms to minimize.
[2024-05-22 15:01:01] [INFO ] Deduced a trap composed of 31 places in 315 ms of which 4 ms to minimize.
[2024-05-22 15:01:01] [INFO ] Deduced a trap composed of 34 places in 298 ms of which 4 ms to minimize.
[2024-05-22 15:01:01] [INFO ] Deduced a trap composed of 30 places in 305 ms of which 5 ms to minimize.
[2024-05-22 15:01:02] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 4 ms to minimize.
[2024-05-22 15:01:02] [INFO ] Deduced a trap composed of 36 places in 244 ms of which 3 ms to minimize.
[2024-05-22 15:01:02] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 4 ms to minimize.
[2024-05-22 15:01:02] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 3 ms to minimize.
[2024-05-22 15:01:03] [INFO ] Deduced a trap composed of 27 places in 263 ms of which 3 ms to minimize.
[2024-05-22 15:01:03] [INFO ] Deduced a trap composed of 26 places in 299 ms of which 4 ms to minimize.
[2024-05-22 15:01:03] [INFO ] Deduced a trap composed of 32 places in 269 ms of which 4 ms to minimize.
[2024-05-22 15:01:04] [INFO ] Deduced a trap composed of 28 places in 257 ms of which 3 ms to minimize.
[2024-05-22 15:01:04] [INFO ] Deduced a trap composed of 41 places in 284 ms of which 4 ms to minimize.
[2024-05-22 15:01:04] [INFO ] Deduced a trap composed of 27 places in 313 ms of which 4 ms to minimize.
[2024-05-22 15:01:05] [INFO ] Deduced a trap composed of 36 places in 297 ms of which 4 ms to minimize.
[2024-05-22 15:01:05] [INFO ] Deduced a trap composed of 28 places in 322 ms of which 4 ms to minimize.
[2024-05-22 15:01:05] [INFO ] Deduced a trap composed of 33 places in 297 ms of which 4 ms to minimize.
[2024-05-22 15:01:06] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 15:01:06] [INFO ] Deduced a trap composed of 38 places in 278 ms of which 4 ms to minimize.
[2024-05-22 15:01:07] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 15:01:07] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/848 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/848 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 2252/3100 variables, 848/894 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3100 variables, 1025/1919 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3100 variables, 7/1926 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3100 variables, 0/1926 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 2/3102 variables, 2/1928 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3102 variables, 0/1928 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3102/3102 variables, and 1928 constraints, problems are : Problem set: 0 solved, 7 unsolved in 75016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 850/850 constraints, ReadFeed: 1025/1025 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 24/24 constraints]
After SMT, in 79401ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 248 out of 850 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 850/850 places, 2252/2252 transitions.
Applied a total of 0 rules in 45 ms. Remains 850 /850 variables (removed 0) and now considering 2252/2252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 850/850 places, 2252/2252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 850/850 places, 2252/2252 transitions.
Applied a total of 0 rules in 40 ms. Remains 850 /850 variables (removed 0) and now considering 2252/2252 (removed 0) transitions.
[2024-05-22 15:02:13] [INFO ] Invariant cache hit.
[2024-05-22 15:02:14] [INFO ] Implicit Places using invariants in 730 ms returned []
[2024-05-22 15:02:14] [INFO ] Invariant cache hit.
[2024-05-22 15:02:15] [INFO ] State equation strengthened by 1025 read => feed constraints.
[2024-05-22 15:02:17] [INFO ] Implicit Places using invariants and state equation in 2799 ms returned []
Implicit Place search using SMT with State Equation took 3580 ms to find 0 implicit places.
[2024-05-22 15:02:17] [INFO ] Redundant transitions in 112 ms returned []
Running 2232 sub problems to find dead transitions.
[2024-05-22 15:02:17] [INFO ] Invariant cache hit.
[2024-05-22 15:02:17] [INFO ] State equation strengthened by 1025 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/849 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/849 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-22 15:02:48] [INFO ] Deduced a trap composed of 51 places in 295 ms of which 4 ms to minimize.
[2024-05-22 15:02:48] [INFO ] Deduced a trap composed of 48 places in 290 ms of which 4 ms to minimize.
[2024-05-22 15:02:49] [INFO ] Deduced a trap composed of 37 places in 248 ms of which 3 ms to minimize.
[2024-05-22 15:02:49] [INFO ] Deduced a trap composed of 39 places in 344 ms of which 4 ms to minimize.
SMT process timed out in 31721ms, After SMT, problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 31746ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35511 ms. Remains : 850/850 places, 2252/2252 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 595 edges and 850 vertex of which 73 / 850 are part of one of the 1 SCC in 15 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 185 transitions.
Graph (complete) has 2356 edges and 778 vertex of which 755 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 755 transition count 1971
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 122 place count 729 transition count 1907
Iterating global reduction 1 with 26 rules applied. Total rules applied 148 place count 729 transition count 1907
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 151 place count 729 transition count 1904
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 165 place count 715 transition count 1876
Iterating global reduction 2 with 14 rules applied. Total rules applied 179 place count 715 transition count 1876
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 193 place count 715 transition count 1862
Drop transitions (Redundant composition of simpler transitions.) removed 147 transitions
Redundant transition composition rules discarded 147 transitions
Iterating global reduction 3 with 147 rules applied. Total rules applied 340 place count 715 transition count 1715
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 3 with 38 rules applied. Total rules applied 378 place count 715 transition count 1677
Reduce places removed 38 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 4 with 67 rules applied. Total rules applied 445 place count 677 transition count 1648
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 474 place count 648 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 475 place count 647 transition count 1645
Iterating global reduction 6 with 1 rules applied. Total rules applied 476 place count 647 transition count 1645
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 477 place count 647 transition count 1644
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 478 place count 647 transition count 1643
Free-agglomeration rule applied 188 times with reduction of 19 identical transitions.
Iterating global reduction 7 with 188 rules applied. Total rules applied 666 place count 647 transition count 1436
Reduce places removed 188 places and 0 transitions.
Ensure Unique test removed 184 transitions
Reduce isomorphic transitions removed 184 transitions.
Iterating post reduction 7 with 372 rules applied. Total rules applied 1038 place count 459 transition count 1252
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 1066 place count 459 transition count 1224
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1067 place count 459 transition count 1224
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1069 place count 458 transition count 1223
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1070 place count 458 transition count 1222
Partial Free-agglomeration rule applied 45 times.
Drop transitions (Partial Free agglomeration) removed 45 transitions
Iterating global reduction 9 with 45 rules applied. Total rules applied 1115 place count 458 transition count 1222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1116 place count 458 transition count 1221
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1118 place count 456 transition count 1219
Iterating global reduction 10 with 2 rules applied. Total rules applied 1120 place count 456 transition count 1219
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 1125 place count 456 transition count 1219
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1127 place count 456 transition count 1217
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 1130 place count 453 transition count 1214
Applied a total of 1130 rules in 695 ms. Remains 453 /850 variables (removed 397) and now considering 1214/2252 (removed 1038) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 1214 rows 453 cols
[2024-05-22 15:02:50] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 15:02:50] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 15:02:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-22 15:02:51] [INFO ] After 951ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-05-22 15:02:52] [INFO ] After 1890ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-05-22 15:02:53] [INFO ] After 2749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 3631 ms.
[2024-05-22 15:02:53] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-22 15:02:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 850 places, 2252 transitions and 7276 arcs took 15 ms.
[2024-05-22 15:02:53] [INFO ] Flatten gal took : 148 ms
Total runtime 187073 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANInsertWithFailure-PT-020

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.006s, 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: 786
MODEL NAME: /home/mcc/execution/413/model
850 places, 2252 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:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
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="CANInsertWithFailure-PT-020"
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 CANInsertWithFailure-PT-020, 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-171620503800110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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