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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:32 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 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:32 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 15M 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-100-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2023-11
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716382835222

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-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 13:00:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 13:00:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:00:37] [INFO ] Load time of PNML (sax parser for PT used): 1026 ms
[2024-05-22 13:00:37] [INFO ] Transformed 21202 places.
[2024-05-22 13:00:37] [INFO ] Transformed 40800 transitions.
[2024-05-22 13:00:37] [INFO ] Parsed PT model containing 21202 places and 40800 transitions and 122000 arcs in 1281 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (20 resets) in 5276 ms. (7 steps per ms) remains 11/16 properties
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 481 ms. (82 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 721 ms. (55 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 11/11 properties
// Phase 1: matrix 40800 rows 21202 cols
[2024-05-22 13:00:41] [INFO ] Computed 201 invariants in 610 ms
[2024-05-22 13:00:41] [INFO ] State equation strengthened by 19900 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem CANConstruction-PT-100-ReachabilityCardinality-2024-03 is UNSAT
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-100-ReachabilityCardinality-2024-12 is UNSAT
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 20815/21091 variables, 91/91 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 21091/62002 variables, and 91 constraints, problems are : Problem set: 2 solved, 9 unsolved in 5049 ms.
Refiners :[Positive P Invariants (semi-flows): 91/101 constraints, Generalized P Invariants (flows): 0/100 constraints, State Equation: 0/21202 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 20890/21083 variables, 83/83 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-22 13:02:19] [INFO ] Deduced a trap composed of 5 places in 89687 ms of which 834 ms to minimize.
SMT process timed out in 99128ms, After SMT, problems are : Problem set: 2 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 193 out of 21202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 691 transitions
Trivial Post-agglo rules discarded 691 transitions
Performed 691 trivial Post agglomeration. Transition count delta: 691
Iterating post reduction 0 with 691 rules applied. Total rules applied 691 place count 21202 transition count 40109
Reduce places removed 691 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 694 rules applied. Total rules applied 1385 place count 20511 transition count 40106
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1388 place count 20508 transition count 40106
Performed 9805 Post agglomeration using F-continuation condition.Transition count delta: 9805
Deduced a syphon composed of 9805 places in 19 ms
Reduce places removed 9805 places and 0 transitions.
Iterating global reduction 3 with 19610 rules applied. Total rules applied 20998 place count 10703 transition count 30301
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 21094 place count 10607 transition count 30109
Iterating global reduction 3 with 96 rules applied. Total rules applied 21190 place count 10607 transition count 30109
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 21193 place count 10607 transition count 30106
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 21196 place count 10604 transition count 30106
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 21197 place count 10604 transition count 30106
Applied a total of 21197 rules in 24362 ms. Remains 10604 /21202 variables (removed 10598) and now considering 30106/40800 (removed 10694) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24379 ms. Remains : 10604/21202 places, 30106/40800 transitions.
RANDOM walk for 40000 steps (56 resets) in 3124 ms. (12 steps per ms) remains 5/9 properties
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 200 ms. (199 steps per ms) remains 5/5 properties
// Phase 1: matrix 30106 rows 10604 cols
[2024-05-22 13:02:45] [INFO ] Computed 201 invariants in 287 ms
[2024-05-22 13:02:46] [INFO ] State equation strengthened by 29704 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10376/10455 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10455 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 48/10503 variables, 48/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10503 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 100/10603 variables, 100/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10603 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 30106/40709 variables, 10603/10804 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40709 variables, 29704/40508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40709 variables, 0/40508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/40710 variables, 1/40509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40710 variables, 0/40509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/40710 variables, 0/40509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40710/40710 variables, and 40509 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45028 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 10604/10604 constraints, ReadFeed: 29704/29704 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10376/10455 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 13:03:58] [INFO ] Deduced a trap composed of 2 places in 25939 ms of which 65 ms to minimize.
[2024-05-22 13:04:26] [INFO ] Deduced a trap composed of 2 places in 27441 ms of which 67 ms to minimize.
SMT process timed out in 100481ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 79 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 30106/30106 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 10604 transition count 30104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10602 transition count 30104
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 17 place count 10589 transition count 30078
Iterating global reduction 2 with 13 rules applied. Total rules applied 30 place count 10589 transition count 30078
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 6 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 90 place count 10559 transition count 30048
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 114 place count 10547 transition count 30049
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 10547 transition count 30049
Applied a total of 115 rules in 21717 ms. Remains 10547 /10604 variables (removed 57) and now considering 30049/30106 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21717 ms. Remains : 10547/10604 places, 30049/30106 transitions.
RANDOM walk for 40000 steps (56 resets) in 2126 ms. (18 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 79749 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 5
Probabilistic random walk after 79749 steps, saw 74095 distinct states, run finished after 3005 ms. (steps per millisecond=26 ) properties seen :0
// Phase 1: matrix 30049 rows 10547 cols
[2024-05-22 13:04:51] [INFO ] Computed 201 invariants in 234 ms
[2024-05-22 13:04:52] [INFO ] State equation strengthened by 29759 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10319/10398 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10398 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 48/10446 variables, 48/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10446 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 100/10546 variables, 100/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10546 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 30049/40595 variables, 10546/10747 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40595 variables, 29759/40506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40595 variables, 0/40506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/40596 variables, 1/40507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40596 variables, 0/40507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/40596 variables, 0/40507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40596/40596 variables, and 40507 constraints, problems are : Problem set: 0 solved, 5 unsolved in 44748 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 10547/10547 constraints, ReadFeed: 29759/29759 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10319/10398 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 13:06:01] [INFO ] Deduced a trap composed of 2 places in 23688 ms of which 61 ms to minimize.
[2024-05-22 13:06:05] [INFO ] Deduced a trap composed of 108 places in 3539 ms of which 25 ms to minimize.
[2024-05-22 13:06:09] [INFO ] Deduced a trap composed of 110 places in 3439 ms of which 27 ms to minimize.
[2024-05-22 13:06:12] [INFO ] Deduced a trap composed of 104 places in 3176 ms of which 24 ms to minimize.
[2024-05-22 13:06:15] [INFO ] Deduced a trap composed of 110 places in 3062 ms of which 26 ms to minimize.
[2024-05-22 13:06:18] [INFO ] Deduced a trap composed of 105 places in 2823 ms of which 23 ms to minimize.
[2024-05-22 13:06:21] [INFO ] Deduced a trap composed of 105 places in 2727 ms of which 23 ms to minimize.
[2024-05-22 13:06:24] [INFO ] Deduced a trap composed of 104 places in 2512 ms of which 21 ms to minimize.
[2024-05-22 13:06:26] [INFO ] Deduced a trap composed of 104 places in 2560 ms of which 21 ms to minimize.
[2024-05-22 13:06:29] [INFO ] Deduced a trap composed of 104 places in 2373 ms of which 20 ms to minimize.
[2024-05-22 13:06:32] [INFO ] Deduced a trap composed of 104 places in 2715 ms of which 20 ms to minimize.
[2024-05-22 13:06:35] [INFO ] Deduced a trap composed of 104 places in 2779 ms of which 21 ms to minimize.
[2024-05-22 13:06:37] [INFO ] Deduced a trap composed of 104 places in 2790 ms of which 22 ms to minimize.
[2024-05-22 13:06:40] [INFO ] Deduced a trap composed of 104 places in 2711 ms of which 21 ms to minimize.
[2024-05-22 13:06:43] [INFO ] Deduced a trap composed of 104 places in 2818 ms of which 21 ms to minimize.
[2024-05-22 13:06:46] [INFO ] Deduced a trap composed of 110 places in 2619 ms of which 20 ms to minimize.
[2024-05-22 13:06:49] [INFO ] Deduced a trap composed of 110 places in 2694 ms of which 18 ms to minimize.
[2024-05-22 13:06:52] [INFO ] Deduced a trap composed of 109 places in 2628 ms of which 19 ms to minimize.
SMT process timed out in 120391ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 79 out of 10547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10547/10547 places, 30049/30049 transitions.
Applied a total of 0 rules in 4028 ms. Remains 10547 /10547 variables (removed 0) and now considering 30049/30049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4028 ms. Remains : 10547/10547 places, 30049/30049 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10547/10547 places, 30049/30049 transitions.
Applied a total of 0 rules in 4038 ms. Remains 10547 /10547 variables (removed 0) and now considering 30049/30049 (removed 0) transitions.
[2024-05-22 13:07:00] [INFO ] Invariant cache hit.
[2024-05-22 13:07:11] [INFO ] Implicit Places using invariants in 11423 ms returned [5, 11, 17, 23, 29, 35, 41, 47, 53, 59, 65, 71, 77, 83, 89, 95, 101, 107, 113, 119, 125, 131, 137, 143, 149, 155, 161, 167, 173, 179, 185, 191, 197, 203, 209, 215, 221, 227, 233, 239, 245, 251, 257, 263, 269, 275, 281, 287, 293, 299, 305, 311, 317, 323, 329, 335, 341, 347, 353, 359, 365, 371, 377, 383, 389, 395, 401, 407, 413, 419, 425, 431, 437, 443, 449, 455, 461, 467, 473, 479, 485, 491, 497, 503, 509, 515, 521, 527, 533, 539, 545, 551, 557, 563, 569, 575, 581, 587, 593, 600]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 11463 ms to find 100 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 10447/10547 places, 30049/30049 transitions.
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 199
Deduced a syphon composed of 199 places in 7 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 10248 transition count 29850
Applied a total of 398 rules in 454165 ms. Remains 10248 /10447 variables (removed 199) and now considering 29850/30049 (removed 199) transitions.
// Phase 1: matrix 29850 rows 10248 cols
[2024-05-22 13:14:48] [INFO ] Computed 101 invariants in 2441 ms
[2024-05-22 13:14:58] [INFO ] Implicit Places using invariants in 12934 ms returned []
Implicit Place search using SMT only with invariants took 12936 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 10248/10547 places, 29850/30049 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 482609 ms. Remains : 10248/10547 places, 29850/30049 transitions.
[2024-05-22 13:14:58] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-22 13:14:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10248 places, 29850 transitions and 129024 arcs took 106 ms.
[2024-05-22 13:15:00] [INFO ] Flatten gal took : 944 ms
Total runtime 863600 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANConstruction-PT-100

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 10248
TRANSITIONS: 29850
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.688s, Sys 0.031s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.107s, Sys 0.007s]


----------------------------------------------------------------------
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: 657
MODEL NAME: /home/mcc/execution/411/model
10248 places, 29850 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716384235513

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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-100"
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-100, 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-171620503800086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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