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

About the Execution of ITS-Tools for ShieldRVs-PT-100A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16206.388 3600000.00 11141353.00 3425.50 ?TTFTTFTTT?FTT?? normal

Execution Chart

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

Trace from the execution

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

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717070022115

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-100A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-30 11:53:43] [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 11:53:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 11:53:43] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2024-05-30 11:53:43] [INFO ] Transformed 1403 places.
[2024-05-30 11:53:43] [INFO ] Transformed 1903 transitions.
[2024-05-30 11:53:43] [INFO ] Found NUPN structural information;
[2024-05-30 11:53:43] [INFO ] Parsed PT model containing 1403 places and 1903 transitions and 9200 arcs in 273 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (28 resets) in 2309 ms. (17 steps per ms) remains 9/16 properties
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 850 ms. (47 steps per ms) remains 8/9 properties
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-30 11:53:44] [INFO ] Flatten gal took : 614 ms
BEST_FIRST walk for 40004 steps (8 resets) in 604 ms. (66 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 665 ms. (60 steps per ms) remains 8/8 properties
[2024-05-30 11:53:45] [INFO ] Flatten gal took : 275 ms
BEST_FIRST walk for 40003 steps (8 resets) in 845 ms. (47 steps per ms) remains 8/8 properties
[2024-05-30 11:53:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15396257841526210514.gal : 95 ms
[2024-05-30 11:53:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17916622206897621023.prop : 11 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/ReachabilityCardinality15396257841526210514.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17916622206897621023.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 420 ms. (95 steps per ms) remains 8/8 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (8 resets) in 529 ms. (75 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 456 ms. (87 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality17916622206897621023.prop.
BEST_FIRST walk for 40002 steps (8 resets) in 510 ms. (78 steps per ms) remains 8/8 properties
// Phase 1: matrix 1903 rows 1403 cols
[2024-05-30 11:53:45] [INFO ] Computed 401 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 448/677 variables, 185/414 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/677 variables, 448/862 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/677 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 726/1403 variables, 216/1078 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1403 variables, 726/1804 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1403 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1903/3306 variables, 1403/3207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :134 after 406
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :406 after 8428
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :8428 after 106163
At refinement iteration 9 (INCLUDED_ONLY) 0/3306 variables, 0/3207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/3306 variables, 0/3207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3306/3306 variables, and 3207 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2268 ms.
Refiners :[Domain max(s): 1403/1403 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1403/1403 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 448/677 variables, 185/414 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/677 variables, 448/862 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 11:53:48] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 8 ms to minimize.
[2024-05-30 11:53:48] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-30 11:53:48] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-30 11:53:48] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/677 variables, 4/866 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 11:53:49] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/677 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 11:53:49] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2024-05-30 11:53:49] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-30 11:53:49] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 3/870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 726/1403 variables, 216/1086 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1403 variables, 726/1812 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 11:53:49] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-05-30 11:53:50] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
[2024-05-30 11:53:50] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-05-30 11:53:50] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-30 11:53:50] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-30 11:53:50] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-05-30 11:53:50] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-30 11:53:50] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 1 ms to minimize.
[2024-05-30 11:53:50] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1403 variables, 20/1832 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-30 11:53:51] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 11:53:52] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
Reachability property ShieldRVs-PT-100A-ReachabilityFireability-2024-08 is true.
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :106163 after 6.39147e+06
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :6.39147e+06 after 7.97156e+07
[2024-05-30 11:53:52] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1403 variables, 5/1837 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :7.97156e+07 after 1.03106e+09
[2024-05-30 11:53:52] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 4 ms to minimize.
[2024-05-30 11:53:52] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1403 variables, 2/1839 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :1.03106e+09 after 5.99887e+10
[2024-05-30 11:53:52] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1403 variables, 1/1840 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1403 variables, 0/1840 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :5.99887e+10 after 5.68363e+12
SMT process timed out in 7517ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 225 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 6 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 158 times.
Drop transitions (Partial Free agglomeration) removed 158 transitions
Iterating global reduction 0 with 158 rules applied. Total rules applied 160 place count 1402 transition count 1902
Applied a total of 160 rules in 367 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 377 ms. Remains : 1402/1403 places, 1902/1903 transitions.
RANDOM walk for 40000 steps (32 resets) in 797 ms. (50 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 535 ms. (74 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 357 ms. (111 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 441 ms. (90 steps per ms) remains 6/7 properties
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 5/6 properties
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 391 ms. (102 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 5/5 properties
SDD proceeding with computation,7 properties remain. new max is 32768
BEST_FIRST walk for 40004 steps (8 resets) in 404 ms. (98 steps per ms) remains 5/5 properties
// Phase 1: matrix 1902 rows 1402 cols
[2024-05-30 11:53:54] [INFO ] Computed 401 invariants in 8 ms
SDD size :5.68363e+12 after 6.02565e+15
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 373/543 variables, 148/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/543 variables, 373/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 859/1402 variables, 253/944 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 859/1803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1902/3304 variables, 1402/3205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3304/3304 variables, and 3205 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1401 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 373/543 variables, 148/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/543 variables, 373/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 859/1402 variables, 253/944 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 859/1803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:53:56] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 3 ms to minimize.
[2024-05-30 11:53:57] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 3 ms to minimize.
[2024-05-30 11:53:57] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 2 ms to minimize.
[2024-05-30 11:53:57] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 3 ms to minimize.
[2024-05-30 11:53:57] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 3 ms to minimize.
[2024-05-30 11:53:57] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 3 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :6.02565e+15 after 5.51367e+19
[2024-05-30 11:53:57] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 3 ms to minimize.
[2024-05-30 11:53:58] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-05-30 11:53:58] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 2 ms to minimize.
[2024-05-30 11:53:58] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 2 ms to minimize.
[2024-05-30 11:53:58] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 2 ms to minimize.
[2024-05-30 11:53:58] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 2 ms to minimize.
[2024-05-30 11:53:58] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
[2024-05-30 11:53:58] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2024-05-30 11:53:59] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-05-30 11:53:59] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-05-30 11:53:59] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-05-30 11:53:59] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-05-30 11:53:59] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-30 11:53:59] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 20/1823 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:53:59] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-30 11:53:59] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-05-30 11:53:59] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-30 11:54:00] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:54:00] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-30 11:54:00] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-30 11:54:00] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 7/1830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 0/1830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1902/3304 variables, 1402/3232 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3304 variables, 5/3237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:54:03] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-05-30 11:54:03] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-30 11:54:04] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-30 11:54:04] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :5.51367e+19 after 4.01597e+26
[2024-05-30 11:54:04] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 12 ms to minimize.
[2024-05-30 11:54:04] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2024-05-30 11:54:04] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2024-05-30 11:54:05] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-05-30 11:54:05] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-05-30 11:54:05] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-05-30 11:54:05] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-30 11:54:05] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-30 11:54:06] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-30 11:54:06] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:54:06] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:54:06] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:54:06] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-05-30 11:54:06] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-30 11:54:07] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:54:07] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3304 variables, 20/3257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:54:08] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:54:08] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:54:08] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-30 11:54:08] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:54:08] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-30 11:54:09] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-30 11:54:09] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-30 11:54:09] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:54:09] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:54:09] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:54:09] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 11:54:10] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-30 11:54:10] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-30 11:54:10] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2024-05-30 11:54:10] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:54:10] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-30 11:54:10] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-30 11:54:10] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-30 11:54:11] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-30 11:54:11] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 20/3277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:54:12] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:54:12] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-05-30 11:54:12] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:54:12] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:54:13] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-30 11:54:13] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-30 11:54:13] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-30 11:54:13] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-30 11:54:13] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-30 11:54:13] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:54:14] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:54:14] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2024-05-30 11:54:14] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:54:14] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:54:14] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:54:15] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:54:15] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-30 11:54:15] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-30 11:54:15] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:54:15] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3304 variables, 20/3297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 11:54:16] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:54:16] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-30 11:54:16] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3304 variables, 3/3300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,7 properties remain. new max is 262144
SDD size :4.01597e+26 after 2.80283e+40
At refinement iteration 16 (INCLUDED_ONLY) 0/3304 variables, 0/3300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/3304 variables, 0/3300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3304/3304 variables, and 3300 constraints, problems are : Problem set: 0 solved, 5 unsolved in 23607 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 90/90 constraints]
After SMT, in 25091ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 8323 ms.
Support contains 151 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 259 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 259 ms. Remains : 1402/1402 places, 1902/1902 transitions.
RANDOM walk for 40000 steps (32 resets) in 690 ms. (57 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 435 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 414 ms. (96 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 387 ms. (103 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 409 ms. (97 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 88430 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 4
Probabilistic random walk after 88430 steps, saw 39951 distinct states, run finished after 3004 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 1902 rows 1402 cols
[2024-05-30 11:54:32] [INFO ] Computed 401 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 151/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 352/503 variables, 136/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 352/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 899/1402 variables, 265/904 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 899/1803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1402 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1902/3304 variables, 1402/3205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/3304 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3304/3304 variables, and 3205 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1267 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 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/151 variables, 151/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 352/503 variables, 136/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 352/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 899/1402 variables, 265/904 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 899/1803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 11:54:34] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 3 ms to minimize.
[2024-05-30 11:54:34] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 2 ms to minimize.
[2024-05-30 11:54:34] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 3 ms to minimize.
[2024-05-30 11:54:34] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 21 ms to minimize.
[2024-05-30 11:54:35] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 3 ms to minimize.
[2024-05-30 11:54:35] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 2 ms to minimize.
[2024-05-30 11:54:35] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 2 ms to minimize.
[2024-05-30 11:54:35] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 3 ms to minimize.
[2024-05-30 11:54:35] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-05-30 11:54:35] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-05-30 11:54:36] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 2 ms to minimize.
[2024-05-30 11:54:36] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
[2024-05-30 11:54:36] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-05-30 11:54:36] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 2 ms to minimize.
[2024-05-30 11:54:36] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 2 ms to minimize.
[2024-05-30 11:54:36] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 3 ms to minimize.
[2024-05-30 11:54:37] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-05-30 11:54:37] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2024-05-30 11:54:37] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
[2024-05-30 11:54:37] [INFO ] Deduced a trap composed of 7 places in 108 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, 4 unsolved
[2024-05-30 11:54:37] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-05-30 11:54:37] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-30 11:54:37] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-30 11:54:37] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-05-30 11:54:38] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-30 11:54:38] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-05-30 11:54:38] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-30 11:54:38] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-05-30 11:54:38] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-30 11:54:38] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-30 11:54:38] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:54:38] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-30 11:54:38] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2024-05-30 11:54:38] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-30 11:54:39] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-30 11:54:39] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 16/1839 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 11:54:39] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1402 variables, 1/1840 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1402 variables, 0/1840 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1902/3304 variables, 1402/3242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3304 variables, 4/3246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 11:54:41] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 3 ms to minimize.
[2024-05-30 11:54:41] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 3 ms to minimize.
[2024-05-30 11:54:42] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 3 ms to minimize.
[2024-05-30 11:54:42] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 3 ms to minimize.
[2024-05-30 11:54:42] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 3 ms to minimize.
[2024-05-30 11:54:43] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 3 ms to minimize.
[2024-05-30 11:54:43] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 2 ms to minimize.
[2024-05-30 11:54:43] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 3 ms to minimize.
[2024-05-30 11:54:43] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 3 ms to minimize.
[2024-05-30 11:54:44] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 3 ms to minimize.
[2024-05-30 11:54:44] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 3 ms to minimize.
[2024-05-30 11:54:44] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 2 ms to minimize.
[2024-05-30 11:54:45] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 2 ms to minimize.
[2024-05-30 11:54:45] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-05-30 11:54:45] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 2 ms to minimize.
[2024-05-30 11:54:45] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2024-05-30 11:54:46] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-30 11:54:46] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-30 11:54:46] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2024-05-30 11:54:46] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 20/3266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 11:54:47] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-05-30 11:54:47] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-30 11:54:48] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:54:48] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:54:48] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2024-05-30 11:54:48] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-30 11:54:48] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2024-05-30 11:54:48] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-30 11:54:49] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2024-05-30 11:54:49] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-30 11:54:49] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-30 11:54:49] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3304 variables, 12/3278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 11:54:50] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:54:50] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:54:51] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:54:51] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-30 11:54:51] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-30 11:54:51] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-30 11:54:51] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-30 11:54:51] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2024-05-30 11:54:52] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-30 11:54:52] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-30 11:54:52] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-30 11:54:52] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:54:52] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-30 11:54:53] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:54:53] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-30 11:54:53] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-30 11:54:53] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-30 11:54:53] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:54:53] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-30 11:54:54] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3304 variables, 20/3298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 11:54:54] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3304 variables, 1/3299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 11:54:55] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-30 11:54:55] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 11:54:56] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-30 11:54:56] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 11:54:56] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-30 11:54:56] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-30 11:54:56] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-30 11:54:56] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-30 11:54:57] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-30 11:54:57] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-30 11:54:57] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-30 11:54:57] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-30 11:54:57] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/3304 variables, 13/3312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 11:54:58] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3304 variables, 1/3313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3304 variables, 0/3313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/3304 variables, 0/3313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3304/3304 variables, and 3313 constraints, problems are : Problem set: 0 solved, 4 unsolved in 27550 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 104/104 constraints]
After SMT, in 28876ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9573 ms.
Support contains 151 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 53 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 53 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 51 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2024-05-30 11:55:10] [INFO ] Invariant cache hit.
[2024-05-30 11:55:11] [INFO ] Implicit Places using invariants in 703 ms returned []
[2024-05-30 11:55:11] [INFO ] Invariant cache hit.
[2024-05-30 11:55:13] [INFO ] Implicit Places using invariants and state equation in 1663 ms returned []
Implicit Place search using SMT with State Equation took 2377 ms to find 0 implicit places.
[2024-05-30 11:55:13] [INFO ] Redundant transitions in 685 ms returned []
Running 1901 sub problems to find dead transitions.
[2024-05-30 11:55:13] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 timeout
1.0)
(s1118 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30044 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 30055 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 61264ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 61284ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64409 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:15] [INFO ] Flatten gal took : 112 ms
[2024-05-30 11:56:15] [INFO ] Applying decomposition
[2024-05-30 11:56:15] [INFO ] Flatten gal took : 105 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/graph9172475130385489513.txt' '-o' '/tmp/graph9172475130385489513.bin' '-w' '/tmp/graph9172475130385489513.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9172475130385489513.bin' '-l' '-1' '-v' '-w' '/tmp/graph9172475130385489513.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:56:15] [INFO ] Decomposing Gal with order
[2024-05-30 11:56:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:56:16] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-30 11:56:16] [INFO ] Flatten gal took : 206 ms
[2024-05-30 11:56:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 2152 labels/synchronizations in 246 ms.
[2024-05-30 11:56:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4863749207041188800.gal : 24 ms
[2024-05-30 11:56:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6043893515412596575.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/ReachabilityCardinality4863749207041188800.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6043893515412596575.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6043893515412596575.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :11 after 45
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :45 after 3.54979e+08
ITS-tools command line returned an error code 137
[2024-05-30 12:04:26] [INFO ] Flatten gal took : 128 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14629924343537463505
[2024-05-30 12:04:26] [INFO ] Too many transitions (1902) to apply POR reductions. Disabling POR matrices.
[2024-05-30 12:04:26] [INFO ] Applying decomposition
[2024-05-30 12:04:26] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14629924343537463505
Running compilation step : cd /tmp/ltsmin14629924343537463505;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' '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:04:27] [INFO ] Flatten gal took : 90 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/graph12827979951707654075.txt' '-o' '/tmp/graph12827979951707654075.bin' '-w' '/tmp/graph12827979951707654075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12827979951707654075.bin' '-l' '-1' '-v' '-w' '/tmp/graph12827979951707654075.weights' '-q' '0' '-e' '0.001'
[2024-05-30 12:04:27] [INFO ] Decomposing Gal with order
[2024-05-30 12:04:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 12:04:27] [INFO ] Removed a total of 2193 redundant transitions.
[2024-05-30 12:04:27] [INFO ] Flatten gal took : 120 ms
[2024-05-30 12:04:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 2256 labels/synchronizations in 85 ms.
[2024-05-30 12:04:27] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13784226609011791737.gal : 17 ms
[2024-05-30 12:04:27] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17715741614497939870.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/ReachabilityFireability13784226609011791737.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17715741614497939870.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/ReachabilityFireability17715741614497939870.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :8 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 8
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :8 after 8
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :8 after 8
Compilation finished in 5265 ms.
Running link step : cd /tmp/ltsmin14629924343537463505;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin14629924343537463505;'/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' 'ShieldRVsPT100AReachabilityFireability202400==true'
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :8 after 1.50343e+06
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin14629924343537463505;'/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' 'ShieldRVsPT100AReachabilityFireability202400==true'
Running LTSmin : cd /tmp/ltsmin14629924343537463505;'/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' 'ShieldRVsPT100AReachabilityFireability202410==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin14629924343537463505;'/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' 'ShieldRVsPT100AReachabilityFireability202410==true'
Running LTSmin : cd /tmp/ltsmin14629924343537463505;'/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' 'ShieldRVsPT100AReachabilityFireability202414==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin14629924343537463505;'/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' 'ShieldRVsPT100AReachabilityFireability202414==true'
Running LTSmin : cd /tmp/ltsmin14629924343537463505;'/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' 'ShieldRVsPT100AReachabilityFireability202415==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin14629924343537463505;'/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' 'ShieldRVsPT100AReachabilityFireability202415==true'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin14629924343537463505;'/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' 'ShieldRVsPT100AReachabilityFireability202400==true'
ITS-tools command line returned an error code 137
[2024-05-30 12:24:15] [INFO ] Applying decomposition
[2024-05-30 12:24:16] [INFO ] Flatten gal took : 267 ms
[2024-05-30 12:24:16] [INFO ] Decomposing Gal with order
[2024-05-30 12:24:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 12:24:16] [INFO ] Removed a total of 2264 redundant transitions.
[2024-05-30 12:24:16] [INFO ] Flatten gal took : 316 ms
[2024-05-30 12:24:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 1460 labels/synchronizations in 243 ms.
[2024-05-30 12:24:17] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7206278331444406113.gal : 36 ms
[2024-05-30 12:24:17] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2060506951743982728.prop : 7 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/ReachabilityFireability7206278331444406113.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2060506951743982728.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability2060506951743982728.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :2 after 205
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: 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.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.054: Initializing POR dependencies: labels 1906, guards 1902
pins2lts-mc-linux64( 3/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 139.491: No maybe-coenabled matrix found. Turning off NESs from NDS+MC.
pins2lts-mc-linux64( 0/ 8), 554.840: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 5/ 8), 555.982: "ShieldRVsPT100AReachabilityFireability202400==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 555.983: "ShieldRVsPT100AReachabilityFireability202400==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 555.983: "ShieldRVsPT100AReachabilityFireability202400==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 555.985: "ShieldRVsPT100AReachabilityFireability202400==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 555.985: "ShieldRVsPT100AReachabilityFireability202400==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 555.988: There are 1906 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 555.988: State length is 1402, there are 1902 groups
pins2lts-mc-linux64( 0/ 8), 555.988: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 555.988: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 555.988: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 555.988: Visible groups: 0 / 1902, labels: 1 / 1906
pins2lts-mc-linux64( 0/ 8), 555.988: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 555.988: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 555.987: "ShieldRVsPT100AReachabilityFireability202400==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 555.989: "ShieldRVsPT100AReachabilityFireability202400==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 555.988: "ShieldRVsPT100AReachabilityFireability202400==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 556.126: ~11 levels ~960 states ~3936 transitions
pins2lts-mc-linux64( 0/ 8), 556.294: ~12 levels ~1920 states ~9008 transitions
pins2lts-mc-linux64( 5/ 8), 556.657: ~10 levels ~3840 states ~19712 transitions
pins2lts-mc-linux64( 5/ 8), 557.320: ~11 levels ~7680 states ~40840 transitions
pins2lts-mc-linux64( 1/ 8), 558.572: ~8 levels ~15360 states ~85600 transitions
pins2lts-mc-linux64( 1/ 8), 561.229: ~9 levels ~30720 states ~180408 transitions
pins2lts-mc-linux64( 1/ 8), 566.804: ~10 levels ~61440 states ~387712 transitions
pins2lts-mc-linux64( 1/ 8), 578.264: ~11 levels ~122880 states ~809520 transitions
pins2lts-mc-linux64( 3/ 8), 603.737: ~13 levels ~245760 states ~1786888 transitions
pins2lts-mc-linux64( 1/ 8), 654.658: ~13 levels ~491520 states ~3571816 transitions
pins2lts-mc-linux64( 1/ 8), 767.623: ~14 levels ~983040 states ~7529768 transitions
pins2lts-mc-linux64( 1/ 8), 988.929: ~15 levels ~1966080 states ~15478024 transitions
pins2lts-mc-linux64( 1/ 8), 1475.694: ~16 levels ~3932160 states ~32475640 transitions
pins2lts-mc-linux64( 1/ 8), 1535.139: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1535.258:
pins2lts-mc-linux64( 0/ 8), 1535.258: mean standard work distribution: 1.8% (states) 1.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 1535.259:
pins2lts-mc-linux64( 0/ 8), 1535.259: Explored 4044349 states 34666901 transitions, fanout: 8.572
pins2lts-mc-linux64( 0/ 8), 1535.259: Total exploration time 979.260 sec (979.150 sec minimum, 979.198 sec on average)
pins2lts-mc-linux64( 0/ 8), 1535.259: States per second: 4130, Transitions per second: 35401
pins2lts-mc-linux64( 0/ 8), 1535.259: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 1535.259:
pins2lts-mc-linux64( 0/ 8), 1535.259: Queue width: 8B, total height: 4123146, memory: 31.46MB
pins2lts-mc-linux64( 0/ 8), 1535.259: Tree memory: 318.3MB, 40.9 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1535.259: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1535.259: Stored 1932 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1535.259: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1535.259: Est. total memory use: 349.8MB (~1055.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14629924343537463505;'/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' 'ShieldRVsPT100AReachabilityFireability202400==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14629924343537463505;'/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' 'ShieldRVsPT100AReachabilityFireability202400==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:121)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-30 12:47:51] [INFO ] Flatten gal took : 109 ms
[2024-05-30 12:47:51] [INFO ] Input system was already deterministic with 1902 transitions.
[2024-05-30 12:47:51] [INFO ] Transformed 1402 places.
[2024-05-30 12:47:51] [INFO ] Transformed 1902 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 12:47:51] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15355865984183986745.gal : 11 ms
[2024-05-30 12:47:51] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7921024070630646547.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/ReachabilityFireability15355865984183986745.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7921024070630646547.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...374
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability7921024070630646547.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :16 after 40
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :40 after 76
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :76 after 162
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :162 after 306
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :306 after 612
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :612 after 2091
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2091 after 9315
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :9315 after 115585
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :115585 after 540190
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :540190 after 1.04016e+07
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :1.04016e+07 after 1.44904e+08
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :1.44904e+08 after 9.97456e+10
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :9.97456e+10 after 7.86995e+18
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :7.86995e+18 after 2.15808e+34

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
+ [[ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../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-100A"
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-100A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683762000871"
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 [ "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 ;