fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r069-tall-171620503800119
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for CANInsertWithFailure-PT-030

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12741.104 3600000.00 8478140.00 5766.90 TTTT?F?TT?T?TTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r069-tall-171620503800119.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-030, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503800119
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 5.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716393539159

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-030
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 15:59:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 15:59:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 15:59:00] [INFO ] Load time of PNML (sax parser for PT used): 272 ms
[2024-05-22 15:59:00] [INFO ] Transformed 2164 places.
[2024-05-22 15:59:00] [INFO ] Transformed 5580 transitions.
[2024-05-22 15:59:00] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 397 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (53 resets) in 1846 ms. (21 steps per ms) remains 4/16 properties
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 474 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 772 ms. (51 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
// Phase 1: matrix 5580 rows 2164 cols
[2024-05-22 15:59:02] [INFO ] Computed 33 invariants in 202 ms
[2024-05-22 15:59:02] [INFO ] State equation strengthened by 1770 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2031/2140 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2140 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 22/2162 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2162 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/2164 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 15:59:03] [INFO ] Deduced a trap composed of 54 places in 259 ms of which 34 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2164 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 15:59:05] [INFO ] Deduced a trap composed of 5 places in 1184 ms of which 14 ms to minimize.
[2024-05-22 15:59:06] [INFO ] Deduced a trap composed of 5 places in 1206 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2164 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2164 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 5578ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 109 out of 2164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Graph (complete) has 7651 edges and 2164 vertex of which 2163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 134 place count 2163 transition count 5447
Reduce places removed 133 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 163 rules applied. Total rules applied 297 place count 2030 transition count 5417
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 327 place count 2000 transition count 5417
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 327 place count 2000 transition count 5406
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 349 place count 1989 transition count 5406
Performed 767 Post agglomeration using F-continuation condition.Transition count delta: 767
Deduced a syphon composed of 767 places in 4 ms
Reduce places removed 767 places and 0 transitions.
Iterating global reduction 3 with 1534 rules applied. Total rules applied 1883 place count 1222 transition count 4639
Drop transitions (Redundant composition of simpler transitions.) removed 723 transitions
Redundant transition composition rules discarded 723 transitions
Iterating global reduction 3 with 723 rules applied. Total rules applied 2606 place count 1222 transition count 3916
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2607 place count 1222 transition count 3915
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2608 place count 1221 transition count 3915
Partial Free-agglomeration rule applied 957 times.
Drop transitions (Partial Free agglomeration) removed 957 transitions
Iterating global reduction 4 with 957 rules applied. Total rules applied 3565 place count 1221 transition count 3915
Partial Free-agglomeration rule applied 290 times.
Drop transitions (Partial Free agglomeration) removed 290 transitions
Iterating global reduction 4 with 290 rules applied. Total rules applied 3855 place count 1221 transition count 3915
Applied a total of 3855 rules in 1109 ms. Remains 1221 /2164 variables (removed 943) and now considering 3915/5580 (removed 1665) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1122 ms. Remains : 1221/2164 places, 3915/5580 transitions.
RANDOM walk for 40000 steps (237 resets) in 1272 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 127159 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 4
Probabilistic random walk after 127159 steps, saw 31610 distinct states, run finished after 3006 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 3915 rows 1221 cols
[2024-05-22 15:59:12] [INFO ] Computed 32 invariants in 65 ms
[2024-05-22 15:59:12] [INFO ] State equation strengthened by 3410 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1090/1199 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1199 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 22/1221 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1221 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1221 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 3915/5136 variables, 1221/1253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5136 variables, 3410/4663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5136 variables, 0/4663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/5136 variables, 0/4663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5136/5136 variables, and 4663 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3509 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1221/1221 constraints, ReadFeed: 3410/3410 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1090/1199 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 15:59:16] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:59:16] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1199 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 15:59:16] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1199 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1199 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 22/1221 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1221 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 15:59:17] [INFO ] Deduced a trap composed of 36 places in 525 ms of which 6 ms to minimize.
[2024-05-22 15:59:18] [INFO ] Deduced a trap composed of 40 places in 546 ms of which 7 ms to minimize.
[2024-05-22 15:59:18] [INFO ] Deduced a trap composed of 39 places in 588 ms of which 6 ms to minimize.
[2024-05-22 15:59:19] [INFO ] Deduced a trap composed of 47 places in 546 ms of which 6 ms to minimize.
[2024-05-22 15:59:19] [INFO ] Deduced a trap composed of 41 places in 589 ms of which 6 ms to minimize.
[2024-05-22 15:59:20] [INFO ] Deduced a trap composed of 38 places in 552 ms of which 6 ms to minimize.
[2024-05-22 15:59:21] [INFO ] Deduced a trap composed of 51 places in 589 ms of which 6 ms to minimize.
[2024-05-22 15:59:21] [INFO ] Deduced a trap composed of 49 places in 589 ms of which 7 ms to minimize.
[2024-05-22 15:59:22] [INFO ] Deduced a trap composed of 42 places in 608 ms of which 7 ms to minimize.
[2024-05-22 15:59:22] [INFO ] Deduced a trap composed of 41 places in 554 ms of which 6 ms to minimize.
[2024-05-22 15:59:23] [INFO ] Deduced a trap composed of 37 places in 509 ms of which 6 ms to minimize.
[2024-05-22 15:59:23] [INFO ] Deduced a trap composed of 39 places in 532 ms of which 6 ms to minimize.
[2024-05-22 15:59:24] [INFO ] Deduced a trap composed of 45 places in 603 ms of which 6 ms to minimize.
[2024-05-22 15:59:25] [INFO ] Deduced a trap composed of 53 places in 592 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1221 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 15:59:25] [INFO ] Deduced a trap composed of 39 places in 622 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1221 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 15:59:26] [INFO ] Deduced a trap composed of 42 places in 601 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1221 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1221 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3915/5136 variables, 1221/1272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5136 variables, 3410/4682 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5136 variables, 4/4686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5136 variables, 0/4686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/5136 variables, 0/4686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5136/5136 variables, and 4686 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36334 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1221/1221 constraints, ReadFeed: 3410/3410 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 19/19 constraints]
After SMT, in 40111ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 290 ms.
Support contains 109 out of 1221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1221/1221 places, 3915/3915 transitions.
Applied a total of 0 rules in 84 ms. Remains 1221 /1221 variables (removed 0) and now considering 3915/3915 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 1221/1221 places, 3915/3915 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1221/1221 places, 3915/3915 transitions.
Applied a total of 0 rules in 85 ms. Remains 1221 /1221 variables (removed 0) and now considering 3915/3915 (removed 0) transitions.
[2024-05-22 15:59:52] [INFO ] Invariant cache hit.
[2024-05-22 15:59:53] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-05-22 15:59:53] [INFO ] Invariant cache hit.
[2024-05-22 15:59:54] [INFO ] State equation strengthened by 3410 read => feed constraints.
[2024-05-22 16:00:09] [INFO ] Implicit Places using invariants and state equation in 15905 ms returned []
Implicit Place search using SMT with State Equation took 16715 ms to find 0 implicit places.
[2024-05-22 16:00:09] [INFO ] Redundant transitions in 267 ms returned []
Running 3885 sub problems to find dead transitions.
[2024-05-22 16:00:09] [INFO ] Invariant cache hit.
[2024-05-22 16:00:09] [INFO ] State equation strengthened by 3410 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1220 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3885 unsolved
SMT process timed out in 32998ms, After SMT, problems are : Problem set: 0 solved, 3885 unsolved
Search for dead transitions found 0 dead transitions in 33054ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50149 ms. Remains : 1221/1221 places, 3915/3915 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2683 edges and 1221 vertex of which 579 / 1221 are part of one of the 2 SCC in 4 ms
Free SCC test removed 577 places
Drop transitions (Empty/Sink Transition effects.) removed 1355 transitions
Ensure Unique test removed 696 transitions
Reduce isomorphic transitions removed 2051 transitions.
Graph (complete) has 2091 edges and 644 vertex of which 631 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 0 output transitions
Discarding 191 places :
Symmetric choice reduction at 0 with 191 rule applications. Total rules 193 place count 440 transition count 1315
Iterating global reduction 0 with 191 rules applied. Total rules applied 384 place count 440 transition count 1315
Ensure Unique test removed 163 transitions
Reduce isomorphic transitions removed 163 transitions.
Iterating post reduction 0 with 163 rules applied. Total rules applied 547 place count 440 transition count 1152
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 561 place count 426 transition count 1124
Iterating global reduction 1 with 14 rules applied. Total rules applied 575 place count 426 transition count 1124
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 589 place count 426 transition count 1110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 591 place count 425 transition count 1109
Drop transitions (Redundant composition of simpler transitions.) removed 67 transitions
Redundant transition composition rules discarded 67 transitions
Iterating global reduction 2 with 67 rules applied. Total rules applied 658 place count 425 transition count 1042
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 669 place count 425 transition count 1031
Reduce places removed 11 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 3 with 19 rules applied. Total rules applied 688 place count 414 transition count 1023
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 696 place count 406 transition count 1023
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 697 place count 406 transition count 1022
Free-agglomeration rule applied 41 times with reduction of 1 identical transitions.
Iterating global reduction 5 with 41 rules applied. Total rules applied 738 place count 406 transition count 980
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 5 with 85 rules applied. Total rules applied 823 place count 365 transition count 936
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 824 place count 364 transition count 935
Iterating global reduction 6 with 1 rules applied. Total rules applied 825 place count 364 transition count 935
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 826 place count 363 transition count 933
Iterating global reduction 6 with 1 rules applied. Total rules applied 827 place count 363 transition count 933
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 831 place count 363 transition count 929
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 832 place count 363 transition count 928
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 833 place count 362 transition count 928
Partial Free-agglomeration rule applied 206 times.
Drop transitions (Partial Free agglomeration) removed 206 transitions
Iterating global reduction 7 with 206 rules applied. Total rules applied 1039 place count 362 transition count 928
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1043 place count 362 transition count 924
Applied a total of 1043 rules in 1002 ms. Remains 362 /1221 variables (removed 859) and now considering 924/3915 (removed 2991) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 924 rows 362 cols
[2024-05-22 16:00:43] [INFO ] Computed 19 invariants in 13 ms
[2024-05-22 16:00:44] [INFO ] [Real]Absence check using 19 positive place invariants in 56 ms returned sat
[2024-05-22 16:00:44] [INFO ] After 362ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 16:00:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-22 16:00:44] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 16:00:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 16:00:45] [INFO ] After 313ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 16:00:45] [INFO ] After 717ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 16:00:45] [INFO ] After 1631ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 3070 ms.
[2024-05-22 16:00:45] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-05-22 16:00:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1221 places, 3915 transitions and 15054 arcs took 23 ms.
[2024-05-22 16:00:46] [INFO ] Flatten gal took : 314 ms
Total runtime 106248 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANInsertWithFailure-PT-030

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 646
MODEL NAME: /home/mcc/execution/414/model
1221 places, 3915 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

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