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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:35 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:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 60M 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-100-ReachabilityFireability-2024-00
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-2024-01
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-2024-02
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-2024-03
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-2024-04
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-2024-05
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-2023-06
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-2024-07
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-2024-08
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-2024-09
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-2023-10
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-2023-11
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-2024-12
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-2023-13
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-2024-14
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716412286489

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 21:11:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 21:11:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 21:11:29] [INFO ] Load time of PNML (sax parser for PT used): 1327 ms
[2024-05-22 21:11:29] [INFO ] Transformed 21204 places.
[2024-05-22 21:11:29] [INFO ] Transformed 60600 transitions.
[2024-05-22 21:11:29] [INFO ] Parsed PT model containing 21204 places and 60600 transitions and 162000 arcs in 1716 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (15 resets) in 4153 ms. (9 steps per ms) remains 13/16 properties
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 704 ms. (56 steps per ms) remains 13/13 properties
// Phase 1: matrix 60600 rows 21204 cols
[2024-05-22 21:11:59] [INFO ] Computed 103 invariants in 26818 ms
[2024-05-22 21:11:59] [INFO ] State equation strengthened by 19900 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 20930/21058 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 21058/81804 variables, and 29 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5045 ms.
Refiners :[Positive P Invariants (semi-flows): 29/101 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/21204 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 20930/21058 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 21:12:09] [INFO ] Deduced a trap composed of 5 places in 1522 ms of which 68 ms to minimize.
[2024-05-22 21:12:10] [INFO ] Deduced a trap composed of 5 places in 1341 ms of which 10 ms to minimize.
SMT process timed out in 38791ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 128 out of 21204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21204/21204 places, 60600/60600 transitions.
Graph (complete) has 81501 edges and 21204 vertex of which 21203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.64 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 659 transitions
Trivial Post-agglo rules discarded 659 transitions
Performed 659 trivial Post agglomeration. Transition count delta: 659
Iterating post reduction 0 with 659 rules applied. Total rules applied 660 place count 21203 transition count 59941
Reduce places removed 659 places and 0 transitions.
Iterating post reduction 1 with 659 rules applied. Total rules applied 1319 place count 20544 transition count 59941
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 1319 place count 20544 transition count 59929
Deduced a syphon composed of 12 places in 20 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 1343 place count 20532 transition count 59929
Performed 9839 Post agglomeration using F-continuation condition.Transition count delta: 9839
Deduced a syphon composed of 9839 places in 41 ms
Reduce places removed 9839 places and 0 transitions.
Iterating global reduction 2 with 19678 rules applied. Total rules applied 21021 place count 10693 transition count 50090
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 2 with 29 rules applied. Total rules applied 21050 place count 10693 transition count 50061
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 21079 place count 10664 transition count 50061
Partial Free-agglomeration rule applied 10172 times.
Drop transitions (Partial Free agglomeration) removed 10172 transitions
Iterating global reduction 3 with 10172 rules applied. Total rules applied 31251 place count 10664 transition count 50061
Partial Free-agglomeration rule applied 1196 times.
Drop transitions (Partial Free agglomeration) removed 1196 transitions
Iterating global reduction 3 with 1196 rules applied. Total rules applied 32447 place count 10664 transition count 50061
Applied a total of 32447 rules in 36760 ms. Remains 10664 /21204 variables (removed 10540) and now considering 50061/60600 (removed 10539) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36781 ms. Remains : 10664/21204 places, 50061/60600 transitions.
RANDOM walk for 40000 steps (64 resets) in 3073 ms. (13 steps per ms) remains 8/13 properties
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-2023-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
[2024-05-22 21:12:49] [INFO ] Flow matrix only has 50024 transitions (discarded 37 similar events)
// Phase 1: matrix 50024 rows 10664 cols
[2024-05-22 21:12:59] [INFO ] Computed 102 invariants in 10412 ms
[2024-05-22 21:13:00] [INFO ] State equation strengthened by 49526 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10406/10506 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10506 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 154/10660 variables, 77/100 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10660 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/10662 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10662 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 50024/60686 variables, 10662/10764 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 56288ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 100 out of 10664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10664/10664 places, 50061/50061 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 10 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 10649 transition count 50046
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 10649 transition count 50045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 32 place count 10648 transition count 50045
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 10648 transition count 50045
Applied a total of 39 rules in 21364 ms. Remains 10648 /10664 variables (removed 16) and now considering 50045/50061 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21364 ms. Remains : 10648/10664 places, 50045/50061 transitions.
RANDOM walk for 40000 steps (64 resets) in 2901 ms. (13 steps per ms) remains 3/8 properties
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
[2024-05-22 21:14:07] [INFO ] Flow matrix only has 50013 transitions (discarded 32 similar events)
// Phase 1: matrix 50013 rows 10648 cols
[2024-05-22 21:14:18] [INFO ] Computed 102 invariants in 10744 ms
[2024-05-22 21:14:19] [INFO ] State equation strengthened by 49560 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10395/10490 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10490 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 154/10644 variables, 77/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10644 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/10646 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10646 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 60659/60661 variables, and 10748 constraints, problems are : Problem set: 0 solved, 3 unsolved in 75088 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 10646/10648 constraints, ReadFeed: 0/49560 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10395/10490 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 21:15:36] [INFO ] Deduced a trap composed of 2 places in 569 ms of which 4 ms to minimize.
[2024-05-22 21:15:37] [INFO ] Deduced a trap composed of 2 places in 672 ms of which 3 ms to minimize.
[2024-05-22 21:15:37] [INFO ] Deduced a trap composed of 2 places in 536 ms of which 3 ms to minimize.
[2024-05-22 21:15:38] [INFO ] Deduced a trap composed of 2 places in 540 ms of which 3 ms to minimize.
[2024-05-22 21:15:39] [INFO ] Deduced a trap composed of 2 places in 535 ms of which 3 ms to minimize.
[2024-05-22 21:15:39] [INFO ] Deduced a trap composed of 2 places in 534 ms of which 3 ms to minimize.
[2024-05-22 21:15:40] [INFO ] Deduced a trap composed of 2 places in 525 ms of which 3 ms to minimize.
[2024-05-22 21:15:41] [INFO ] Deduced a trap composed of 2 places in 569 ms of which 3 ms to minimize.
[2024-05-22 21:15:41] [INFO ] Deduced a trap composed of 2 places in 553 ms of which 3 ms to minimize.
[2024-05-22 21:15:42] [INFO ] Deduced a trap composed of 2 places in 550 ms of which 2 ms to minimize.
[2024-05-22 21:15:43] [INFO ] Deduced a trap composed of 2 places in 548 ms of which 3 ms to minimize.
[2024-05-22 21:15:43] [INFO ] Deduced a trap composed of 2 places in 561 ms of which 3 ms to minimize.
[2024-05-22 21:15:44] [INFO ] Deduced a trap composed of 2 places in 555 ms of which 2 ms to minimize.
[2024-05-22 21:15:45] [INFO ] Deduced a trap composed of 2 places in 540 ms of which 3 ms to minimize.
[2024-05-22 21:15:45] [INFO ] Deduced a trap composed of 2 places in 562 ms of which 3 ms to minimize.
[2024-05-22 21:15:46] [INFO ] Deduced a trap composed of 2 places in 548 ms of which 3 ms to minimize.
[2024-05-22 21:15:47] [INFO ] Deduced a trap composed of 2 places in 573 ms of which 2 ms to minimize.
[2024-05-22 21:15:47] [INFO ] Deduced a trap composed of 2 places in 569 ms of which 2 ms to minimize.
[2024-05-22 21:15:48] [INFO ] Deduced a trap composed of 2 places in 564 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10490 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10490 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 154/10644 variables, 77/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10644 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/10646 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10646 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 50013/60659 variables, 10646/10767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 60659/60661 variables, and 60327 constraints, problems are : Problem set: 0 solved, 3 unsolved in 75064 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 10646/10648 constraints, ReadFeed: 49560/49560 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 19/19 constraints]
After SMT, in 161504ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 95 out of 10648 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10648/10648 places, 50045/50045 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 10645 transition count 50042
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 10645 transition count 50042
Applied a total of 8 rules in 15733 ms. Remains 10645 /10648 variables (removed 3) and now considering 50042/50045 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15733 ms. Remains : 10645/10648 places, 50042/50045 transitions.
RANDOM walk for 40000 steps (64 resets) in 2509 ms. (15 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 94043 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :0 out of 3
Probabilistic random walk after 94043 steps, saw 90122 distinct states, run finished after 3008 ms. (steps per millisecond=31 ) properties seen :0
[2024-05-22 21:17:09] [INFO ] Flow matrix only has 50012 transitions (discarded 30 similar events)
// Phase 1: matrix 50012 rows 10645 cols
[2024-05-22 21:17:22] [INFO ] Computed 102 invariants in 13058 ms
[2024-05-22 21:17:22] [INFO ] State equation strengthened by 49570 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10392/10487 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10487 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 154/10641 variables, 77/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10641 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/10643 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10643 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 50012/60655 variables, 10643/10745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 60655/60657 variables, and 60315 constraints, problems are : Problem set: 0 solved, 3 unsolved in 90139 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 10643/10645 constraints, ReadFeed: 49570/49570 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10392/10487 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 21:18:54] [INFO ] Deduced a trap composed of 2 places in 538 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10487 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10487 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 154/10641 variables, 77/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10641 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/10643 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10643 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 50012/60655 variables, 10643/10746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 60655/60657 variables, and 60316 constraints, problems are : Problem set: 0 solved, 3 unsolved in 90065 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 10643/10645 constraints, ReadFeed: 49570/49570 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 193753ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 95 out of 10645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10645/10645 places, 50042/50042 transitions.
Applied a total of 0 rules in 5134 ms. Remains 10645 /10645 variables (removed 0) and now considering 50042/50042 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5134 ms. Remains : 10645/10645 places, 50042/50042 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10645/10645 places, 50042/50042 transitions.
Applied a total of 0 rules in 5128 ms. Remains 10645 /10645 variables (removed 0) and now considering 50042/50042 (removed 0) transitions.
[2024-05-22 21:20:33] [INFO ] Flow matrix only has 50012 transitions (discarded 30 similar events)
[2024-05-22 21:20:33] [INFO ] Invariant cache hit.
[2024-05-22 21:21:04] [INFO ] Performed 8583/10645 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 21:21:06] [INFO ] Implicit Places using invariants in 33009 ms returned []
Implicit Place search using SMT only with invariants took 33046 ms to find 0 implicit places.
Running 49942 sub problems to find dead transitions.
[2024-05-22 21:21:06] [INFO ] Flow matrix only has 50012 transitions (discarded 30 similar events)
[2024-05-22 21:21:06] [INFO ] Invariant cache hit.
[2024-05-22 21:21:07] [INFO ] State equation strengthened by 49570 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10644/60657 variables, and 100 constraints, problems are : Problem set: 0 solved, 49942 unsolved in 30576 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10645 constraints, ReadFeed: 0/49570 constraints, PredecessorRefiner: 49942/49942 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49942 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10644/60657 variables, and 100 constraints, problems are : Problem set: 0 solved, 49942 unsolved in 30530 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10645 constraints, ReadFeed: 0/49570 constraints, PredecessorRefiner: 0/49942 constraints, Known Traps: 0/0 constraints]
After SMT, in 349985ms problems are : Problem set: 0 solved, 49942 unsolved
Search for dead transitions found 0 dead transitions in 350389ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388704 ms. Remains : 10645/10645 places, 50042/50042 transitions.
[2024-05-22 21:26:56] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 12 ms.
[2024-05-22 21:26:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10645 places, 50042 transitions and 200182 arcs took 168 ms.
[2024-05-22 21:26:59] [INFO ] Flatten gal took : 1782 ms
Total runtime 931472 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANInsertWithFailure-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: 10645
TRANSITIONS: 50042
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 1.009s, Sys 0.080s]


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


----------------------------------------------------------------------
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: 675
MODEL NAME: /home/mcc/execution/411/model
10645 places, 50042 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..

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//
++ 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 ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-100"
export BK_EXAMINATION="ReachabilityFireability"
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-100, examination is ReachabilityFireability"
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-171620504000175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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