fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of ITS-Tools for ShieldRVt-PT-030B

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8660.252 2005012.00 2404668.00 5591.40 TTTFTTFTTTTTTTFT 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.r356-tall-171683762301007.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 itstools
Input is ShieldRVt-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762301007
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 21:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 21:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 364K 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 ShieldRVt-PT-030B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717082141156

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-30 15:15:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 15:15:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 15:15:42] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-05-30 15:15:42] [INFO ] Transformed 1503 places.
[2024-05-30 15:15:42] [INFO ] Transformed 1503 transitions.
[2024-05-30 15:15:42] [INFO ] Found NUPN structural information;
[2024-05-30 15:15:42] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 15:15:43] [INFO ] Flatten gal took : 270 ms
RANDOM walk for 40000 steps (8 resets) in 2422 ms. (16 steps per ms) remains 13/16 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 13/13 properties
[2024-05-30 15:15:43] [INFO ] Flatten gal took : 191 ms
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 13/13 properties
[2024-05-30 15:15:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11201345900631856859.gal : 71 ms
BEST_FIRST walk for 40003 steps (8 resets) in 343 ms. (116 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
[2024-05-30 15:15:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14364832223228074000.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11201345900631856859.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14364832223228074000.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40004 steps (8 resets) in 364 ms. (109 steps per ms) remains 13/13 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 13/13 properties
Loading property file /tmp/ReachabilityCardinality14364832223228074000.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 12/13 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
// Phase 1: matrix 1503 rows 1503 cols
[2024-05-30 15:15:44] [INFO ] Computed 121 invariants in 35 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :10 after 19
At refinement iteration 2 (OVERLAPS) 1315/1503 variables, 121/309 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :36 after 239
At refinement iteration 3 (INCLUDED_ONLY) 0/1503 variables, 1315/1624 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1503 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1503/3006 variables, 1503/3127 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3006 variables, 0/3127 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :239 after 2.01901e+06
At refinement iteration 7 (OVERLAPS) 0/3006 variables, 0/3127 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3006/3006 variables, and 3127 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3354 ms.
Refiners :[Domain max(s): 1503/1503 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1503/1503 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1315/1503 variables, 121/309 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1503 variables, 1315/1624 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-30 15:15:48] [INFO ] Deduced a trap composed of 46 places in 381 ms of which 56 ms to minimize.
[2024-05-30 15:15:48] [INFO ] Deduced a trap composed of 34 places in 304 ms of which 6 ms to minimize.
[2024-05-30 15:15:49] [INFO ] Deduced a trap composed of 30 places in 356 ms of which 17 ms to minimize.
[2024-05-30 15:15:49] [INFO ] Deduced a trap composed of 29 places in 377 ms of which 5 ms to minimize.
[2024-05-30 15:15:50] [INFO ] Deduced a trap composed of 26 places in 357 ms of which 5 ms to minimize.
[2024-05-30 15:15:50] [INFO ] Deduced a trap composed of 28 places in 398 ms of which 5 ms to minimize.
[2024-05-30 15:15:50] [INFO ] Deduced a trap composed of 28 places in 404 ms of which 49 ms to minimize.
[2024-05-30 15:15:51] [INFO ] Deduced a trap composed of 34 places in 336 ms of which 5 ms to minimize.
[2024-05-30 15:15:51] [INFO ] Deduced a trap composed of 44 places in 300 ms of which 4 ms to minimize.
[2024-05-30 15:15:52] [INFO ] Deduced a trap composed of 60 places in 394 ms of which 18 ms to minimize.
[2024-05-30 15:15:52] [INFO ] Deduced a trap composed of 38 places in 315 ms of which 4 ms to minimize.
[2024-05-30 15:15:52] [INFO ] Deduced a trap composed of 47 places in 260 ms of which 4 ms to minimize.
SMT process timed out in 8693ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 188 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 1503 transition count 1197
Reduce places removed 306 places and 0 transitions.
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Iterating post reduction 1 with 373 rules applied. Total rules applied 679 place count 1197 transition count 1130
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 2 with 67 rules applied. Total rules applied 746 place count 1130 transition count 1130
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 116 Pre rules applied. Total rules applied 746 place count 1130 transition count 1014
Deduced a syphon composed of 116 places in 4 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 978 place count 1014 transition count 1014
Discarding 158 places :
Symmetric choice reduction at 3 with 158 rule applications. Total rules 1136 place count 856 transition count 856
Iterating global reduction 3 with 158 rules applied. Total rules applied 1294 place count 856 transition count 856
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 1294 place count 856 transition count 798
Deduced a syphon composed of 58 places in 3 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1410 place count 798 transition count 798
Performed 220 Post agglomeration using F-continuation condition.Transition count delta: 220
Deduced a syphon composed of 220 places in 2 ms
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 3 with 440 rules applied. Total rules applied 1850 place count 578 transition count 578
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 1954 place count 526 transition count 606
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1955 place count 526 transition count 605
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1961 place count 526 transition count 599
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1967 place count 520 transition count 599
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 1968 place count 520 transition count 598
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1969 place count 520 transition count 598
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1971 place count 520 transition count 598
Applied a total of 1971 rules in 553 ms. Remains 520 /1503 variables (removed 983) and now considering 598/1503 (removed 905) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 569 ms. Remains : 520/1503 places, 598/1503 transitions.
RANDOM walk for 40000 steps (16 resets) in 1360 ms. (29 steps per ms) remains 9/12 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 8/9 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
// Phase 1: matrix 598 rows 520 cols
[2024-05-30 15:15:54] [INFO ] Computed 121 invariants in 3 ms
[2024-05-30 15:15:54] [INFO ] State equation strengthened by 124 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 384/520 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 598/1118 variables, 520/641 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1118 variables, 124/765 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1118 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/1118 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1118/1118 variables, and 765 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1060 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 520/520 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 384/520 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 15:15:55] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 2 ms to minimize.
[2024-05-30 15:15:55] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-30 15:15:56] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-30 15:15:56] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-05-30 15:15:56] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-30 15:15:56] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-30 15:15:56] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2024-05-30 15:15:56] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-30 15:15:56] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-30 15:15:56] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-05-30 15:15:56] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-05-30 15:15:57] [INFO ] Deduced a trap composed of 19 places in 944 ms of which 1 ms to minimize.
[2024-05-30 15:15:57] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-30 15:15:57] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-30 15:15:58] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-30 15:15:58] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-30 15:15:58] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-30 15:15:58] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-30 15:15:58] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-30 15:15:58] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 15:15:58] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-30 15:15:58] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 5 ms to minimize.
[2024-05-30 15:15:58] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-30 15:15:58] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-30 15:15:58] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 15:15:58] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-30 15:15:59] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 1 ms to minimize.
[2024-05-30 15:15:59] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
[2024-05-30 15:15:59] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 15:15:59] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-30 15:15:59] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-05-30 15:15:59] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 15:15:59] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-05-30 15:15:59] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-30 15:15:59] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-30 15:15:59] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-30 15:16:00] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-30 15:16:00] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-30 15:16:00] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 15:16:00] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-30 15:16:00] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-30 15:16:00] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 598/1118 variables, 520/683 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1118 variables, 124/807 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1118 variables, 8/815 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 15:16:01] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-30 15:16:01] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 12 ms to minimize.
[2024-05-30 15:16:01] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-05-30 15:16:01] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-30 15:16:01] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-30 15:16:01] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-30 15:16:02] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1118 variables, 7/822 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1118 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/1118 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1118/1118 variables, and 822 constraints, problems are : Problem set: 0 solved, 8 unsolved in 7951 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 520/520 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 49/49 constraints]
After SMT, in 9132ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1812 ms.
Support contains 136 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 598/598 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 520 transition count 588
Reduce places removed 10 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 18 rules applied. Total rules applied 28 place count 510 transition count 580
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 36 place count 502 transition count 580
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 36 place count 502 transition count 568
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 60 place count 490 transition count 568
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 489 transition count 567
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 489 transition count 567
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 134 place count 453 transition count 531
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 148 place count 446 transition count 538
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 150 place count 446 transition count 536
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 152 place count 444 transition count 536
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 444 transition count 535
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 444 transition count 535
Applied a total of 154 rules in 83 ms. Remains 444 /520 variables (removed 76) and now considering 535/598 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 444/520 places, 535/598 transitions.
RANDOM walk for 40000 steps (16 resets) in 493 ms. (80 steps per ms) remains 7/8 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 466 ms. (85 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
// Phase 1: matrix 535 rows 444 cols
[2024-05-30 15:16:06] [INFO ] Computed 121 invariants in 17 ms
[2024-05-30 15:16:06] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 309/444 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 535/979 variables, 444/565 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/979 variables, 147/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/979 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/979 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 979/979 variables, and 712 constraints, problems are : Problem set: 0 solved, 7 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 444/444 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 309/444 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-30 15:16:07] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-30 15:16:07] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-30 15:16:07] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-30 15:16:07] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-30 15:16:07] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-30 15:16:07] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-30 15:16:07] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-30 15:16:07] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-30 15:16:07] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-30 15:16:07] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-30 15:16:07] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-30 15:16:07] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-30 15:16:08] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 15:16:08] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-30 15:16:08] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-30 15:16:08] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-30 15:16:08] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-30 15:16:08] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-30 15:16:08] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 19/140 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-30 15:16:08] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-30 15:16:08] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-30 15:16:08] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 535/979 variables, 444/587 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/979 variables, 147/734 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 7/741 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-30 15:16:09] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/979 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/979 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/979 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 979/979 variables, and 742 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3728 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 444/444 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 23/23 constraints]
After SMT, in 4518ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 6115 ms.
Support contains 135 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 535/535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 444 transition count 534
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 443 transition count 534
Applied a total of 2 rules in 19 ms. Remains 443 /444 variables (removed 1) and now considering 534/535 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 443/444 places, 534/535 transitions.
RANDOM walk for 40000 steps (19 resets) in 290 ms. (137 steps per ms) remains 6/7 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (9 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 186 ms. (213 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
// Phase 1: matrix 534 rows 443 cols
[2024-05-30 15:16:17] [INFO ] Computed 121 invariants in 5 ms
[2024-05-30 15:16:17] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 310/443 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 534/977 variables, 443/564 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/977 variables, 147/711 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/977 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/977 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 977/977 variables, and 711 constraints, problems are : Problem set: 0 solved, 6 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 443/443 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 310/443 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:16:18] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-30 15:16:18] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-30 15:16:18] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-30 15:16:18] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-30 15:16:18] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-30 15:16:18] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-30 15:16:18] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-30 15:16:18] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-30 15:16:18] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-30 15:16:18] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-30 15:16:18] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-30 15:16:18] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-30 15:16:18] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-30 15:16:19] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-30 15:16:19] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-30 15:16:19] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 16/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:16:19] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-30 15:16:19] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:16:19] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-30 15:16:19] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-30 15:16:19] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 534/977 variables, 443/585 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/977 variables, 147/732 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/977 variables, 6/738 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:16:20] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-30 15:16:20] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-30 15:16:20] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-30 15:16:21] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-30 15:16:21] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/977 variables, 5/743 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/977 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/977 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 977/977 variables, and 743 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4395 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 443/443 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 26/26 constraints]
After SMT, in 5038ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2575 ms.
Support contains 133 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 534/534 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 442 transition count 533
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 440 transition count 531
Applied a total of 6 rules in 16 ms. Remains 440 /443 variables (removed 3) and now considering 531/534 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 440/443 places, 531/534 transitions.
RANDOM walk for 40000 steps (17 resets) in 283 ms. (140 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 191004 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 6
Probabilistic random walk after 191004 steps, saw 118524 distinct states, run finished after 3005 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 531 rows 440 cols
[2024-05-30 15:16:28] [INFO ] Computed 121 invariants in 1 ms
[2024-05-30 15:16:28] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 307/440 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 531/971 variables, 440/561 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/971 variables, 147/708 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/971 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/971 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 971/971 variables, and 708 constraints, problems are : Problem set: 0 solved, 6 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 440/440 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 307/440 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:16:29] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-05-30 15:16:29] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-30 15:16:29] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-30 15:16:29] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-30 15:16:29] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-30 15:16:29] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-30 15:16:29] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-30 15:16:29] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-30 15:16:29] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-30 15:16:29] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-30 15:16:29] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-30 15:16:30] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-30 15:16:30] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 2 ms to minimize.
[2024-05-30 15:16:30] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-30 15:16:30] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-05-30 15:16:30] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-30 15:16:30] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-30 15:16:30] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-30 15:16:30] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-30 15:16:30] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:16:30] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-30 15:16:30] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-30 15:16:30] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-30 15:16:30] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-30 15:16:30] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 531/971 variables, 440/586 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/971 variables, 147/733 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/971 variables, 6/739 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 15:16:31] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-30 15:16:32] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-30 15:16:32] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-30 15:16:32] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-30 15:16:32] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-30 15:16:32] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-30 15:16:32] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/971 variables, 7/746 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/971 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/971 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 971/971 variables, and 746 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4670 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 440/440 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 32/32 constraints]
After SMT, in 5341ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3900 ms.
Support contains 133 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 531/531 transitions.
Applied a total of 0 rules in 8 ms. Remains 440 /440 variables (removed 0) and now considering 531/531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 440/440 places, 531/531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 531/531 transitions.
Applied a total of 0 rules in 8 ms. Remains 440 /440 variables (removed 0) and now considering 531/531 (removed 0) transitions.
[2024-05-30 15:16:37] [INFO ] Invariant cache hit.
[2024-05-30 15:16:37] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-30 15:16:37] [INFO ] Invariant cache hit.
[2024-05-30 15:16:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 15:16:38] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
[2024-05-30 15:16:38] [INFO ] Redundant transitions in 29 ms returned []
Running 530 sub problems to find dead transitions.
[2024-05-30 15:16:38] [INFO ] Invariant cache hit.
[2024-05-30 15:16:38] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (OVERLAPS) 1/440 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 530 unsolved
[2024-05-30 15:16:45] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 3 ms to minimize.
[2024-05-30 15:16:45] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-05-30 15:16:46] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-30 15:16:46] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-30 15:16:46] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 2 ms to minimize.
[2024-05-30 15:16:47] [INFO ] Deduced a trap composed of 9 places in 551 ms of which 2 ms to minimize.
[2024-05-30 15:16:47] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2024-05-30 15:16:47] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-05-30 15:16:47] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-30 15:16:47] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 15:16:47] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-30 15:16:48] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-30 15:16:48] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-30 15:16:48] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-30 15:16:48] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-30 15:16:48] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 15:16:48] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-30 15:16:48] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-30 15:16:49] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-30 15:16:49] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 530 unsolved
[2024-05-30 15:16:50] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 15:16:51] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-30 15:16:51] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-30 15:16:51] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-30 15:16:51] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-30 15:16:51] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-30 15:16:51] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-30 15:16:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-30 15:16:53] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 9/150 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 5 (OVERLAPS) 531/971 variables, 440/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/971 variables, 147/737 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 971/971 variables, and 737 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 440/440 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 530 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (OVERLAPS) 1/440 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 29/150 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (OVERLAPS) 531/971 variables, 440/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/971 variables, 147/737 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/971 variables, 530/1267 constraints. Problems are: Problem set: 0 solved, 530 unsolved
[2024-05-30 15:17:23] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-30 15:17:23] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-30 15:17:24] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 2 ms to minimize.
[2024-05-30 15:17:24] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
[2024-05-30 15:17:28] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-30 15:17:28] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-30 15:17:29] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 3 ms to minimize.
[2024-05-30 15:17:29] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-30 15:17:29] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-30 15:17:30] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-30 15:17:32] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-30 15:17:32] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2024-05-30 15:17:32] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-30 15:17:36] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/971 variables, 14/1281 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 971/971 variables, and 1281 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 440/440 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 43/43 constraints]
After SMT, in 60232ms problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61100 ms. Remains : 440/440 places, 531/531 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 48 edges and 440 vertex of which 2 / 440 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 439 transition count 513
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 30 place count 439 transition count 513
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 439 transition count 507
Applied a total of 36 rules in 62 ms. Remains 439 /440 variables (removed 1) and now considering 507/531 (removed 24) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 507 rows 439 cols
[2024-05-30 15:17:38] [INFO ] Computed 121 invariants in 4 ms
[2024-05-30 15:17:39] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-30 15:17:39] [INFO ] [Nat]Absence check using 121 positive place invariants in 22 ms returned sat
[2024-05-30 15:17:39] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-30 15:17:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-30 15:17:39] [INFO ] After 278ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-30 15:17:39] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-30 15:17:40] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-05-30 15:17:40] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-30 15:17:40] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-30 15:17:40] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-30 15:17:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 444 ms
[2024-05-30 15:17:40] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-30 15:17:40] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-30 15:17:40] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-30 15:17:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 192 ms
[2024-05-30 15:17:40] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2024-05-30 15:17:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-30 15:17:40] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-30 15:17:40] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-30 15:17:41] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-30 15:17:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 232 ms
[2024-05-30 15:17:41] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-30 15:17:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
TRAPS : Iteration 1
[2024-05-30 15:17:41] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-30 15:17:41] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-30 15:17:41] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-30 15:17:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 232 ms
[2024-05-30 15:17:41] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-30 15:17:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-30 15:17:41] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-30 15:17:41] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-30 15:17:41] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-30 15:17:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 266 ms
TRAPS : Iteration 2
[2024-05-30 15:17:42] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-30 15:17:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2024-05-30 15:17:42] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-30 15:17:42] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-30 15:17:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
TRAPS : Iteration 3
[2024-05-30 15:17:42] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 7 ms to minimize.
[2024-05-30 15:17:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-05-30 15:17:42] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-30 15:17:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2024-05-30 15:17:43] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-30 15:17:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
TRAPS : Iteration 4
[2024-05-30 15:17:43] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-30 15:17:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
TRAPS : Iteration 5
[2024-05-30 15:17:43] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 15:17:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
TRAPS : Iteration 6
[2024-05-30 15:17:44] [INFO ] After 4880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-30 15:17:44] [INFO ] After 5647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2024-05-30 15:17:44] [INFO ] Flatten gal took : 29 ms
[2024-05-30 15:17:44] [INFO ] Flatten gal took : 28 ms
[2024-05-30 15:17:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16972357257110077775.gal : 4 ms
[2024-05-30 15:17:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11887822901873654714.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16972357257110077775.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11887822901873654714.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11887822901873654714.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 27
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :27 after 762
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :762 after 21174
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :21174 after 1.70699e+08
Detected timeout of ITS tools.
[2024-05-30 15:17:59] [INFO ] Flatten gal took : 25 ms
[2024-05-30 15:17:59] [INFO ] Applying decomposition
[2024-05-30 15:17:59] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6390523817940039289.txt' '-o' '/tmp/graph6390523817940039289.bin' '-w' '/tmp/graph6390523817940039289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6390523817940039289.bin' '-l' '-1' '-v' '-w' '/tmp/graph6390523817940039289.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:18:00] [INFO ] Decomposing Gal with order
[2024-05-30 15:18:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:18:00] [INFO ] Removed a total of 345 redundant transitions.
[2024-05-30 15:18:00] [INFO ] Flatten gal took : 76 ms
[2024-05-30 15:18:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 40 ms.
[2024-05-30 15:18:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3217710792661283531.gal : 12 ms
[2024-05-30 15:18:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3100293479273048245.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3217710792661283531.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3100293479273048245.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality3100293479273048245.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 377
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :106497 after 9.11206e+06
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :9.11206e+06 after 4.18468e+10
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :4.18468e+10 after 9.18384e+18
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.8461e+58,14.4883,416828,1472,47,684863,490,1480,2.74031e+06,102,1888,0
Total reachable state count : 3.846099533063377114724196178280802274087e+58

Verifying 6 reachability properties.
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-2024-01 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-030B-ReachabilityFireability-2024-01,2.58453e+51,14.5471,416828,299,30,684863,490,1502,2.74031e+06,109,1888,888
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-2024-05 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-030B-ReachabilityFireability-2024-05,1.43679e+51,14.569,416828,720,35,684863,490,1593,2.74031e+06,111,1888,4406
Invariant property ShieldRVt-PT-030B-ReachabilityFireability-2024-06 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-030B-ReachabilityFireability-2024-06,7.92608e+53,14.5696,416828,529,33,684863,490,1596,2.74031e+06,111,1888,4406
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-2024-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-030B-ReachabilityFireability-2024-07,1.23833e+52,14.585,416828,412,31,684863,490,1660,2.74031e+06,112,1888,6860
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-2024-08 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-030B-ReachabilityFireability-2024-08,3.65714e+49,14.5854,416828,268,28,684863,490,1660,2.74031e+06,112,1888,6860
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-2024-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-030B-ReachabilityFireability-2024-09,1.92817e+52,14.59,416828,291,31,684863,490,1690,2.74031e+06,113,1888,7794
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 36133 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 15:18:15] [INFO ] Flatten gal took : 38 ms
[2024-05-30 15:18:15] [INFO ] Applying decomposition
[2024-05-30 15:18:15] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11533070693128461779.txt' '-o' '/tmp/graph11533070693128461779.bin' '-w' '/tmp/graph11533070693128461779.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11533070693128461779.bin' '-l' '-1' '-v' '-w' '/tmp/graph11533070693128461779.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:18:15] [INFO ] Decomposing Gal with order
[2024-05-30 15:18:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:18:15] [INFO ] Removed a total of 180 redundant transitions.
[2024-05-30 15:18:15] [INFO ] Flatten gal took : 78 ms
[2024-05-30 15:18:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-30 15:18:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4888402657212920518.gal : 17 ms
[2024-05-30 15:18:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17730513963578624702.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4888402657212920518.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17730513963578624702.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17730513963578624702.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 213
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :213 after 326251
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :326251 after 3.33067e+14
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-2024-08 is true.
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-2024-07 is true.
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldRVt-PT-030B-ReachabilityFireability-2024-06 does not hold.
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-2024-05 is true.
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3.42862e+80 after 4.07695e+80
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :4.07695e+80 after 4.07695e+80
Detected timeout of ITS tools.
[2024-05-30 15:48:15] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9993989069182257186
[2024-05-30 15:48:15] [INFO ] Applying decomposition
[2024-05-30 15:48:15] [INFO ] Computing symmetric may disable matrix : 531 transitions.
[2024-05-30 15:48:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 15:48:15] [INFO ] Computing symmetric may enable matrix : 531 transitions.
[2024-05-30 15:48:15] [INFO ] Flatten gal took : 17 ms
[2024-05-30 15:48:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10495213316904587763.txt' '-o' '/tmp/graph10495213316904587763.bin' '-w' '/tmp/graph10495213316904587763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10495213316904587763.bin' '-l' '-1' '-v' '-w' '/tmp/graph10495213316904587763.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:48:15] [INFO ] Decomposing Gal with order
[2024-05-30 15:48:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:48:15] [INFO ] Computing Do-Not-Accords matrix : 531 transitions.
[2024-05-30 15:48:15] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 15:48:15] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9993989069182257186
Running compilation step : cd /tmp/ltsmin9993989069182257186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-30 15:48:15] [INFO ] Removed a total of 456 redundant transitions.
[2024-05-30 15:48:16] [INFO ] Flatten gal took : 43 ms
[2024-05-30 15:48:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 200 labels/synchronizations in 38 ms.
[2024-05-30 15:48:16] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10290202765848832538.gal : 6 ms
[2024-05-30 15:48:16] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7234369647685338981.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10290202765848832538.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7234369647685338981.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability7234369647685338981.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 19
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :19 after 399
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :399 after 1.89339e+07
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.89339e+07 after 4.43857e+12
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4.43857e+12 after 8.94813e+15
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-2024-01 is true.
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8.94813e+15 after 3.32828e+44
Compilation finished in 1474 ms.
Running link step : cd /tmp/ltsmin9993989069182257186;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin9993989069182257186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVtPT030BReachabilityFireability202409==true'
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-2024-09 is true.
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.44366e+53,21.5677,452660,3187,163,677683,1249,1106,3.50484e+06,177,7593,0
Total reachable state count : 3.443656474591615941057186226499326951281e+53

Verifying 2 reachability properties.
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-2024-01 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-030B-ReachabilityFireability-2024-01,4.76835e+38,21.9912,452660,313,88,677683,1249,1179,3.50484e+06,196,7593,0
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-2024-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-030B-ReachabilityFireability-2024-09,3.05973e+42,22.5729,452660,369,96,677683,1249,1254,3.50484e+06,202,7593,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2003849 ms.

BK_STOP 1717084146168

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ShieldRVt-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldRVt-PT-030B, 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 r356-tall-171683762301007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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