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.r528-tall-171683760900343.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 ltsminxred
Input is ShieldIIPt-PT-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760900343
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 13 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 00:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 00:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 539K May 18 16:43 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 ShieldIIPt-PT-100A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717240996153

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:23:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:23:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:23:17] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-06-01 11:23:17] [INFO ] Transformed 1903 places.
[2024-06-01 11:23:17] [INFO ] Transformed 1403 transitions.
[2024-06-01 11:23:17] [INFO ] Found NUPN structural information;
[2024-06-01 11:23:17] [INFO ] Parsed PT model containing 1903 places and 1403 transitions and 6006 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 40000 steps (8 resets) in 2050 ms. (19 steps per ms) remains 14/16 properties
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 882 ms. (45 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 640 ms. (62 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 599 ms. (66 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 569 ms. (70 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 456 ms. (87 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 629 ms. (63 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 498 ms. (80 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 471 ms. (84 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1375 ms. (29 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 734 ms. (54 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 506 ms. (78 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 452 ms. (88 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 444 ms. (89 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 491 ms. (81 steps per ms) remains 14/14 properties
// Phase 1: matrix 1402 rows 1903 cols
[2024-06-01 11:23:21] [INFO ] Computed 901 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 251/251 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 252/503 variables, 236/487 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 252/739 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1400/1903 variables, 665/1404 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 1400/2804 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1903 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1402/3305 variables, 1903/4707 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3305 variables, 0/4707 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/3305 variables, 0/4707 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3305/3305 variables, and 4707 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3801 ms.
Refiners :[Domain max(s): 1903/1903 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1903/1903 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 251/251 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 252/503 variables, 236/487 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 252/739 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1400/1903 variables, 665/1404 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 1400/2804 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1903 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1402/3305 variables, 1903/4707 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3305 variables, 14/4721 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3305/3305 variables, and 4721 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5012 ms.
Refiners :[Domain max(s): 1903/1903 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1903/1903 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 9009ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 251 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Partial Free-agglomeration rule applied 162 times.
Drop transitions (Partial Free agglomeration) removed 162 transitions
Iterating global reduction 0 with 162 rules applied. Total rules applied 164 place count 1902 transition count 1401
Applied a total of 164 rules in 380 ms. Remains 1902 /1903 variables (removed 1) and now considering 1401/1402 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 1902/1903 places, 1401/1402 transitions.
RANDOM walk for 40000 steps (8 resets) in 1545 ms. (25 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 598 ms. (66 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 536 ms. (74 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 518 ms. (77 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 545 ms. (73 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 479 ms. (83 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 512 ms. (77 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 483 ms. (82 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 485 ms. (82 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 608 ms. (65 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 534 ms. (74 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 490 ms. (81 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 476 ms. (83 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 480 ms. (83 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 519 ms. (76 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 182650 steps, run timeout after 6001 ms. (steps per millisecond=30 ) properties seen :9 out of 14
Probabilistic random walk after 182650 steps, saw 180870 distinct states, run finished after 6005 ms. (steps per millisecond=30 ) properties seen :9
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1401 rows 1902 cols
[2024-06-01 11:23:38] [INFO ] Computed 901 invariants in 7 ms
[2024-06-01 11:23:38] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 190/363 variables, 168/341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 190/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1539/1902 variables, 733/1264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1902 variables, 1539/2803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1902 variables, 0/2803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1401/3303 variables, 1902/4705 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3303 variables, 80/4785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3303 variables, 0/4785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/3303 variables, 0/4785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3303/3303 variables, and 4785 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1727 ms.
Refiners :[Domain max(s): 1902/1902 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1902/1902 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 190/363 variables, 168/341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 190/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1539/1902 variables, 733/1264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1902 variables, 1539/2803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1902 variables, 0/2803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1401/3303 variables, 1902/4705 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3303 variables, 80/4785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3303 variables, 5/4790 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3303 variables, 0/4790 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/3303 variables, 0/4790 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3303/3303 variables, and 4790 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4788 ms.
Refiners :[Domain max(s): 1902/1902 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1902/1902 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 6584ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 36107 ms.
Support contains 173 out of 1902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 1401/1401 transitions.
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1902 transition count 1401
Applied a total of 14 rules in 117 ms. Remains 1902 /1902 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 1902/1902 places, 1401/1401 transitions.
RANDOM walk for 40000 steps (8 resets) in 886 ms. (45 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 542 ms. (73 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 468 ms. (85 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 473 ms. (84 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 582 ms. (68 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 102673 steps, run timeout after 3003 ms. (steps per millisecond=34 ) properties seen :0 out of 5
Probabilistic random walk after 102673 steps, saw 101490 distinct states, run finished after 3003 ms. (steps per millisecond=34 ) properties seen :0
// Phase 1: matrix 1401 rows 1902 cols
[2024-06-01 11:24:25] [INFO ] Computed 901 invariants in 11 ms
[2024-06-01 11:24:25] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 190/363 variables, 168/341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 190/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1539/1902 variables, 733/1264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1902 variables, 1539/2803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1902 variables, 0/2803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1401/3303 variables, 1902/4705 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3303 variables, 90/4795 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3303 variables, 0/4795 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/3303 variables, 0/4795 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3303/3303 variables, and 4795 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1800 ms.
Refiners :[Domain max(s): 1902/1902 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1902/1902 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 190/363 variables, 168/341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 190/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1539/1902 variables, 733/1264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1902 variables, 1539/2803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1902 variables, 0/2803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1401/3303 variables, 1902/4705 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3303 variables, 90/4795 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3303 variables, 5/4800 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3303 variables, 0/4800 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/3303 variables, 0/4800 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3303/3303 variables, and 4800 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4840 ms.
Refiners :[Domain max(s): 1902/1902 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1902/1902 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 6722ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 32224 ms.
Support contains 173 out of 1902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 1401/1401 transitions.
Applied a total of 0 rules in 59 ms. Remains 1902 /1902 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 1902/1902 places, 1401/1401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 1401/1401 transitions.
Applied a total of 0 rules in 55 ms. Remains 1902 /1902 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
[2024-06-01 11:25:04] [INFO ] Invariant cache hit.
[2024-06-01 11:25:05] [INFO ] Implicit Places using invariants in 1195 ms returned [1893]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1208 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1901/1902 places, 1401/1401 transitions.
Applied a total of 0 rules in 57 ms. Remains 1901 /1901 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1323 ms. Remains : 1901/1902 places, 1401/1401 transitions.
RANDOM walk for 40000 steps (8 resets) in 1014 ms. (39 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 549 ms. (72 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 489 ms. (81 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 461 ms. (86 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 587 ms. (68 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 535 ms. (74 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 99942 steps, run timeout after 3029 ms. (steps per millisecond=32 ) properties seen :0 out of 5
Probabilistic random walk after 99942 steps, saw 98773 distinct states, run finished after 3029 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 1401 rows 1901 cols
[2024-06-01 11:25:09] [INFO ] Computed 900 invariants in 5 ms
[2024-06-01 11:25:09] [INFO ] State equation strengthened by 89 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 190/363 variables, 168/341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 190/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1538/1901 variables, 732/1263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1901 variables, 1538/2801 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1901 variables, 0/2801 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1401/3302 variables, 1901/4702 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3302 variables, 89/4791 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3302 variables, 0/4791 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/3302 variables, 0/4791 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3302/3302 variables, and 4791 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1642 ms.
Refiners :[Domain max(s): 1901/1901 constraints, Positive P Invariants (semi-flows): 900/900 constraints, State Equation: 1901/1901 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 190/363 variables, 168/341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 190/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1538/1901 variables, 732/1263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1901 variables, 1538/2801 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1901 variables, 0/2801 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1401/3302 variables, 1901/4702 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3302 variables, 89/4791 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3302 variables, 5/4796 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3302 variables, 0/4796 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/3302 variables, 0/4796 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3302/3302 variables, and 4796 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4699 ms.
Refiners :[Domain max(s): 1901/1901 constraints, Positive P Invariants (semi-flows): 900/900 constraints, State Equation: 1901/1901 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 6387ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 35986 ms.
Support contains 170 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1401/1401 transitions.
Applied a total of 0 rules in 50 ms. Remains 1901 /1901 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1901/1901 places, 1401/1401 transitions.
RANDOM walk for 40000 steps (8 resets) in 923 ms. (43 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 547 ms. (72 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 463 ms. (86 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 589 ms. (67 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 535 ms. (74 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 102870 steps, run timeout after 3002 ms. (steps per millisecond=34 ) properties seen :0 out of 4
Probabilistic random walk after 102870 steps, saw 101687 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
[2024-06-01 11:25:56] [INFO ] Invariant cache hit.
[2024-06-01 11:25:56] [INFO ] State equation strengthened by 89 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 187/357 variables, 165/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 187/522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1544/1901 variables, 735/1257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1901 variables, 1544/2801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1901 variables, 0/2801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1401/3302 variables, 1901/4702 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3302 variables, 89/4791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3302 variables, 0/4791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/3302 variables, 0/4791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3302/3302 variables, and 4791 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1499 ms.
Refiners :[Domain max(s): 1901/1901 constraints, Positive P Invariants (semi-flows): 900/900 constraints, State Equation: 1901/1901 constraints, ReadFeed: 89/89 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/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 187/357 variables, 165/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 187/522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1544/1901 variables, 735/1257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1901 variables, 1544/2801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1901 variables, 0/2801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1401/3302 variables, 1901/4702 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3302 variables, 89/4791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3302 variables, 4/4795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3302 variables, 0/4795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/3302 variables, 0/4795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3302/3302 variables, and 4795 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4143 ms.
Refiners :[Domain max(s): 1901/1901 constraints, Positive P Invariants (semi-flows): 900/900 constraints, State Equation: 1901/1901 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 5678ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 32013 ms.
Support contains 170 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1401/1401 transitions.
Applied a total of 0 rules in 56 ms. Remains 1901 /1901 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1901/1901 places, 1401/1401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1401/1401 transitions.
Applied a total of 0 rules in 44 ms. Remains 1901 /1901 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
[2024-06-01 11:26:33] [INFO ] Invariant cache hit.
[2024-06-01 11:26:35] [INFO ] Implicit Places using invariants in 1123 ms returned []
[2024-06-01 11:26:35] [INFO ] Invariant cache hit.
[2024-06-01 11:26:36] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-06-01 11:26:41] [INFO ] Implicit Places using invariants and state equation in 6584 ms returned []
Implicit Place search using SMT with State Equation took 7710 ms to find 0 implicit places.
[2024-06-01 11:26:41] [INFO ] Redundant transitions in 99 ms returned []
Running 1400 sub problems to find dead transitions.
[2024-06-01 11:26:41] [INFO ] Invariant cache hit.
[2024-06-01 11:26:41] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1900 variables, 1900/1900 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1900/3302 variables, and 1900 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30048 ms.
Refiners :[Domain max(s): 1900/1901 constraints, Positive P Invariants (semi-flows): 0/900 constraints, State Equation: 0/1901 constraints, ReadFeed: 0/89 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1900 variables, 1900/1900 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1900/3302 variables, and 1900 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30032 ms.
Refiners :[Domain max(s): 1900/1901 constraints, Positive P Invariants (semi-flows): 0/900 constraints, State Equation: 0/1901 constraints, ReadFeed: 0/89 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 0/0 constraints]
After SMT, in 60706ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 60721ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68593 ms. Remains : 1901/1901 places, 1401/1401 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 85 times.
Drop transitions (Partial Free agglomeration) removed 85 transitions
Iterating global reduction 0 with 85 rules applied. Total rules applied 85 place count 1901 transition count 1401
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 0 with 85 rules applied. Total rules applied 170 place count 1901 transition count 1316
Applied a total of 170 rules in 141 ms. Remains 1901 /1901 variables (removed 0) and now considering 1316/1401 (removed 85) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1316 rows 1901 cols
[2024-06-01 11:27:42] [INFO ] Computed 900 invariants in 5 ms
[2024-06-01 11:27:43] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 11:27:43] [INFO ] [Nat]Absence check using 900 positive place invariants in 148 ms returned sat
[2024-06-01 11:27:45] [INFO ] After 1659ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 11:27:46] [INFO ] After 2592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 11:27:47] [INFO ] After 4038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 4676 ms.
[2024-06-01 11:27:47] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-01 11:27:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1901 places, 1401 transitions and 6438 arcs took 10 ms.
[2024-06-01 11:27:47] [INFO ] Flatten gal took : 271 ms
Total runtime 270354 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldIIPt-PT-100A-ReachabilityFireability-2024-04
Could not compute solution for formula : ShieldIIPt-PT-100A-ReachabilityFireability-2024-05
Could not compute solution for formula : ShieldIIPt-PT-100A-ReachabilityFireability-2024-10
Could not compute solution for formula : ShieldIIPt-PT-100A-ReachabilityFireability-2024-11

BK_STOP 1717241267928

--------------------
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
mcc2024
rfs formula name ShieldIIPt-PT-100A-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/579/inv_0_
rfs formula name ShieldIIPt-PT-100A-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/579/inv_1_
rfs formula name ShieldIIPt-PT-100A-ReachabilityFireability-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/579/inv_2_
rfs formula name ShieldIIPt-PT-100A-ReachabilityFireability-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/579/inv_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ShieldIIPt-PT-100A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPt-PT-100A, 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 r528-tall-171683760900343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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