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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.3K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 20:55 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 652K 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-100A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717070005117

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-30 11:53:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 11:53:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 11:53:26] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2024-05-30 11:53:26] [INFO ] Transformed 1403 places.
[2024-05-30 11:53:26] [INFO ] Transformed 1903 transitions.
[2024-05-30 11:53:26] [INFO ] Found NUPN structural information;
[2024-05-30 11:53:26] [INFO ] Parsed PT model containing 1403 places and 1903 transitions and 9200 arcs in 295 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (28 resets) in 2136 ms. (18 steps per ms) remains 3/14 properties
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 1192 ms. (33 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1161 ms. (34 steps per ms) remains 3/3 properties
[2024-05-30 11:53:28] [INFO ] Flatten gal took : 1010 ms
BEST_FIRST walk for 40003 steps (8 resets) in 1090 ms. (36 steps per ms) remains 3/3 properties
[2024-05-30 11:53:28] [INFO ] Flatten gal took : 332 ms
// Phase 1: matrix 1903 rows 1403 cols
[2024-05-30 11:53:29] [INFO ] Computed 401 invariants in 104 ms
[2024-05-30 11:53:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3405642859183180898.gal : 205 ms
[2024-05-30 11:53:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5303455615430565612.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3405642859183180898.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5303455615430565612.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5303455615430565612.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 189/263 variables, 69/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 189/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1140/1403 variables, 332/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1403 variables, 1140/1804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1403 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1903/3306 variables, 1403/3207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3306 variables, 0/3207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/3306 variables, 0/3207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3306/3306 variables, and 3207 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2385 ms.
Refiners :[Domain max(s): 1403/1403 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1403/1403 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :69 after 134
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :134 after 406
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :406 after 8428
At refinement iteration 2 (OVERLAPS) 189/263 variables, 69/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 189/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :8428 after 106163
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :106163 after 6.39147e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :6.39147e+06 after 6.05437e+08
At refinement iteration 5 (OVERLAPS) 1140/1403 variables, 332/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1403 variables, 1140/1804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :6.05437e+08 after 5.72449e+10
[2024-05-30 11:53:32] [INFO ] Deduced a trap composed of 8 places in 373 ms of which 45 ms to minimize.
[2024-05-30 11:53:32] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 4 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :5.72449e+10 after 5.55807e+12
[2024-05-30 11:53:33] [INFO ] Deduced a trap composed of 11 places in 337 ms of which 7 ms to minimize.
[2024-05-30 11:53:33] [INFO ] Deduced a trap composed of 8 places in 477 ms of which 34 ms to minimize.
[2024-05-30 11:53:34] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 7 ms to minimize.
[2024-05-30 11:53:34] [INFO ] Deduced a trap composed of 7 places in 315 ms of which 5 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :5.55807e+12 after 6.02538e+15
[2024-05-30 11:53:35] [INFO ] Deduced a trap composed of 7 places in 1117 ms of which 3 ms to minimize.
[2024-05-30 11:53:35] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 6 ms to minimize.
[2024-05-30 11:53:36] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 3 ms to minimize.
[2024-05-30 11:53:36] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 3 ms to minimize.
[2024-05-30 11:53:36] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 3 ms to minimize.
[2024-05-30 11:53:36] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 3 ms to minimize.
SMT process timed out in 7939ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Partial Free-agglomeration rule applied 181 times.
Drop transitions (Partial Free agglomeration) removed 181 transitions
Iterating global reduction 0 with 181 rules applied. Total rules applied 183 place count 1402 transition count 1902
Applied a total of 183 rules in 589 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 600 ms. Remains : 1402/1403 places, 1902/1903 transitions.
RANDOM walk for 40000 steps (32 resets) in 1283 ms. (31 steps per ms) remains 2/3 properties
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 693 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 586 ms. (68 steps per ms) remains 2/2 properties
// Phase 1: matrix 1902 rows 1402 cols
[2024-05-30 11:53:38] [INFO ] Computed 401 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 149/205 variables, 53/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 149/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1197/1402 variables, 348/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 1197/1803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1902/3304 variables, 1402/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3304/3304 variables, and 3205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1041 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 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/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :6.02538e+15 after 4.82193e+19
At refinement iteration 2 (OVERLAPS) 149/205 variables, 53/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 149/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1197/1402 variables, 348/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 1197/1803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 11:53:40] [INFO ] Deduced a trap composed of 7 places in 507 ms of which 10 ms to minimize.
[2024-05-30 11:53:40] [INFO ] Deduced a trap composed of 7 places in 522 ms of which 4 ms to minimize.
[2024-05-30 11:53:41] [INFO ] Deduced a trap composed of 7 places in 544 ms of which 4 ms to minimize.
[2024-05-30 11:53:42] [INFO ] Deduced a trap composed of 7 places in 505 ms of which 4 ms to minimize.
[2024-05-30 11:53:42] [INFO ] Deduced a trap composed of 7 places in 510 ms of which 3 ms to minimize.
[2024-05-30 11:53:44] [INFO ] Deduced a trap composed of 7 places in 1473 ms of which 4 ms to minimize.
[2024-05-30 11:53:44] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 3 ms to minimize.
[2024-05-30 11:53:44] [INFO ] Deduced a trap composed of 7 places in 296 ms of which 3 ms to minimize.
[2024-05-30 11:53:45] [INFO ] Deduced a trap composed of 7 places in 294 ms of which 4 ms to minimize.
[2024-05-30 11:53:45] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 4 ms to minimize.
[2024-05-30 11:53:45] [INFO ] Deduced a trap composed of 7 places in 329 ms of which 4 ms to minimize.
[2024-05-30 11:53:46] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 4 ms to minimize.
[2024-05-30 11:53:46] [INFO ] Deduced a trap composed of 11 places in 300 ms of which 3 ms to minimize.
[2024-05-30 11:53:46] [INFO ] Deduced a trap composed of 7 places in 303 ms of which 3 ms to minimize.
[2024-05-30 11:53:46] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 3 ms to minimize.
[2024-05-30 11:53:47] [INFO ] Deduced a trap composed of 7 places in 267 ms of which 3 ms to minimize.
[2024-05-30 11:53:47] [INFO ] Deduced a trap composed of 7 places in 309 ms of which 4 ms to minimize.
[2024-05-30 11:53:47] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 3 ms to minimize.
[2024-05-30 11:53:48] [INFO ] Deduced a trap composed of 7 places in 250 ms of which 3 ms to minimize.
[2024-05-30 11:53:48] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 20/1823 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 11:53:48] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 2 ms to minimize.
[2024-05-30 11:53:48] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 6 ms to minimize.
[2024-05-30 11:53:49] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 2 ms to minimize.
[2024-05-30 11:53:49] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 2 ms to minimize.
[2024-05-30 11:53:49] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 3 ms to minimize.
[2024-05-30 11:53:49] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-05-30 11:53:50] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 3 ms to minimize.
[2024-05-30 11:53:50] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 4 ms to minimize.
[2024-05-30 11:53:50] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 2 ms to minimize.
[2024-05-30 11:53:50] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2024-05-30 11:53:50] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 2 ms to minimize.
[2024-05-30 11:53:50] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 2 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 2 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 1 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2024-05-30 11:53:52] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 20/1843 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 11:53:52] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-05-30 11:53:52] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:53:52] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:53:52] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 9 ms to minimize.
[2024-05-30 11:53:52] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-30 11:53:52] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-30 11:53:52] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 7/1850 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1402 variables, 0/1850 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1902/3304 variables, 1402/3252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3304 variables, 2/3254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 11:53:54] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 4 ms to minimize.
[2024-05-30 11:53:55] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 3 ms to minimize.
[2024-05-30 11:53:55] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 3 ms to minimize.
[2024-05-30 11:53:55] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 3 ms to minimize.
[2024-05-30 11:53:55] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 3 ms to minimize.
[2024-05-30 11:53:56] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 3 ms to minimize.
[2024-05-30 11:53:56] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 3 ms to minimize.
[2024-05-30 11:53:56] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 3 ms to minimize.
[2024-05-30 11:53:57] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 3 ms to minimize.
[2024-05-30 11:53:57] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 2 ms to minimize.
[2024-05-30 11:53:57] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-05-30 11:53:57] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 2 ms to minimize.
[2024-05-30 11:53:58] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 2 ms to minimize.
[2024-05-30 11:53:58] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 2 ms to minimize.
[2024-05-30 11:53:58] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-05-30 11:53:58] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 2 ms to minimize.
[2024-05-30 11:53:59] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 2 ms to minimize.
[2024-05-30 11:53:59] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2024-05-30 11:53:59] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:53:59] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 20/3274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 11:54:00] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 2 ms to minimize.
[2024-05-30 11:54:00] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 6 ms to minimize.
[2024-05-30 11:54:01] [INFO ] Deduced a trap composed of 7 places in 274 ms of which 3 ms to minimize.
[2024-05-30 11:54:04] [INFO ] Deduced a trap composed of 28 places in 3472 ms of which 2 ms to minimize.
[2024-05-30 11:54:04] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 2 ms to minimize.
[2024-05-30 11:54:05] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 4 ms to minimize.
[2024-05-30 11:54:05] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 4 ms to minimize.
[2024-05-30 11:54:05] [INFO ] Deduced a trap composed of 27 places in 244 ms of which 2 ms to minimize.
[2024-05-30 11:54:06] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 4 ms to minimize.
[2024-05-30 11:54:06] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-05-30 11:54:06] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-05-30 11:54:06] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-05-30 11:54:07] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-05-30 11:54:07] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-30 11:54:07] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2024-05-30 11:54:07] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-30 11:54:07] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-30 11:54:07] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2024-05-30 11:54:08] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-30 11:54:08] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3304 variables, 20/3294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 11:54:08] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-30 11:54:08] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2024-05-30 11:54:09] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2024-05-30 11:54:09] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3304 variables, 4/3298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 11:54:09] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:54:10] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-30 11:54:10] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 10 ms to minimize.
[2024-05-30 11:54:10] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3304 variables, 4/3302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3304 variables, 0/3302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/3304 variables, 0/3302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3304/3304 variables, and 3302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 32405 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 95/95 constraints]
After SMT, in 33546ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA ShieldRVs-PT-100A-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3408 ms.
Support contains 36 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 1402 transition count 1902
Applied a total of 9 rules in 174 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 1402/1402 places, 1902/1902 transitions.
RANDOM walk for 40000 steps (32 resets) in 792 ms. (50 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 446 ms. (89 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 116100 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 116100 steps, saw 46411 distinct states, run finished after 3005 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 1902 rows 1402 cols
[2024-05-30 11:54:18] [INFO ] Computed 401 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 99/135 variables, 35/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 99/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1402 variables, 366/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 1267/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1902/3304 variables, 1402/3205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3304/3304 variables, and 3205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 945 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 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/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 99/135 variables, 35/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 99/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1402 variables, 366/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 1267/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:54:20] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 4 ms to minimize.
[2024-05-30 11:54:20] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 3 ms to minimize.
[2024-05-30 11:54:20] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 3 ms to minimize.
[2024-05-30 11:54:21] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 3 ms to minimize.
[2024-05-30 11:54:21] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 4 ms to minimize.
[2024-05-30 11:54:21] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 3 ms to minimize.
[2024-05-30 11:54:21] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 3 ms to minimize.
[2024-05-30 11:54:22] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 3 ms to minimize.
[2024-05-30 11:54:22] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 3 ms to minimize.
[2024-05-30 11:54:22] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 2 ms to minimize.
[2024-05-30 11:54:22] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 2 ms to minimize.
[2024-05-30 11:54:22] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 3 ms to minimize.
[2024-05-30 11:54:23] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 2 ms to minimize.
[2024-05-30 11:54:23] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 3 ms to minimize.
[2024-05-30 11:54:23] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 2 ms to minimize.
[2024-05-30 11:54:23] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:54:23] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-05-30 11:54:23] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
[2024-05-30 11:54:24] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-05-30 11:54:24] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 20/1823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:54:24] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-05-30 11:54:24] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2024-05-30 11:54:24] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2024-05-30 11:54:24] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
[2024-05-30 11:54:24] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-05-30 11:54:25] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2024-05-30 11:54:25] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-30 11:54:25] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2024-05-30 11:54:25] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:54:25] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-30 11:54:25] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2024-05-30 11:54:25] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:54:25] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:54:25] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-30 11:54:25] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-30 11:54:25] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-30 11:54:26] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-30 11:54:26] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-30 11:54:26] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 19/1842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 0/1842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1902/3304 variables, 1402/3244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3304 variables, 1/3245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:54:27] [INFO ] Deduced a trap composed of 7 places in 273 ms of which 4 ms to minimize.
[2024-05-30 11:54:27] [INFO ] Deduced a trap composed of 7 places in 276 ms of which 4 ms to minimize.
[2024-05-30 11:54:28] [INFO ] Deduced a trap composed of 11 places in 273 ms of which 4 ms to minimize.
[2024-05-30 11:54:28] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 3 ms to minimize.
[2024-05-30 11:54:29] [INFO ] Deduced a trap composed of 7 places in 254 ms of which 3 ms to minimize.
[2024-05-30 11:54:29] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 4 ms to minimize.
[2024-05-30 11:54:29] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 3 ms to minimize.
[2024-05-30 11:54:30] [INFO ] Deduced a trap composed of 7 places in 250 ms of which 4 ms to minimize.
[2024-05-30 11:54:30] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 3 ms to minimize.
[2024-05-30 11:54:30] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 3 ms to minimize.
[2024-05-30 11:54:31] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 3 ms to minimize.
[2024-05-30 11:54:31] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 3 ms to minimize.
[2024-05-30 11:54:31] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 3 ms to minimize.
[2024-05-30 11:54:32] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 3 ms to minimize.
[2024-05-30 11:54:32] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 4 ms to minimize.
[2024-05-30 11:54:32] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 3 ms to minimize.
[2024-05-30 11:54:33] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 3 ms to minimize.
[2024-05-30 11:54:33] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 4 ms to minimize.
[2024-05-30 11:54:33] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 3 ms to minimize.
[2024-05-30 11:54:33] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3304 variables, 20/3265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:54:34] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 3 ms to minimize.
[2024-05-30 11:54:34] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 3 ms to minimize.
[2024-05-30 11:54:35] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 3 ms to minimize.
[2024-05-30 11:54:35] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 3 ms to minimize.
[2024-05-30 11:54:35] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 3 ms to minimize.
[2024-05-30 11:54:36] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 4 ms to minimize.
[2024-05-30 11:54:36] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 3 ms to minimize.
[2024-05-30 11:54:36] [INFO ] Deduced a trap composed of 7 places in 250 ms of which 3 ms to minimize.
[2024-05-30 11:54:36] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 4 ms to minimize.
[2024-05-30 11:54:37] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 3 ms to minimize.
[2024-05-30 11:54:37] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 3 ms to minimize.
[2024-05-30 11:54:37] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 3 ms to minimize.
[2024-05-30 11:54:38] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 3 ms to minimize.
[2024-05-30 11:54:38] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 3 ms to minimize.
[2024-05-30 11:54:38] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 3 ms to minimize.
[2024-05-30 11:54:39] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 3 ms to minimize.
[2024-05-30 11:54:39] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 4 ms to minimize.
[2024-05-30 11:54:39] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 3 ms to minimize.
[2024-05-30 11:54:40] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 3 ms to minimize.
[2024-05-30 11:54:40] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 20/3285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:54:40] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 3 ms to minimize.
[2024-05-30 11:54:41] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 2 ms to minimize.
[2024-05-30 11:54:41] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 2 ms to minimize.
[2024-05-30 11:54:41] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 3 ms to minimize.
[2024-05-30 11:54:41] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 2 ms to minimize.
[2024-05-30 11:54:42] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 3 ms to minimize.
[2024-05-30 11:54:42] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 3 ms to minimize.
[2024-05-30 11:54:42] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 3 ms to minimize.
[2024-05-30 11:54:42] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 2 ms to minimize.
[2024-05-30 11:54:43] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:54:43] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 2 ms to minimize.
[2024-05-30 11:54:43] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 2 ms to minimize.
[2024-05-30 11:54:43] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 2 ms to minimize.
[2024-05-30 11:54:44] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 2 ms to minimize.
[2024-05-30 11:54:44] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 2 ms to minimize.
[2024-05-30 11:54:44] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 2 ms to minimize.
[2024-05-30 11:54:44] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 3 ms to minimize.
[2024-05-30 11:54:45] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 3 ms to minimize.
[2024-05-30 11:54:45] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-05-30 11:54:45] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3304 variables, 20/3305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:54:46] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 3 ms to minimize.
[2024-05-30 11:54:46] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 3 ms to minimize.
[2024-05-30 11:54:46] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-05-30 11:54:46] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 2 ms to minimize.
[2024-05-30 11:54:47] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 2 ms to minimize.
[2024-05-30 11:54:47] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 2 ms to minimize.
[2024-05-30 11:54:47] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 3 ms to minimize.
[2024-05-30 11:54:47] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 2 ms to minimize.
[2024-05-30 11:54:48] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 2 ms to minimize.
[2024-05-30 11:54:48] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 2 ms to minimize.
[2024-05-30 11:54:48] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 2 ms to minimize.
[2024-05-30 11:54:48] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-30 11:54:49] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-05-30 11:54:49] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-05-30 11:54:49] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-05-30 11:54:49] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2024-05-30 11:54:49] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:54:50] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2024-05-30 11:54:50] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-30 11:54:50] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3304 variables, 20/3325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:54:50] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:54:50] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:54:51] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:54:51] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:54:51] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:54:51] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:54:51] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:54:51] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:54:52] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:54:52] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:54:52] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:54:52] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:54:52] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-30 11:54:52] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:54:52] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:54:53] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-30 11:54:53] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:54:53] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:54:53] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:54:53] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3304 variables, 20/3345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:54:54] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:54:54] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:54:54] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-30 11:54:54] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:54:54] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:54:54] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:54:55] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:54:55] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:54:55] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-30 11:54:55] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 4 ms to minimize.
[2024-05-30 11:54:55] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:54:55] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:54:56] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:54:56] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:54:56] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:54:56] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:54:56] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:54:56] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-30 11:54:56] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:54:57] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/3304 variables, 20/3365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:54:57] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:54:57] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:54:57] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:54:57] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:54:58] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:54:58] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:54:58] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:54:58] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-30 11:54:58] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:54:58] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:54:58] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-05-30 11:54:59] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:54:59] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:54:59] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:54:59] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:54:59] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-30 11:54:59] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:55:00] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:55:00] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:55:00] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3304 variables, 20/3385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:55:00] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:55:00] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:55:01] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:55:01] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:55:01] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-30 11:55:01] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:55:01] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:55:01] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:55:02] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:55:02] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:55:02] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:55:02] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:55:02] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:55:02] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:55:03] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-05-30 11:55:03] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:55:03] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:55:03] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:55:03] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:55:03] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3304 variables, 20/3405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:55:04] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:55:04] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-30 11:55:04] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:55:04] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:55:04] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:55:04] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:55:05] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:55:05] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:55:05] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:55:05] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:55:05] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:55:05] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:55:06] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:55:06] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:55:06] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:55:06] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:55:06] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:55:06] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:55:07] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:55:07] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3304 variables, 20/3425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:55:07] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:55:07] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:55:07] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:55:08] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:55:08] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:55:08] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:55:08] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:55:08] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:55:08] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:55:09] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:55:09] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:55:09] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:55:09] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:55:09] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-05-30 11:55:09] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:55:10] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 2 ms to minimize.
[2024-05-30 11:55:10] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:55:10] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:55:10] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:55:10] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/3304 variables, 20/3445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:55:10] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:55:11] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2024-05-30 11:55:11] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:55:11] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:55:11] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:55:11] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:55:11] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:55:12] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:55:12] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:55:12] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:55:12] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:55:12] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 1 ms to minimize.
[2024-05-30 11:55:12] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:55:13] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:55:13] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:55:13] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:55:13] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:55:13] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:55:13] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:55:14] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/3304 variables, 20/3465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 11:55:14] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:55:14] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:55:14] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:55:14] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-05-30 11:55:14] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:55:15] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-30 11:55:15] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:55:15] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/3304 variables, 8/3473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3304 variables, 0/3473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/3304 variables, 0/3473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3304/3304 variables, and 3473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 56139 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 267/267 constraints]
After SMT, in 57164ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1351 ms.
Support contains 36 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 68 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 68 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2024-05-30 11:55:17] [INFO ] Invariant cache hit.
[2024-05-30 11:55:18] [INFO ] Implicit Places using invariants in 768 ms returned []
[2024-05-30 11:55:18] [INFO ] Invariant cache hit.
[2024-05-30 11:55:20] [INFO ] Implicit Places using invariants and state equation in 1947 ms returned []
Implicit Place search using SMT with State Equation took 2722 ms to find 0 implicit places.
[2024-05-30 11:55:20] [INFO ] Redundant transitions in 319 ms returned []
Running 1901 sub problems to find dead transitions.
[2024-05-30 11:55:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3304 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30045 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1901/1901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1901 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 1401/1401 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3304 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30043 ms.
Refiners :[Domain max(s): 1401/1402 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 0/0 constraints]
After SMT, in 61366ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 61391ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64530 ms. Remains : 1402/1402 places, 1902/1902 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 11:56:22] [INFO ] Flatten gal took : 128 ms
[2024-05-30 11:56:22] [INFO ] Applying decomposition
[2024-05-30 11:56:22] [INFO ] Flatten gal took : 118 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/graph7617639325203101632.txt' '-o' '/tmp/graph7617639325203101632.bin' '-w' '/tmp/graph7617639325203101632.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7617639325203101632.bin' '-l' '-1' '-v' '-w' '/tmp/graph7617639325203101632.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:56:22] [INFO ] Decomposing Gal with order
[2024-05-30 11:56:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:56:22] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-30 11:56:23] [INFO ] Flatten gal took : 311 ms
[2024-05-30 11:56:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2304 labels/synchronizations in 241 ms.
[2024-05-30 11:56:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7005203468141668417.gal : 29 ms
[2024-05-30 11:56:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10789653937109660520.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/ReachabilityCardinality7005203468141668417.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10789653937109660520.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/ReachabilityCardinality10789653937109660520.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :11 after 45
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :45 after 1.86681e+11
ITS-tools command line returned an error code 137
[2024-05-30 12:10:41] [INFO ] Flatten gal took : 134 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2286686383730881926
[2024-05-30 12:10:41] [INFO ] Too many transitions (1902) to apply POR reductions. Disabling POR matrices.
[2024-05-30 12:10:41] [INFO ] Applying decomposition
[2024-05-30 12:10:41] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2286686383730881926
Running compilation step : cd /tmp/ltsmin2286686383730881926;'/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 12:10:41] [INFO ] Flatten gal took : 143 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/graph6048537807393930866.txt' '-o' '/tmp/graph6048537807393930866.bin' '-w' '/tmp/graph6048537807393930866.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6048537807393930866.bin' '-l' '-1' '-v' '-w' '/tmp/graph6048537807393930866.weights' '-q' '0' '-e' '0.001'
[2024-05-30 12:10:42] [INFO ] Decomposing Gal with order
[2024-05-30 12:10:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 12:10:42] [INFO ] Removed a total of 2177 redundant transitions.
[2024-05-30 12:10:42] [INFO ] Flatten gal took : 136 ms
[2024-05-30 12:10:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2375 labels/synchronizations in 82 ms.
[2024-05-30 12:10:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8953836776611333716.gal : 16 ms
[2024-05-30 12:10:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16149588394269410681.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8953836776611333716.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16149588394269410681.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/ReachabilityCardinality16149588394269410681.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2 after 2
Compilation finished in 5933 ms.
Running link step : cd /tmp/ltsmin2286686383730881926;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin2286686383730881926;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT100AReachabilityCardinality202403==true'
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2 after 1.41469e+06
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.038: Initializing POR dependencies: labels 1903, guards 1902
pins2lts-mc-linux64( 3/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 1.840: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 1.847: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 1.873: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 1.877: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 2.985: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 173.829: No maybe-coenabled matrix found. Turning off NESs from NDS+MC.
pins2lts-mc-linux64( 0/ 8), 614.998: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 0/ 8), 620.540: "ShieldRVsPT100AReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 620.541: There are 1903 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 620.541: State length is 1402, there are 1902 groups
pins2lts-mc-linux64( 0/ 8), 620.541: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 620.541: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 620.541: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 620.541: Visible groups: 0 / 1902, labels: 1 / 1903
pins2lts-mc-linux64( 0/ 8), 620.541: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 620.541: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 620.539: "ShieldRVsPT100AReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 620.539: "ShieldRVsPT100AReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 620.540: "ShieldRVsPT100AReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 620.543: "ShieldRVsPT100AReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 620.542: "ShieldRVsPT100AReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 620.542: "ShieldRVsPT100AReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 620.541: "ShieldRVsPT100AReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 620.750: ~3 levels ~960 states ~4456 transitions
pins2lts-mc-linux64( 2/ 8), 620.928: ~5 levels ~1920 states ~9624 transitions
pins2lts-mc-linux64( 2/ 8), 621.264: ~6 levels ~3840 states ~20056 transitions
pins2lts-mc-linux64( 6/ 8), 621.844: ~6 levels ~7680 states ~44376 transitions
pins2lts-mc-linux64( 6/ 8), 623.120: ~8 levels ~15360 states ~94712 transitions
pins2lts-mc-linux64( 7/ 8), 625.584: ~10 levels ~30720 states ~196600 transitions
pins2lts-mc-linux64( 7/ 8), 630.275: ~11 levels ~61440 states ~403352 transitions
pins2lts-mc-linux64( 3/ 8), 640.192: ~11 levels ~122880 states ~841544 transitions
pins2lts-mc-linux64( 7/ 8), 660.117: ~13 levels ~245760 states ~1760968 transitions
pins2lts-mc-linux64( 3/ 8), 700.195: ~13 levels ~491520 states ~3649568 transitions
pins2lts-mc-linux64( 7/ 8), 782.981: ~15 levels ~983040 states ~7660424 transitions
pins2lts-mc-linux64( 3/ 8), 947.761: ~15 levels ~1966080 states ~15690040 transitions
pins2lts-mc-linux64( 3/ 8), 1298.291: ~16 levels ~3932160 states ~33218952 transitions
pins2lts-mc-linux64( 5/ 8), 1345.617: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1345.747:
pins2lts-mc-linux64( 0/ 8), 1345.747: mean standard work distribution: 3.6% (states) 3.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 1345.747:
pins2lts-mc-linux64( 0/ 8), 1345.747: Explored 4037683 states 34876590 transitions, fanout: 8.638
pins2lts-mc-linux64( 0/ 8), 1345.747: Total exploration time 725.190 sec (725.130 sec minimum, 725.159 sec on average)
pins2lts-mc-linux64( 0/ 8), 1345.747: States per second: 5568, Transitions per second: 48093
pins2lts-mc-linux64( 0/ 8), 1345.747: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 1345.747:
pins2lts-mc-linux64( 0/ 8), 1345.747: Queue width: 8B, total height: 4136846, memory: 31.56MB
pins2lts-mc-linux64( 0/ 8), 1345.747: Tree memory: 318.4MB, 40.8 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1345.747: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1345.747: Stored 1932 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1345.747: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1345.747: Est. total memory use: 349.9MB (~1055.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2286686383730881926;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT100AReachabilityCardinality202403==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2286686383730881926;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT100AReachabilityCardinality202403==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-30 12:36:28] [INFO ] Applying decomposition
[2024-05-30 12:36:28] [INFO ] Flatten gal took : 82 ms
[2024-05-30 12:36:28] [INFO ] Decomposing Gal with order
[2024-05-30 12:36:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 12:36:28] [INFO ] Removed a total of 2287 redundant transitions.
[2024-05-30 12:36:28] [INFO ] Flatten gal took : 143 ms
[2024-05-30 12:36:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1488 labels/synchronizations in 113 ms.
[2024-05-30 12:36:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13312000205474551568.gal : 33 ms
[2024-05-30 12:36:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10655702465399873301.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/ReachabilityCardinality13312000205474551568.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10655702465399873301.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 ...309
Loading property file /tmp/ReachabilityCardinality10655702465399873301.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 2054

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-100A"
export BK_EXAMINATION="ReachabilityCardinality"
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-100A, examination is ReachabilityCardinality"
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-171683762000870"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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