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-171683762000839.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 ShieldRVs-PT-040A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762000839
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 17:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 256K 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 ShieldRVs-PT-040A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717056679025

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-30 08:11:20] [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 08:11:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 08:11:20] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-05-30 08:11:20] [INFO ] Transformed 563 places.
[2024-05-30 08:11:20] [INFO ] Transformed 763 transitions.
[2024-05-30 08:11:20] [INFO ] Found NUPN structural information;
[2024-05-30 08:11:20] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 51 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (72 resets) in 1666 ms. (23 steps per ms) remains 6/16 properties
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 08:11:21] [INFO ] Flatten gal took : 207 ms
BEST_FIRST walk for 40003 steps (8 resets) in 347 ms. (114 steps per ms) remains 6/6 properties
[2024-05-30 08:11:21] [INFO ] Flatten gal took : 147 ms
[2024-05-30 08:11:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5418808397759233713.gal : 75 ms
[2024-05-30 08:11:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9199624360892419729.prop : 2 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/ReachabilityCardinality5418808397759233713.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9199624360892419729.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

BEST_FIRST walk for 40003 steps (8 resets) in 827 ms. (48 steps per ms) remains 6/6 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40003 steps (8 resets) in 246 ms. (161 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality9199624360892419729.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 5/6 properties
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 4/5 properties
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 4/4 properties
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :3 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 19
// Phase 1: matrix 763 rows 563 cols
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :69 after 206
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :206 after 1274
[2024-05-30 08:11:21] [INFO ] Computed 161 invariants in 33 ms
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1274 after 57748
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :57748 after 628365
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :628365 after 6.55089e+06
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :6.55089e+06 after 6.06166e+08
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 226/345 variables, 91/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 226/436 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 218/563 variables, 70/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 218/724 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :6.06166e+08 after 5.72653e+10
At refinement iteration 8 (OVERLAPS) 763/1326 variables, 563/1287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1326 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1326 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 1287 constraints, problems are : Problem set: 0 solved, 4 unsolved in 851 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 226/345 variables, 91/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 226/436 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:11:23] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 9 ms to minimize.
[2024-05-30 08:11:23] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 218/563 variables, 70/508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :5.72653e+10 after 5.56325e+12
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 218/726 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:11:23] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-05-30 08:11:23] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2024-05-30 08:11:23] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-30 08:11:23] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-30 08:11:23] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-05-30 08:11:24] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-05-30 08:11:24] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 08:11:24] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-30 08:11:24] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:11:24] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 10/736 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:11:24] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 763/1326 variables, 563/1300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :5.56325e+12 after 6.0254e+15
At refinement iteration 12 (INCLUDED_ONLY) 0/1326 variables, 4/1304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:11:25] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:11:25] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-30 08:11:25] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-30 08:11:25] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-30 08:11:25] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-30 08:11:25] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 08:11:25] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1326 variables, 7/1311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1326 variables, 9/1320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:11:27] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1326 variables, 1/1321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:11:27] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-30 08:11:27] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-30 08:11:27] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
SMT process timed out in 6046ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 119 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Partial Free-agglomeration rule applied 65 times.
Drop transitions (Partial Free agglomeration) removed 65 transitions
Iterating global reduction 0 with 65 rules applied. Total rules applied 65 place count 563 transition count 763
Applied a total of 65 rules in 142 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 563/563 places, 763/763 transitions.
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :6.0254e+15 after 4.83197e+19
RANDOM walk for 40000 steps (80 resets) in 729 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 3/4 properties
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 2/3 properties
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 763 rows 563 cols
[2024-05-30 08:11:28] [INFO ] Computed 161 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 134/193 variables, 50/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 134/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 370/563 variables, 111/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 370/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 763/1326 variables, 563/1287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1326 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1326 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 1287 constraints, problems are : Problem set: 0 solved, 2 unsolved in 432 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 134/193 variables, 50/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 134/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 370/563 variables, 111/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 370/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 08:11:29] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 8 ms to minimize.
[2024-05-30 08:11:29] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:11:29] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-30 08:11:29] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:11:29] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-30 08:11:29] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-30 08:11:29] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
[2024-05-30 08:11:29] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 8/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 763/1326 variables, 563/1295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1326 variables, 2/1297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 08:11:30] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:11:30] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:11:30] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-30 08:11:30] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-30 08:11:30] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 08:11:30] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2024-05-30 08:11:31] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-30 08:11:31] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-30 08:11:31] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-30 08:11:31] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-30 08:11:31] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-05-30 08:11:31] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1326 variables, 12/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1326 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1326 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 1309 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3230 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 20/20 constraints]
After SMT, in 3746ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1880 ms.
Support contains 59 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 562 transition count 762
Applied a total of 10 rules in 106 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 562/563 places, 762/763 transitions.
RANDOM walk for 40000 steps (81 resets) in 298 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/2 properties
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 762 rows 562 cols
[2024-05-30 08:11:34] [INFO ] Computed 161 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/189 variables, 49/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 131/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/562 variables, 112/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 373/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 762/1324 variables, 562/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1324 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1324 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 1285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/189 variables, 49/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 131/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/562 variables, 112/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 373/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 08:11:35] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-30 08:11:35] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-30 08:11:35] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 9 ms to minimize.
[2024-05-30 08:11:35] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-30 08:11:35] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-30 08:11:35] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-30 08:11:35] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2024-05-30 08:11:35] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :4.83197e+19 after 3.74193e+26
[2024-05-30 08:11:35] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-30 08:11:35] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-30 08:11:35] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 11/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 762/1324 variables, 562/1296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1324 variables, 1/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 08:11:36] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2024-05-30 08:11:36] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-30 08:11:36] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-30 08:11:36] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-30 08:11:36] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:11:37] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-30 08:11:37] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:11:37] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-30 08:11:37] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:11:37] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-30 08:11:37] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-30 08:11:37] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-30 08:11:37] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-30 08:11:37] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1324 variables, 14/1311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 08:11:37] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:11:38] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-30 08:11:38] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-30 08:11:38] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-30 08:11:38] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:11:38] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-30 08:11:38] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-05-30 08:11:38] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:11:38] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-30 08:11:38] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-30 08:11:38] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-30 08:11:39] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-30 08:11:39] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-30 08:11:39] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1324 variables, 14/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1324 variables, 0/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1324 variables, 0/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 1325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4693 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 39/39 constraints]
After SMT, in 5051ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 305 ms.
Support contains 58 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 562 transition count 762
Applied a total of 1 rules in 52 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 562/562 places, 762/762 transitions.
RANDOM walk for 40000 steps (81 resets) in 305 ms. (130 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 286283 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 1
Probabilistic random walk after 286283 steps, saw 66129 distinct states, run finished after 3004 ms. (steps per millisecond=95 ) properties seen :0
// Phase 1: matrix 762 rows 562 cols
[2024-05-30 08:11:43] [INFO ] Computed 161 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/189 variables, 49/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 131/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/562 variables, 112/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 373/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 762/1324 variables, 562/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1324 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1324 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 1285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 343 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/189 variables, 49/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 131/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/562 variables, 112/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 373/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 08:11:43] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-30 08:11:43] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-05-30 08:11:43] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-30 08:11:43] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-30 08:11:43] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:11:44] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-30 08:11:44] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2024-05-30 08:11:44] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 08:11:44] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 08:11:44] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 08:11:44] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 11/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 762/1324 variables, 562/1296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1324 variables, 1/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 08:11:44] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-30 08:11:45] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2024-05-30 08:11:45] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-30 08:11:45] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:11:45] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2024-05-30 08:11:45] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:11:45] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-30 08:11:45] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-30 08:11:45] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2024-05-30 08:11:45] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-30 08:11:45] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:11:46] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-30 08:11:46] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1324 variables, 13/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1324 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1324 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2988 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 constraints]
After SMT, in 3366ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 366 ms.
Support contains 58 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 29 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 562/562 places, 762/762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 26 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-05-30 08:11:46] [INFO ] Invariant cache hit.
[2024-05-30 08:11:47] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-30 08:11:47] [INFO ] Invariant cache hit.
[2024-05-30 08:11:47] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 968 ms to find 0 implicit places.
[2024-05-30 08:11:47] [INFO ] Redundant transitions in 122 ms returned []
Running 761 sub problems to find dead transitions.
[2024-05-30 08:11:48] [INFO ] Invariant cache hit.
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :3.74193e+26 after 2.73959e+40
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 2 (OVERLAPS) 1/562 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-05-30 08:12:06] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 3 ms to minimize.
[2024-05-30 08:12:06] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-05-30 08:12:06] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 3 ms to minimize.
[2024-05-30 08:12:06] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-05-30 08:12:07] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-05-30 08:12:07] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-05-30 08:12:07] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-05-30 08:12:07] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 3 ms to minimize.
[2024-05-30 08:12:07] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 2 ms to minimize.
[2024-05-30 08:12:07] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2024-05-30 08:12:07] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 3 ms to minimize.
[2024-05-30 08:12:08] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-05-30 08:12:08] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
[2024-05-30 08:12:08] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
[2024-05-30 08:12:08] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 3 ms to minimize.
[2024-05-30 08:12:08] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 2 ms to minimize.
[2024-05-30 08:12:08] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 3 ms to minimize.
[2024-05-30 08:12:09] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 2 ms to minimize.
[2024-05-30 08:12:09] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 2 ms to minimize.
[2024-05-30 08:12:09] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/743 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-05-30 08:12:09] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 2 ms to minimize.
[2024-05-30 08:12:09] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 3 ms to minimize.
[2024-05-30 08:12:10] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 2 ms to minimize.
[2024-05-30 08:12:10] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-05-30 08:12:10] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 2 ms to minimize.
[2024-05-30 08:12:10] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 3 ms to minimize.
[2024-05-30 08:12:10] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 3 ms to minimize.
[2024-05-30 08:12:10] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-05-30 08:12:11] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 2 ms to minimize.
[2024-05-30 08:12:11] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 2 ms to minimize.
[2024-05-30 08:12:11] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 3 ms to minimize.
[2024-05-30 08:12:11] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2024-05-30 08:12:11] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-05-30 08:12:11] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 2 ms to minimize.
[2024-05-30 08:12:11] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 3 ms to minimize.
[2024-05-30 08:12:12] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
[2024-05-30 08:12:12] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 3 ms to minimize.
[2024-05-30 08:12:12] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-05-30 08:12:12] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 4 ms to minimize.
[2024-05-30 08:12:12] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/763 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-05-30 08:12:13] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 3 ms to minimize.
[2024-05-30 08:12:13] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 3 ms to minimize.
[2024-05-30 08:12:13] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-05-30 08:12:13] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-05-30 08:12:13] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-05-30 08:12:13] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 2 ms to minimize.
[2024-05-30 08:12:13] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 08:12:14] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:12:14] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-05-30 08:12:14] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:12:14] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-30 08:12:14] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-30 08:12:14] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 08:12:14] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 08:12:14] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-30 08:12:14] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-30 08:12:14] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:12:14] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 08:12:14] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-30 08:12:14] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/783 constraints. Problems are: Problem set: 0 solved, 761 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/1324 variables, and 783 constraints, problems are : Problem set: 0 solved, 761 unsolved in 30063 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 761/761 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 761 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 2 (OVERLAPS) 1/562 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 60/783 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-05-30 08:12:25] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-05-30 08:12:25] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-30 08:12:25] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 08:12:25] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-05-30 08:12:26] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-30 08:12:26] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 2 ms to minimize.
[2024-05-30 08:12:26] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 2 ms to minimize.
[2024-05-30 08:12:26] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 2 ms to minimize.
[2024-05-30 08:12:26] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-30 08:12:26] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-30 08:12:26] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-30 08:12:26] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 2 ms to minimize.
[2024-05-30 08:12:27] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 2 ms to minimize.
[2024-05-30 08:12:27] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-05-30 08:12:27] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 3 ms to minimize.
[2024-05-30 08:12:27] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 2 ms to minimize.
[2024-05-30 08:12:27] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-05-30 08:12:28] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 2 ms to minimize.
[2024-05-30 08:12:28] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 4 ms to minimize.
[2024-05-30 08:12:28] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/803 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-05-30 08:12:29] [INFO ] Deduced a trap composed of 7 places in 524 ms of which 1 ms to minimize.
[2024-05-30 08:12:29] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 1 ms to minimize.
[2024-05-30 08:12:29] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-30 08:12:30] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 7 ms to minimize.
[2024-05-30 08:12:30] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 4 ms to minimize.
[2024-05-30 08:12:30] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 5 ms to minimize.
[2024-05-30 08:12:31] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 2 ms to minimize.
[2024-05-30 08:12:31] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 6 ms to minimize.
[2024-05-30 08:12:31] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 5 ms to minimize.
[2024-05-30 08:12:31] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 4 ms to minimize.
[2024-05-30 08:12:32] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-05-30 08:12:32] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-30 08:12:32] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 2 ms to minimize.
[2024-05-30 08:12:32] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 2 ms to minimize.
[2024-05-30 08:12:32] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2024-05-30 08:12:32] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2024-05-30 08:12:33] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 6 ms to minimize.
[2024-05-30 08:12:33] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 4 ms to minimize.
[2024-05-30 08:12:33] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 5 ms to minimize.
[2024-05-30 08:12:34] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/823 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-05-30 08:12:34] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2024-05-30 08:12:34] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2024-05-30 08:12:34] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2024-05-30 08:12:34] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:12:35] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2024-05-30 08:12:35] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-30 08:12:35] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-30 08:12:35] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-30 08:12:35] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-30 08:12:35] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2024-05-30 08:12:35] [INFO ] Deduced a trap composed of 7 places in 431 ms of which 36 ms to minimize.
[2024-05-30 08:12:37] [INFO ] Deduced a trap composed of 11 places in 1047 ms of which 32 ms to minimize.
[2024-05-30 08:12:37] [INFO ] Deduced a trap composed of 12 places in 364 ms of which 1 ms to minimize.
[2024-05-30 08:12:37] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-30 08:12:37] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:12:37] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
[2024-05-30 08:12:37] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-30 08:12:38] [INFO ] Deduced a trap composed of 7 places in 212 ms of which 6 ms to minimize.
[2024-05-30 08:12:38] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 3 ms to minimize.
[2024-05-30 08:12:38] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 20/843 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-05-30 08:12:39] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2024-05-30 08:12:39] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-05-30 08:12:39] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2024-05-30 08:12:39] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-05-30 08:12:39] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2024-05-30 08:12:39] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-30 08:12:39] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-30 08:12:40] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-30 08:12:40] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-30 08:12:40] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-05-30 08:12:40] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-30 08:12:40] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 08:12:40] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-05-30 08:12:40] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-05-30 08:12:40] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 08:12:41] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-30 08:12:41] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 2 ms to minimize.
[2024-05-30 08:12:41] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-30 08:12:41] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-30 08:12:41] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 20/863 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-05-30 08:12:42] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-30 08:12:42] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-05-30 08:12:42] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-30 08:12:42] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2024-05-30 08:12:43] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-05-30 08:12:43] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2024-05-30 08:12:43] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-30 08:12:43] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2024-05-30 08:12:43] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2024-05-30 08:12:43] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 2 ms to minimize.
[2024-05-30 08:12:43] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-30 08:12:43] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 3 ms to minimize.
[2024-05-30 08:12:44] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-30 08:12:44] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-05-30 08:12:44] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-05-30 08:12:44] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-30 08:12:44] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-30 08:12:44] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2024-05-30 08:12:44] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 2 ms to minimize.
[2024-05-30 08:12:44] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 20/883 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-05-30 08:12:45] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-30 08:12:45] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-30 08:12:45] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-30 08:12:45] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-30 08:12:45] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:12:45] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-30 08:12:46] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:12:46] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-30 08:12:46] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-30 08:12:46] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-30 08:12:46] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2024-05-30 08:12:46] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-05-30 08:12:47] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-30 08:12:47] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-30 08:12:47] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-30 08:12:47] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-05-30 08:12:47] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-30 08:12:47] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-30 08:12:47] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-05-30 08:12:47] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 20/903 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-05-30 08:12:48] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
SMT process timed out in 60524ms, After SMT, problems are : Problem set: 0 solved, 761 unsolved
Search for dead transitions found 0 dead transitions in 60543ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61676 ms. Remains : 562/562 places, 762/762 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 08:12:48] [INFO ] Flatten gal took : 60 ms
[2024-05-30 08:12:48] [INFO ] Applying decomposition
[2024-05-30 08:12:48] [INFO ] Flatten gal took : 50 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/graph2934006776112713713.txt' '-o' '/tmp/graph2934006776112713713.bin' '-w' '/tmp/graph2934006776112713713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2934006776112713713.bin' '-l' '-1' '-v' '-w' '/tmp/graph2934006776112713713.weights' '-q' '0' '-e' '0.001'
[2024-05-30 08:12:48] [INFO ] Decomposing Gal with order
[2024-05-30 08:12:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 08:12:49] [INFO ] Removed a total of 837 redundant transitions.
[2024-05-30 08:12:49] [INFO ] Flatten gal took : 128 ms
[2024-05-30 08:12:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 900 labels/synchronizations in 58 ms.
[2024-05-30 08:12:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12519394158377262690.gal : 13 ms
[2024-05-30 08:12:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4882417403104513499.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/ReachabilityCardinality12519394158377262690.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4882417403104513499.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/ReachabilityCardinality4882417403104513499.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 38
ITS-tools command line returned an error code 137
[2024-05-30 08:24:20] [INFO ] Flatten gal took : 58 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11934679014455882446
[2024-05-30 08:24:20] [INFO ] Applying decomposition
[2024-05-30 08:24:20] [INFO ] Computing symmetric may disable matrix : 762 transitions.
[2024-05-30 08:24:20] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:24:20] [INFO ] Computing symmetric may enable matrix : 762 transitions.
[2024-05-30 08:24:20] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:24:20] [INFO ] Flatten gal took : 39 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/graph1743075586393583510.txt' '-o' '/tmp/graph1743075586393583510.bin' '-w' '/tmp/graph1743075586393583510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1743075586393583510.bin' '-l' '-1' '-v' '-w' '/tmp/graph1743075586393583510.weights' '-q' '0' '-e' '0.001'
[2024-05-30 08:24:20] [INFO ] Decomposing Gal with order
[2024-05-30 08:24:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 08:24:21] [INFO ] Computing Do-Not-Accords matrix : 762 transitions.
[2024-05-30 08:24:21] [INFO ] Removed a total of 879 redundant transitions.
[2024-05-30 08:24:21] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:24:21] [INFO ] Flatten gal took : 56 ms
[2024-05-30 08:24:21] [INFO ] Built C files in 296ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11934679014455882446
Running compilation step : cd /tmp/ltsmin11934679014455882446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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 08:24:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 908 labels/synchronizations in 20 ms.
[2024-05-30 08:24:21] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9513806624188466373.gal : 8 ms
[2024-05-30 08:24:21] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14534433342720927960.prop : 2 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/ReachabilityFireability9513806624188466373.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14534433342720927960.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/ReachabilityFireability14534433342720927960.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 8
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :8 after 1105
Reachability property ShieldRVs-PT-040A-ReachabilityFireability-2024-03 is true.
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-2024-03 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 65 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,2.21438e+41,1.20961,44948,2541,108,68072,527,584,254583,76,5349,0
Total reachable state count : 2.214382711743226904037613489692568463606e+41

Verifying 1 reachability properties.
Reachability property ShieldRVs-PT-040A-ReachabilityFireability-2024-03 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
ShieldRVs-PT-040A-ReachabilityFireability-2024-03,9.49114e+34,1.35331,45208,1647,105,68072,527,921,254583,90,5349,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 782418 ms.

BK_STOP 1717057462763

--------------------
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="ShieldRVs-PT-040A"
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 ShieldRVs-PT-040A, 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-171683762000839"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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