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

About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16190.287 3600000.00 11395734.00 3272.50 TTTTTFTTF?TT?FFT 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.r246-tall-171654350700039.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 MultiCrashLeafsetExtension-PT-S16C06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654350700039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 12 06:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 06:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.2M 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 MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2023-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716572696260

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-24 17:44:57] [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-24 17:44:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 17:44:57] [INFO ] Load time of PNML (sax parser for PT used): 369 ms
[2024-05-24 17:44:57] [INFO ] Transformed 5568 places.
[2024-05-24 17:44:57] [INFO ] Transformed 7799 transitions.
[2024-05-24 17:44:57] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 499 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (640 resets) in 3160 ms. (12 steps per ms) remains 8/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-24 17:44:59] [INFO ] Flatten gal took : 673 ms
BEST_FIRST walk for 40004 steps (172 resets) in 2087 ms. (19 steps per ms) remains 8/8 properties
[2024-05-24 17:44:59] [INFO ] Flatten gal took : 528 ms
BEST_FIRST walk for 40004 steps (172 resets) in 1033 ms. (38 steps per ms) remains 8/8 properties
[2024-05-24 17:44:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14418312157903216924.gal : 132 ms
BEST_FIRST walk for 40003 steps (172 resets) in 337 ms. (118 steps per ms) remains 8/8 properties
[2024-05-24 17:44:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7230905201925614589.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14418312157903216924.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7230905201925614589.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 ...329
BEST_FIRST walk for 40003 steps (172 resets) in 325 ms. (122 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (172 resets) in 319 ms. (125 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (172 resets) in 497 ms. (80 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (172 resets) in 341 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (172 resets) in 280 ms. (142 steps per ms) remains 8/8 properties
[2024-05-24 17:45:00] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
// Phase 1: matrix 7527 rows 5568 cols
[2024-05-24 17:45:00] [INFO ] Computed 573 invariants in 408 ms
[2024-05-24 17:45:01] [INFO ] State equation strengthened by 2178 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality7230905201925614589.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 693/939 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/939 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/939 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 7/946 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/946 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-01 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-05 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-13 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 3127/4073 variables, 214/268 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4073 variables, 0/268 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1495/5568 variables, 305/573 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5568 variables, 0/573 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13095/13095 variables, and 6141 constraints, problems are : Problem set: 5 solved, 3 unsolved in 5049 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 523/523 constraints, State Equation: 5568/5568 constraints, ReadFeed: 0/2178 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 728/793 variables, 23/25 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-05-24 17:45:06] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 21 ms to minimize.
[2024-05-24 17:45:06] [INFO ] Deduced a trap composed of 181 places in 140 ms of which 3 ms to minimize.
[2024-05-24 17:45:07] [INFO ] Deduced a trap composed of 104 places in 283 ms of which 5 ms to minimize.
[2024-05-24 17:45:07] [INFO ] Deduced a trap composed of 128 places in 267 ms of which 5 ms to minimize.
[2024-05-24 17:45:07] [INFO ] Deduced a trap composed of 222 places in 284 ms of which 4 ms to minimize.
[2024-05-24 17:45:08] [INFO ] Deduced a trap composed of 139 places in 263 ms of which 5 ms to minimize.
[2024-05-24 17:45:08] [INFO ] Deduced a trap composed of 181 places in 248 ms of which 4 ms to minimize.
[2024-05-24 17:45:08] [INFO ] Deduced a trap composed of 243 places in 250 ms of which 4 ms to minimize.
[2024-05-24 17:45:08] [INFO ] Deduced a trap composed of 265 places in 281 ms of which 5 ms to minimize.
[2024-05-24 17:45:09] [INFO ] Deduced a trap composed of 233 places in 261 ms of which 5 ms to minimize.
[2024-05-24 17:45:09] [INFO ] Deduced a trap composed of 307 places in 247 ms of which 4 ms to minimize.
[2024-05-24 17:45:09] [INFO ] Deduced a trap composed of 268 places in 248 ms of which 4 ms to minimize.
[2024-05-24 17:45:10] [INFO ] Deduced a trap composed of 254 places in 246 ms of which 4 ms to minimize.
[2024-05-24 17:45:10] [INFO ] Deduced a trap composed of 247 places in 252 ms of which 4 ms to minimize.
[2024-05-24 17:45:10] [INFO ] Deduced a trap composed of 265 places in 245 ms of which 5 ms to minimize.
[2024-05-24 17:45:10] [INFO ] Deduced a trap composed of 265 places in 246 ms of which 4 ms to minimize.
[2024-05-24 17:45:11] [INFO ] Deduced a trap composed of 258 places in 245 ms of which 5 ms to minimize.
[2024-05-24 17:45:11] [INFO ] Deduced a trap composed of 266 places in 255 ms of which 4 ms to minimize.
SMT process timed out in 10876ms, After SMT, problems are : Problem set: 5 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 65 out of 5568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Graph (complete) has 17461 edges and 5568 vertex of which 5536 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.18 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1584 transitions
Trivial Post-agglo rules discarded 1584 transitions
Performed 1584 trivial Post agglomeration. Transition count delta: 1584
Iterating post reduction 0 with 1584 rules applied. Total rules applied 1585 place count 5536 transition count 6215
Reduce places removed 1584 places and 0 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 1 with 1624 rules applied. Total rules applied 3209 place count 3952 transition count 6175
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 3249 place count 3912 transition count 6175
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 3249 place count 3912 transition count 5976
Deduced a syphon composed of 199 places in 5 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 3647 place count 3713 transition count 5976
Discarding 1415 places :
Symmetric choice reduction at 3 with 1415 rule applications. Total rules 5062 place count 2298 transition count 4561
Iterating global reduction 3 with 1415 rules applied. Total rules applied 6477 place count 2298 transition count 4561
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6477 place count 2298 transition count 4558
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 6483 place count 2295 transition count 4558
Discarding 215 places :
Symmetric choice reduction at 3 with 215 rule applications. Total rules 6698 place count 2080 transition count 3268
Iterating global reduction 3 with 215 rules applied. Total rules applied 6913 place count 2080 transition count 3268
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 6945 place count 2064 transition count 3252
Free-agglomeration rule (complex) applied 113 times.
Iterating global reduction 3 with 113 rules applied. Total rules applied 7058 place count 2064 transition count 3139
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 3 with 113 rules applied. Total rules applied 7171 place count 1951 transition count 3139
Partial Free-agglomeration rule applied 148 times.
Drop transitions (Partial Free agglomeration) removed 148 transitions
Iterating global reduction 4 with 148 rules applied. Total rules applied 7319 place count 1951 transition count 3139
Applied a total of 7319 rules in 1501 ms. Remains 1951 /5568 variables (removed 3617) and now considering 3139/7799 (removed 4660) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1521 ms. Remains : 1951/5568 places, 3139/7799 transitions.
RANDOM walk for 40000 steps (909 resets) in 730 ms. (54 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (184 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (188 resets) in 179 ms. (222 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (188 resets) in 250 ms. (159 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 57238 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 3
Probabilistic random walk after 57238 steps, saw 26147 distinct states, run finished after 3004 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-24 17:45:16] [INFO ] Flow matrix only has 2754 transitions (discarded 385 similar events)
// Phase 1: matrix 2754 rows 1951 cols
[2024-05-24 17:45:16] [INFO ] Computed 541 invariants in 77 ms
[2024-05-24 17:45:16] [INFO ] State equation strengthened by 1103 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1257/1322 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1322 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1322 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/1325 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 546/1871 variables, 436/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1871 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 10/1881 variables, 10/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1881 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 70/1951 variables, 70/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1951 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2754/4705 variables, 1951/2492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4705 variables, 1103/3595 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4705 variables, 0/3595 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/4705 variables, 0/3595 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4705/4705 variables, and 3595 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2776 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 508/508 constraints, State Equation: 1951/1951 constraints, ReadFeed: 1103/1103 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1257/1322 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1322 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:45:20] [INFO ] Deduced a trap composed of 470 places in 554 ms of which 7 ms to minimize.
[2024-05-24 17:45:20] [INFO ] Deduced a trap composed of 445 places in 549 ms of which 7 ms to minimize.
[2024-05-24 17:45:21] [INFO ] Deduced a trap composed of 574 places in 537 ms of which 7 ms to minimize.
[2024-05-24 17:45:21] [INFO ] Deduced a trap composed of 491 places in 550 ms of which 6 ms to minimize.
[2024-05-24 17:45:22] [INFO ] Deduced a trap composed of 550 places in 552 ms of which 7 ms to minimize.
[2024-05-24 17:45:22] [INFO ] Deduced a trap composed of 493 places in 552 ms of which 7 ms to minimize.
[2024-05-24 17:45:23] [INFO ] Deduced a trap composed of 509 places in 536 ms of which 6 ms to minimize.
[2024-05-24 17:45:24] [INFO ] Deduced a trap composed of 518 places in 544 ms of which 7 ms to minimize.
[2024-05-24 17:45:24] [INFO ] Deduced a trap composed of 460 places in 565 ms of which 7 ms to minimize.
[2024-05-24 17:45:25] [INFO ] Deduced a trap composed of 563 places in 570 ms of which 7 ms to minimize.
[2024-05-24 17:45:25] [INFO ] Deduced a trap composed of 400 places in 539 ms of which 7 ms to minimize.
[2024-05-24 17:45:26] [INFO ] Deduced a trap composed of 452 places in 572 ms of which 7 ms to minimize.
[2024-05-24 17:45:27] [INFO ] Deduced a trap composed of 604 places in 570 ms of which 8 ms to minimize.
[2024-05-24 17:45:27] [INFO ] Deduced a trap composed of 440 places in 568 ms of which 7 ms to minimize.
[2024-05-24 17:45:28] [INFO ] Deduced a trap composed of 539 places in 572 ms of which 7 ms to minimize.
[2024-05-24 17:45:28] [INFO ] Deduced a trap composed of 436 places in 557 ms of which 8 ms to minimize.
[2024-05-24 17:45:29] [INFO ] Deduced a trap composed of 493 places in 561 ms of which 10 ms to minimize.
[2024-05-24 17:45:30] [INFO ] Deduced a trap composed of 446 places in 559 ms of which 7 ms to minimize.
[2024-05-24 17:45:30] [INFO ] Deduced a trap composed of 439 places in 570 ms of which 8 ms to minimize.
[2024-05-24 17:45:31] [INFO ] Deduced a trap composed of 446 places in 557 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1322 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:45:31] [INFO ] Deduced a trap composed of 487 places in 557 ms of which 7 ms to minimize.
[2024-05-24 17:45:32] [INFO ] Deduced a trap composed of 505 places in 543 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1322 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:45:33] [INFO ] Deduced a trap composed of 482 places in 595 ms of which 7 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
[2024-05-24 17:45:33] [INFO ] Deduced a trap composed of 466 places in 593 ms of which 7 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :4 after 8
[2024-05-24 17:45:34] [INFO ] Deduced a trap composed of 461 places in 570 ms of which 7 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :8 after 14
[2024-05-24 17:45:34] [INFO ] Deduced a trap composed of 483 places in 565 ms of which 7 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :14 after 19
[2024-05-24 17:45:35] [INFO ] Deduced a trap composed of 492 places in 559 ms of which 7 ms to minimize.
[2024-05-24 17:45:36] [INFO ] Deduced a trap composed of 448 places in 563 ms of which 7 ms to minimize.
[2024-05-24 17:45:36] [INFO ] Deduced a trap composed of 557 places in 549 ms of which 7 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :19 after 37
[2024-05-24 17:45:37] [INFO ] Deduced a trap composed of 446 places in 571 ms of which 8 ms to minimize.
[2024-05-24 17:45:37] [INFO ] Deduced a trap composed of 438 places in 560 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1322 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1322 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/1325 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 546/1871 variables, 436/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:45:38] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-05-24 17:45:39] [INFO ] Deduced a trap composed of 175 places in 1056 ms of which 13 ms to minimize.
[2024-05-24 17:45:40] [INFO ] Deduced a trap composed of 165 places in 1051 ms of which 11 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :37 after 91
[2024-05-24 17:45:41] [INFO ] Deduced a trap composed of 263 places in 1104 ms of which 12 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :91 after 228
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :228 after 232
[2024-05-24 17:45:42] [INFO ] Deduced a trap composed of 287 places in 1123 ms of which 12 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :232 after 240
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :240 after 252
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :252 after 272
[2024-05-24 17:45:44] [INFO ] Deduced a trap composed of 320 places in 1092 ms of which 12 ms to minimize.
[2024-05-24 17:45:45] [INFO ] Deduced a trap composed of 212 places in 1101 ms of which 12 ms to minimize.
[2024-05-24 17:45:46] [INFO ] Deduced a trap composed of 285 places in 1065 ms of which 15 ms to minimize.
[2024-05-24 17:45:47] [INFO ] Deduced a trap composed of 240 places in 1138 ms of which 12 ms to minimize.
[2024-05-24 17:45:48] [INFO ] Deduced a trap composed of 253 places in 1099 ms of which 12 ms to minimize.
[2024-05-24 17:45:49] [INFO ] Deduced a trap composed of 147 places in 1080 ms of which 11 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :272 after 372
[2024-05-24 17:45:50] [INFO ] Deduced a trap composed of 391 places in 1087 ms of which 12 ms to minimize.
[2024-05-24 17:45:51] [INFO ] Deduced a trap composed of 279 places in 1081 ms of which 12 ms to minimize.
[2024-05-24 17:45:53] [INFO ] Deduced a trap composed of 296 places in 1087 ms of which 11 ms to minimize.
[2024-05-24 17:45:54] [INFO ] Deduced a trap composed of 297 places in 1100 ms of which 11 ms to minimize.
[2024-05-24 17:45:55] [INFO ] Deduced a trap composed of 214 places in 1092 ms of which 12 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :372 after 547
[2024-05-24 17:45:56] [INFO ] Deduced a trap composed of 291 places in 1112 ms of which 11 ms to minimize.
[2024-05-24 17:45:57] [INFO ] Deduced a trap composed of 289 places in 1087 ms of which 12 ms to minimize.
[2024-05-24 17:45:58] [INFO ] Deduced a trap composed of 235 places in 1095 ms of which 12 ms to minimize.
[2024-05-24 17:45:59] [INFO ] Deduced a trap composed of 281 places in 1104 ms of which 12 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1871 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:46:01] [INFO ] Deduced a trap composed of 361 places in 1033 ms of which 12 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :547 after 729
[2024-05-24 17:46:02] [INFO ] Deduced a trap composed of 434 places in 1037 ms of which 11 ms to minimize.
[2024-05-24 17:46:03] [INFO ] Deduced a trap composed of 393 places in 1034 ms of which 12 ms to minimize.
[2024-05-24 17:46:04] [INFO ] Deduced a trap composed of 341 places in 1108 ms of which 12 ms to minimize.
SMT process timed out in 47979ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 65 out of 1951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1951/1951 places, 3139/3139 transitions.
Applied a total of 0 rules in 108 ms. Remains 1951 /1951 variables (removed 0) and now considering 3139/3139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 1951/1951 places, 3139/3139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1951/1951 places, 3139/3139 transitions.
Applied a total of 0 rules in 79 ms. Remains 1951 /1951 variables (removed 0) and now considering 3139/3139 (removed 0) transitions.
[2024-05-24 17:46:04] [INFO ] Flow matrix only has 2754 transitions (discarded 385 similar events)
[2024-05-24 17:46:04] [INFO ] Invariant cache hit.
[2024-05-24 17:46:06] [INFO ] Implicit Places using invariants in 2079 ms returned [4, 7, 10, 11, 12, 13, 14, 15, 16, 20, 26, 35, 45, 57, 71, 86, 101, 102, 103, 104, 105, 106, 107, 119, 129, 137, 143, 147, 149, 164, 170, 173, 174, 175, 176, 177, 178, 179, 186, 193, 201, 211, 223, 236, 249, 250, 251, 253, 254, 255, 265, 273, 279, 286, 288, 290, 305, 311, 314, 315, 316, 317, 318, 319, 320, 322, 324, 329, 335, 343, 354, 365, 376, 377, 378, 379, 380, 381, 382, 390, 396, 400, 402, 404, 406, 421, 427, 430, 431, 432, 433, 434, 435, 436, 438, 440, 443, 447, 453, 461, 470, 479, 480, 481, 482, 483, 484, 485, 492, 496, 498, 500, 502, 504, 526, 529, 530, 531, 532, 533, 534, 535, 537, 539, 541, 544, 549, 555, 562, 570, 571, 572, 573, 574, 575, 579, 581, 583, 585, 590, 592, 607, 613, 616, 617, 618, 619, 620, 621, 622, 624, 626, 628, 630, 632, 636, 641, 646, 647, 648, 649, 650, 651, 652, 654, 656, 658, 661, 663, 665, 680, 686, 689, 690, 691, 692, 693, 694, 695, 697, 699, 701, 703, 705, 707, 710, 713, 714, 716, 717, 718, 719, 721, 726, 728, 731, 733, 735, 750, 756, 759, 761, 762, 763, 764, 765, 767, 769, 771, 773, 775, 780, 782, 785, 786, 787, 788, 789, 790, 791, 793, 795, 797, 799, 801, 803, 818, 820, 823, 826, 827, 828, 829, 830, 831, 832, 834, 836, 838, 840, 842, 844, 846, 849, 850, 851, 852, 853, 855, 857, 859, 861, 863, 867, 869, 885, 891, 894, 895, 896, 897, 898, 899, 900, 903, 905, 907, 909, 911, 913, 915, 918, 919, 920, 921, 922, 923, 924, 926, 928, 930, 932, 934, 936, 951, 957, 960, 961, 962, 963, 964, 965, 966, 968, 970, 972, 974, 976, 978, 980, 984, 985, 986, 987, 988, 989, 990, 993, 995, 997, 999, 1001, 1003, 1018, 1024, 1027, 1028, 1029, 1030, 1031, 1033, 1035, 1037, 1039, 1041, 1043, 1045, 1052, 1059, 1060, 1061, 1062, 1063, 1064, 1068, 1070, 1072, 1075, 1077, 1081, 1097, 1103, 1106, 1108, 1109, 1110, 1111, 1112, 1114, 1116, 1118, 1120, 1124, 1128, 1134, 1143, 1144, 1145, 1146, 1147, 1148, 1157, 1161, 1163, 1165, 1167, 1170, 1186, 1192, 1195, 1197, 1198, 1199, 1200, 1201, 1203, 1205, 1207, 1213, 1217, 1223, 1231, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1255, 1261, 1265, 1267, 1269, 1271, 1286, 1292, 1296, 1297, 1298, 1299, 1300, 1301, 1305, 1307, 1309, 1314, 1320, 1328, 1338, 1350, 1351, 1352, 1353, 1354, 1355, 1356, 1366, 1374, 1380, 1384, 1386, 1388, 1404, 1410, 1413, 1414, 1415, 1418, 1419, 1420, 1424, 1426, 1430, 1437, 1445, 1455, 1467, 1481, 1482, 1483, 1484, 1485, 1486, 1487, 1500, 1511, 1519, 1526, 1531, 1533, 1548, 1550, 1553, 1556, 1557, 1558, 1559, 1560, 1561, 1562, 1564, 1568, 1574, 1583, 1593, 1605, 1619, 1635, 1636, 1637, 1638, 1640, 1641, 1655, 1667, 1677, 1685, 1691, 1697, 1713]
[2024-05-24 17:46:06] [INFO ] Actually due to overlaps returned [164, 305, 421, 607, 680, 750, 818, 885, 951, 1018, 1097, 1186, 1286, 1404, 1548, 1713, 4, 10, 11, 12, 13, 14, 15, 20, 101, 102, 103, 104, 105, 106, 173, 174, 175, 176, 177, 178, 249, 250, 251, 253, 254, 314, 315, 316, 317, 318, 319, 322, 376, 377, 378, 379, 380, 381, 430, 431, 432, 433, 434, 435, 479, 480, 481, 482, 483, 484, 529, 530, 531, 532, 533, 534, 539, 570, 571, 572, 573, 574, 616, 617, 618, 619, 620, 621, 626, 646, 647, 648, 649, 650, 651, 689, 690, 691, 692, 693, 694, 699, 713, 714, 716, 717, 718, 759, 761, 762, 763, 764, 769, 785, 786, 787, 788, 789, 790, 820, 826, 827, 828, 829, 830, 831, 836, 849, 850, 851, 852, 853, 894, 895, 896, 897, 898, 899, 905, 918, 919, 920, 921, 922, 923, 960, 961, 962, 963, 964, 965, 970, 984, 985, 986, 987, 988, 989, 1027, 1028, 1029, 1030, 1031, 1037, 1059, 1060, 1061, 1062, 1063, 1106, 1108, 1109, 1110, 1111, 1116, 1143, 1144, 1145, 1146, 1147, 1195, 1197, 1198, 1199, 1200, 1205, 1241, 1242, 1243, 1244, 1245, 1246, 1296, 1297, 1298, 1299, 1300, 1307, 1350, 1351, 1352, 1353, 1354, 1355, 1413, 1414, 1415, 1418, 1419, 1426, 1481, 1482, 1483, 1484, 1485, 1486, 1550, 1556, 1557, 1558, 1559, 1560, 1561, 1568, 1635, 1636, 1637, 1638, 1640]
Discarding 225 places :
Implicit Place search using SMT only with invariants took 2097 ms to find 225 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1726/1951 places, 3139/3139 transitions.
Discarding 179 places :
Symmetric choice reduction at 0 with 179 rule applications. Total rules 179 place count 1547 transition count 2960
Iterating global reduction 0 with 179 rules applied. Total rules applied 358 place count 1547 transition count 2960
Discarding 178 places :
Symmetric choice reduction at 0 with 178 rule applications. Total rules 536 place count 1369 transition count 2782
Iterating global reduction 0 with 178 rules applied. Total rules applied 714 place count 1369 transition count 2782
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 732 place count 1351 transition count 2674
Iterating global reduction 0 with 18 rules applied. Total rules applied 750 place count 1351 transition count 2674
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 753 place count 1351 transition count 2671
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 756 place count 1348 transition count 2671
Applied a total of 756 rules in 203 ms. Remains 1348 /1726 variables (removed 378) and now considering 2671/3139 (removed 468) transitions.
[2024-05-24 17:46:06] [INFO ] Flow matrix only has 2286 transitions (discarded 385 similar events)
// Phase 1: matrix 2286 rows 1348 cols
[2024-05-24 17:46:06] [INFO ] Computed 316 invariants in 35 ms
[2024-05-24 17:46:07] [INFO ] Implicit Places using invariants in 1183 ms returned [6, 9, 18, 27, 37, 49, 63, 78, 93, 105, 115, 123, 129, 133, 135, 154, 156, 163, 170, 178, 188, 200, 213, 227, 237, 245, 251, 258, 260, 262, 271, 273, 276, 281, 287, 295, 306, 317, 327, 335, 341, 345, 347, 349, 351, 359, 361, 363, 365, 368, 372, 378, 386, 395, 403, 410, 414, 416, 418, 420, 422, 432, 435, 437, 440, 443, 448, 454, 461, 469, 473, 475, 477, 479, 484, 486, 496, 498, 500, 503, 505, 507, 511, 516, 520, 522, 524, 526, 529, 531, 533, 541, 543, 545, 548, 550, 552, 554, 557, 561, 563, 568, 570, 573, 575, 577, 586, 590, 592, 595, 597, 599, 604, 606, 608, 610, 612, 614, 616, 618, 620, 627, 629, 631, 634, 636, 638, 640, 642, 646, 648, 650, 652, 654, 658, 660, 669, 671, 674, 677, 679, 681, 683, 685, 687, 689, 691, 693, 695, 697, 699, 707, 709, 711, 714, 716, 718, 720, 722, 726, 728, 730, 732, 734, 736, 738, 746, 750, 752, 755, 757, 759, 761, 768, 775, 779, 781, 783, 786, 788, 792, 803, 807, 809, 812, 814, 818, 822, 828, 837, 846, 850, 852, 854, 856, 859, 870, 874, 876, 879, 885, 889, 895, 903, 912, 920, 926, 930, 932, 934, 936, 945, 949, 953, 956, 961, 967, 975, 985, 996, 1006, 1014, 1020, 1024, 1026, 1028, 1038, 1043, 1047, 1052, 1059, 1067, 1077, 1089, 1102, 1115, 1126, 1134, 1141, 1146, 1148, 1155, 1157, 1159, 1168, 1177, 1187, 1199, 1213, 1230, 1244, 1256, 1266, 1274, 1280, 1286]
Discarding 256 places :
Implicit Place search using SMT only with invariants took 1187 ms to find 256 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1092/1951 places, 2671/3139 transitions.
Applied a total of 0 rules in 58 ms. Remains 1092 /1092 variables (removed 0) and now considering 2671/2671 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3625 ms. Remains : 1092/1951 places, 2671/3139 transitions.
RANDOM walk for 40000 steps (955 resets) in 567 ms. (70 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (156 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (139 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (137 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 71850 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 3
Probabilistic random walk after 71850 steps, saw 31063 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 17:46:11] [INFO ] Flow matrix only has 2286 transitions (discarded 385 similar events)
// Phase 1: matrix 2286 rows 1092 cols
[2024-05-24 17:46:11] [INFO ] Computed 60 invariants in 25 ms
[2024-05-24 17:46:11] [INFO ] State equation strengthened by 1013 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 967/1032 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1032 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 3/1035 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1035 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 45/1080 variables, 25/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1080 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 10/1090 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1090 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/1092 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1092 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2286/3378 variables, 1092/1152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3378 variables, 1013/2165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3378 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/3378 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3378/3378 variables, and 2165 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1828 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 1092/1092 constraints, ReadFeed: 1013/1013 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 967/1032 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:46:13] [INFO ] Deduced a trap composed of 154 places in 439 ms of which 6 ms to minimize.
[2024-05-24 17:46:14] [INFO ] Deduced a trap composed of 187 places in 424 ms of which 6 ms to minimize.
[2024-05-24 17:46:14] [INFO ] Deduced a trap composed of 161 places in 419 ms of which 6 ms to minimize.
[2024-05-24 17:46:15] [INFO ] Deduced a trap composed of 59 places in 440 ms of which 6 ms to minimize.
[2024-05-24 17:46:15] [INFO ] Deduced a trap composed of 166 places in 413 ms of which 6 ms to minimize.
[2024-05-24 17:46:16] [INFO ] Deduced a trap composed of 168 places in 412 ms of which 6 ms to minimize.
[2024-05-24 17:46:16] [INFO ] Deduced a trap composed of 385 places in 423 ms of which 6 ms to minimize.
[2024-05-24 17:46:17] [INFO ] Deduced a trap composed of 179 places in 469 ms of which 6 ms to minimize.
[2024-05-24 17:46:17] [INFO ] Deduced a trap composed of 260 places in 458 ms of which 6 ms to minimize.
[2024-05-24 17:46:18] [INFO ] Deduced a trap composed of 293 places in 429 ms of which 6 ms to minimize.
[2024-05-24 17:46:18] [INFO ] Deduced a trap composed of 162 places in 434 ms of which 6 ms to minimize.
[2024-05-24 17:46:18] [INFO ] Deduced a trap composed of 192 places in 420 ms of which 6 ms to minimize.
[2024-05-24 17:46:19] [INFO ] Deduced a trap composed of 153 places in 426 ms of which 6 ms to minimize.
[2024-05-24 17:46:19] [INFO ] Deduced a trap composed of 224 places in 417 ms of which 6 ms to minimize.
[2024-05-24 17:46:20] [INFO ] Deduced a trap composed of 179 places in 425 ms of which 6 ms to minimize.
[2024-05-24 17:46:20] [INFO ] Deduced a trap composed of 201 places in 414 ms of which 6 ms to minimize.
[2024-05-24 17:46:21] [INFO ] Deduced a trap composed of 273 places in 427 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1032 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:46:21] [INFO ] Deduced a trap composed of 154 places in 427 ms of which 6 ms to minimize.
[2024-05-24 17:46:22] [INFO ] Deduced a trap composed of 279 places in 423 ms of which 6 ms to minimize.
[2024-05-24 17:46:22] [INFO ] Deduced a trap composed of 585 places in 426 ms of which 8 ms to minimize.
[2024-05-24 17:46:22] [INFO ] Deduced a trap composed of 151 places in 436 ms of which 6 ms to minimize.
[2024-05-24 17:46:23] [INFO ] Deduced a trap composed of 596 places in 436 ms of which 7 ms to minimize.
[2024-05-24 17:46:23] [INFO ] Deduced a trap composed of 426 places in 421 ms of which 6 ms to minimize.
[2024-05-24 17:46:24] [INFO ] Deduced a trap composed of 622 places in 421 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1032 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1032 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/1035 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:46:24] [INFO ] Deduced a trap composed of 169 places in 438 ms of which 13 ms to minimize.
[2024-05-24 17:46:25] [INFO ] Deduced a trap composed of 390 places in 439 ms of which 6 ms to minimize.
[2024-05-24 17:46:25] [INFO ] Deduced a trap composed of 177 places in 427 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1035 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1035 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 45/1080 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:46:26] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2024-05-24 17:46:26] [INFO ] Deduced a trap composed of 204 places in 431 ms of which 7 ms to minimize.
[2024-05-24 17:46:27] [INFO ] Deduced a trap composed of 249 places in 431 ms of which 6 ms to minimize.
[2024-05-24 17:46:27] [INFO ] Deduced a trap composed of 232 places in 441 ms of which 6 ms to minimize.
[2024-05-24 17:46:27] [INFO ] Deduced a trap composed of 280 places in 440 ms of which 6 ms to minimize.
[2024-05-24 17:46:28] [INFO ] Deduced a trap composed of 90 places in 424 ms of which 6 ms to minimize.
[2024-05-24 17:46:28] [INFO ] Deduced a trap composed of 212 places in 441 ms of which 7 ms to minimize.
[2024-05-24 17:46:29] [INFO ] Deduced a trap composed of 225 places in 446 ms of which 7 ms to minimize.
[2024-05-24 17:46:29] [INFO ] Deduced a trap composed of 211 places in 433 ms of which 7 ms to minimize.
[2024-05-24 17:46:30] [INFO ] Deduced a trap composed of 252 places in 428 ms of which 6 ms to minimize.
[2024-05-24 17:46:30] [INFO ] Deduced a trap composed of 254 places in 409 ms of which 6 ms to minimize.
[2024-05-24 17:46:31] [INFO ] Deduced a trap composed of 214 places in 448 ms of which 6 ms to minimize.
[2024-05-24 17:46:31] [INFO ] Deduced a trap composed of 218 places in 438 ms of which 6 ms to minimize.
[2024-05-24 17:46:32] [INFO ] Deduced a trap composed of 218 places in 423 ms of which 6 ms to minimize.
[2024-05-24 17:46:32] [INFO ] Deduced a trap composed of 262 places in 426 ms of which 6 ms to minimize.
[2024-05-24 17:46:32] [INFO ] Deduced a trap composed of 231 places in 431 ms of which 7 ms to minimize.
[2024-05-24 17:46:33] [INFO ] Deduced a trap composed of 294 places in 436 ms of which 7 ms to minimize.
[2024-05-24 17:46:33] [INFO ] Deduced a trap composed of 320 places in 451 ms of which 6 ms to minimize.
[2024-05-24 17:46:34] [INFO ] Deduced a trap composed of 282 places in 445 ms of which 7 ms to minimize.
[2024-05-24 17:46:34] [INFO ] Deduced a trap composed of 249 places in 420 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:46:35] [INFO ] Deduced a trap composed of 118 places in 462 ms of which 7 ms to minimize.
[2024-05-24 17:46:35] [INFO ] Deduced a trap composed of 161 places in 460 ms of which 7 ms to minimize.
[2024-05-24 17:46:36] [INFO ] Deduced a trap composed of 145 places in 452 ms of which 6 ms to minimize.
[2024-05-24 17:46:36] [INFO ] Deduced a trap composed of 149 places in 463 ms of which 6 ms to minimize.
[2024-05-24 17:46:37] [INFO ] Deduced a trap composed of 340 places in 469 ms of which 7 ms to minimize.
[2024-05-24 17:46:37] [INFO ] Deduced a trap composed of 144 places in 468 ms of which 6 ms to minimize.
[2024-05-24 17:46:38] [INFO ] Deduced a trap composed of 165 places in 470 ms of which 6 ms to minimize.
[2024-05-24 17:46:38] [INFO ] Deduced a trap composed of 201 places in 464 ms of which 6 ms to minimize.
[2024-05-24 17:46:39] [INFO ] Deduced a trap composed of 310 places in 436 ms of which 6 ms to minimize.
[2024-05-24 17:46:39] [INFO ] Deduced a trap composed of 213 places in 426 ms of which 6 ms to minimize.
[2024-05-24 17:46:40] [INFO ] Deduced a trap composed of 275 places in 428 ms of which 7 ms to minimize.
[2024-05-24 17:46:40] [INFO ] Deduced a trap composed of 305 places in 424 ms of which 6 ms to minimize.
[2024-05-24 17:46:41] [INFO ] Deduced a trap composed of 355 places in 429 ms of which 6 ms to minimize.
[2024-05-24 17:46:41] [INFO ] Deduced a trap composed of 249 places in 424 ms of which 6 ms to minimize.
[2024-05-24 17:46:41] [INFO ] Deduced a trap composed of 264 places in 418 ms of which 7 ms to minimize.
[2024-05-24 17:46:42] [INFO ] Deduced a trap composed of 254 places in 425 ms of which 6 ms to minimize.
[2024-05-24 17:46:42] [INFO ] Deduced a trap composed of 299 places in 453 ms of which 6 ms to minimize.
[2024-05-24 17:46:43] [INFO ] Deduced a trap composed of 288 places in 415 ms of which 6 ms to minimize.
[2024-05-24 17:46:43] [INFO ] Deduced a trap composed of 309 places in 417 ms of which 6 ms to minimize.
[2024-05-24 17:46:44] [INFO ] Deduced a trap composed of 352 places in 416 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:46:44] [INFO ] Deduced a trap composed of 237 places in 453 ms of which 6 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 131072
SDD size :729 after 2145
[2024-05-24 17:46:45] [INFO ] Deduced a trap composed of 237 places in 432 ms of which 6 ms to minimize.
[2024-05-24 17:46:45] [INFO ] Deduced a trap composed of 219 places in 466 ms of which 8 ms to minimize.
[2024-05-24 17:46:46] [INFO ] Deduced a trap composed of 250 places in 420 ms of which 6 ms to minimize.
[2024-05-24 17:46:46] [INFO ] Deduced a trap composed of 241 places in 422 ms of which 6 ms to minimize.
[2024-05-24 17:46:47] [INFO ] Deduced a trap composed of 239 places in 433 ms of which 6 ms to minimize.
[2024-05-24 17:46:47] [INFO ] Deduced a trap composed of 221 places in 444 ms of which 6 ms to minimize.
[2024-05-24 17:46:48] [INFO ] Deduced a trap composed of 247 places in 419 ms of which 6 ms to minimize.
[2024-05-24 17:46:48] [INFO ] Deduced a trap composed of 287 places in 443 ms of which 7 ms to minimize.
[2024-05-24 17:46:49] [INFO ] Deduced a trap composed of 319 places in 440 ms of which 7 ms to minimize.
[2024-05-24 17:46:49] [INFO ] Deduced a trap composed of 302 places in 426 ms of which 7 ms to minimize.
[2024-05-24 17:46:50] [INFO ] Deduced a trap composed of 305 places in 424 ms of which 7 ms to minimize.
[2024-05-24 17:46:50] [INFO ] Deduced a trap composed of 340 places in 418 ms of which 6 ms to minimize.
[2024-05-24 17:46:50] [INFO ] Deduced a trap composed of 288 places in 429 ms of which 6 ms to minimize.
[2024-05-24 17:46:51] [INFO ] Deduced a trap composed of 272 places in 450 ms of which 7 ms to minimize.
[2024-05-24 17:46:51] [INFO ] Deduced a trap composed of 247 places in 463 ms of which 7 ms to minimize.
[2024-05-24 17:46:52] [INFO ] Deduced a trap composed of 243 places in 422 ms of which 7 ms to minimize.
[2024-05-24 17:46:52] [INFO ] Deduced a trap composed of 263 places in 415 ms of which 6 ms to minimize.
[2024-05-24 17:46:53] [INFO ] Deduced a trap composed of 330 places in 442 ms of which 6 ms to minimize.
[2024-05-24 17:46:53] [INFO ] Deduced a trap composed of 368 places in 403 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:46:54] [INFO ] Deduced a trap composed of 149 places in 471 ms of which 7 ms to minimize.
[2024-05-24 17:46:54] [INFO ] Deduced a trap composed of 252 places in 471 ms of which 7 ms to minimize.
[2024-05-24 17:46:55] [INFO ] Deduced a trap composed of 148 places in 462 ms of which 7 ms to minimize.
[2024-05-24 17:46:55] [INFO ] Deduced a trap composed of 159 places in 455 ms of which 6 ms to minimize.
[2024-05-24 17:46:56] [INFO ] Deduced a trap composed of 154 places in 471 ms of which 6 ms to minimize.
[2024-05-24 17:46:56] [INFO ] Deduced a trap composed of 178 places in 493 ms of which 7 ms to minimize.
[2024-05-24 17:46:56] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 1 ms to minimize.
[2024-05-24 17:46:57] [INFO ] Deduced a trap composed of 251 places in 468 ms of which 6 ms to minimize.
[2024-05-24 17:46:57] [INFO ] Deduced a trap composed of 264 places in 413 ms of which 6 ms to minimize.
[2024-05-24 17:46:58] [INFO ] Deduced a trap composed of 335 places in 416 ms of which 6 ms to minimize.
[2024-05-24 17:46:58] [INFO ] Deduced a trap composed of 294 places in 417 ms of which 6 ms to minimize.
[2024-05-24 17:46:59] [INFO ] Deduced a trap composed of 266 places in 435 ms of which 6 ms to minimize.
[2024-05-24 17:46:59] [INFO ] Deduced a trap composed of 246 places in 417 ms of which 6 ms to minimize.
[2024-05-24 17:47:00] [INFO ] Deduced a trap composed of 164 places in 474 ms of which 6 ms to minimize.
[2024-05-24 17:47:00] [INFO ] Deduced a trap composed of 117 places in 477 ms of which 6 ms to minimize.
[2024-05-24 17:47:01] [INFO ] Deduced a trap composed of 261 places in 456 ms of which 6 ms to minimize.
[2024-05-24 17:47:01] [INFO ] Deduced a trap composed of 147 places in 437 ms of which 6 ms to minimize.
[2024-05-24 17:47:01] [INFO ] Deduced a trap composed of 405 places in 426 ms of which 6 ms to minimize.
[2024-05-24 17:47:02] [INFO ] Deduced a trap composed of 127 places in 469 ms of which 7 ms to minimize.
[2024-05-24 17:47:02] [INFO ] Deduced a trap composed of 289 places in 440 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:47:03] [INFO ] Deduced a trap composed of 120 places in 463 ms of which 7 ms to minimize.
[2024-05-24 17:47:04] [INFO ] Deduced a trap composed of 121 places in 488 ms of which 6 ms to minimize.
[2024-05-24 17:47:04] [INFO ] Deduced a trap composed of 265 places in 475 ms of which 6 ms to minimize.
[2024-05-24 17:47:05] [INFO ] Deduced a trap composed of 133 places in 493 ms of which 6 ms to minimize.
[2024-05-24 17:47:05] [INFO ] Deduced a trap composed of 160 places in 469 ms of which 7 ms to minimize.
[2024-05-24 17:47:06] [INFO ] Deduced a trap composed of 155 places in 471 ms of which 6 ms to minimize.
[2024-05-24 17:47:06] [INFO ] Deduced a trap composed of 253 places in 465 ms of which 6 ms to minimize.
[2024-05-24 17:47:07] [INFO ] Deduced a trap composed of 122 places in 477 ms of which 6 ms to minimize.
[2024-05-24 17:47:07] [INFO ] Deduced a trap composed of 127 places in 483 ms of which 7 ms to minimize.
[2024-05-24 17:47:08] [INFO ] Deduced a trap composed of 133 places in 465 ms of which 7 ms to minimize.
[2024-05-24 17:47:08] [INFO ] Deduced a trap composed of 433 places in 420 ms of which 6 ms to minimize.
[2024-05-24 17:47:09] [INFO ] Deduced a trap composed of 274 places in 421 ms of which 6 ms to minimize.
[2024-05-24 17:47:09] [INFO ] Deduced a trap composed of 348 places in 414 ms of which 6 ms to minimize.
[2024-05-24 17:47:10] [INFO ] Deduced a trap composed of 183 places in 464 ms of which 6 ms to minimize.
[2024-05-24 17:47:10] [INFO ] Deduced a trap composed of 356 places in 439 ms of which 6 ms to minimize.
[2024-05-24 17:47:10] [INFO ] Deduced a trap composed of 343 places in 398 ms of which 6 ms to minimize.
[2024-05-24 17:47:11] [INFO ] Deduced a trap composed of 293 places in 438 ms of which 7 ms to minimize.
[2024-05-24 17:47:11] [INFO ] Deduced a trap composed of 111 places in 477 ms of which 7 ms to minimize.
[2024-05-24 17:47:12] [INFO ] Deduced a trap composed of 289 places in 416 ms of which 7 ms to minimize.
[2024-05-24 17:47:12] [INFO ] Deduced a trap composed of 289 places in 426 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,8 properties remain. new max is 262144
[2024-05-24 17:47:13] [INFO ] Deduced a trap composed of 175 places in 460 ms of which 7 ms to minimize.
SDD size :2145 after 3206
[2024-05-24 17:47:13] [INFO ] Deduced a trap composed of 152 places in 451 ms of which 6 ms to minimize.
[2024-05-24 17:47:14] [INFO ] Deduced a trap composed of 295 places in 418 ms of which 6 ms to minimize.
[2024-05-24 17:47:14] [INFO ] Deduced a trap composed of 305 places in 434 ms of which 6 ms to minimize.
[2024-05-24 17:47:15] [INFO ] Deduced a trap composed of 132 places in 464 ms of which 6 ms to minimize.
[2024-05-24 17:47:15] [INFO ] Deduced a trap composed of 285 places in 423 ms of which 6 ms to minimize.
[2024-05-24 17:47:16] [INFO ] Deduced a trap composed of 302 places in 406 ms of which 7 ms to minimize.
[2024-05-24 17:47:17] [INFO ] Deduced a trap composed of 148 places in 465 ms of which 6 ms to minimize.
[2024-05-24 17:47:17] [INFO ] Deduced a trap composed of 180 places in 472 ms of which 7 ms to minimize.
[2024-05-24 17:47:18] [INFO ] Deduced a trap composed of 107 places in 461 ms of which 6 ms to minimize.
[2024-05-24 17:47:18] [INFO ] Deduced a trap composed of 280 places in 452 ms of which 7 ms to minimize.
[2024-05-24 17:47:19] [INFO ] Deduced a trap composed of 300 places in 413 ms of which 6 ms to minimize.
[2024-05-24 17:47:19] [INFO ] Deduced a trap composed of 260 places in 425 ms of which 6 ms to minimize.
[2024-05-24 17:47:19] [INFO ] Deduced a trap composed of 345 places in 444 ms of which 7 ms to minimize.
[2024-05-24 17:47:20] [INFO ] Deduced a trap composed of 257 places in 422 ms of which 7 ms to minimize.
[2024-05-24 17:47:20] [INFO ] Deduced a trap composed of 245 places in 406 ms of which 6 ms to minimize.
[2024-05-24 17:47:21] [INFO ] Deduced a trap composed of 310 places in 413 ms of which 6 ms to minimize.
[2024-05-24 17:47:21] [INFO ] Deduced a trap composed of 286 places in 412 ms of which 6 ms to minimize.
[2024-05-24 17:47:22] [INFO ] Deduced a trap composed of 358 places in 413 ms of which 6 ms to minimize.
[2024-05-24 17:47:22] [INFO ] Deduced a trap composed of 405 places in 438 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1080 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:47:23] [INFO ] Deduced a trap composed of 154 places in 473 ms of which 7 ms to minimize.
[2024-05-24 17:47:23] [INFO ] Deduced a trap composed of 143 places in 467 ms of which 7 ms to minimize.
[2024-05-24 17:47:24] [INFO ] Deduced a trap composed of 158 places in 473 ms of which 6 ms to minimize.
[2024-05-24 17:47:24] [INFO ] Deduced a trap composed of 148 places in 450 ms of which 7 ms to minimize.
[2024-05-24 17:47:25] [INFO ] Deduced a trap composed of 165 places in 460 ms of which 6 ms to minimize.
[2024-05-24 17:47:25] [INFO ] Deduced a trap composed of 373 places in 427 ms of which 7 ms to minimize.
[2024-05-24 17:47:26] [INFO ] Deduced a trap composed of 539 places in 421 ms of which 6 ms to minimize.
[2024-05-24 17:47:26] [INFO ] Deduced a trap composed of 105 places in 465 ms of which 7 ms to minimize.
[2024-05-24 17:47:27] [INFO ] Deduced a trap composed of 154 places in 485 ms of which 6 ms to minimize.
[2024-05-24 17:47:27] [INFO ] Deduced a trap composed of 425 places in 461 ms of which 6 ms to minimize.
[2024-05-24 17:47:28] [INFO ] Deduced a trap composed of 165 places in 465 ms of which 6 ms to minimize.
[2024-05-24 17:47:28] [INFO ] Deduced a trap composed of 275 places in 459 ms of which 7 ms to minimize.
SMT process timed out in 77233ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 65 out of 1092 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1092/1092 places, 2671/2671 transitions.
Applied a total of 0 rules in 67 ms. Remains 1092 /1092 variables (removed 0) and now considering 2671/2671 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1092/1092 places, 2671/2671 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1092/1092 places, 2671/2671 transitions.
Applied a total of 0 rules in 47 ms. Remains 1092 /1092 variables (removed 0) and now considering 2671/2671 (removed 0) transitions.
[2024-05-24 17:47:28] [INFO ] Flow matrix only has 2286 transitions (discarded 385 similar events)
[2024-05-24 17:47:28] [INFO ] Invariant cache hit.
[2024-05-24 17:47:29] [INFO ] Implicit Places using invariants in 775 ms returned []
[2024-05-24 17:47:29] [INFO ] Flow matrix only has 2286 transitions (discarded 385 similar events)
[2024-05-24 17:47:29] [INFO ] Invariant cache hit.
[2024-05-24 17:47:30] [INFO ] State equation strengthened by 1013 read => feed constraints.
[2024-05-24 17:47:43] [INFO ] Implicit Places using invariants and state equation in 13679 ms returned []
Implicit Place search using SMT with State Equation took 14458 ms to find 0 implicit places.
[2024-05-24 17:47:43] [INFO ] Redundant transitions in 146 ms returned []
Running 2609 sub problems to find dead transitions.
[2024-05-24 17:47:43] [INFO ] Flow matrix only has 2286 transitions (discarded 385 similar events)
[2024-05-24 17:47:43] [INFO ] Invariant cache hit.
[2024-05-24 17:47:43] [INFO ] State equation strengthened by 1013 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.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 0.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 1.0)
(s227 0.0)
(s228 0.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 0.0)
(s239 0.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 1.0)
(s370 0.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 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 1.0)
(s401 0.0)
(s402 0.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 0.0)
(s418 0.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 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 1.0)
(s434 0.0)
(s435 0.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 0.0)
(s448 0.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 0.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 0.0)
(s478 0.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 0.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 0.0)
(s531 0.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 0.0)
(s552 0.0)
(s553 1.0)
(s554 0.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 0.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 0.0)
(s576 0.0)
(s577 1.0)
(s578 0.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 0.0)
(s592 0.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 1.0)
(s601 1.0)
(s602 0.0)
(s603 0.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 0.0)
(s618 0.0)
(s619 1.0)
(s620 0.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 0.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 1.0)
(s641 1.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 0.0)
(s658 0.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 0.0)
(s670 0.0)
(s671 1.0)
(s672 0.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 0.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 0.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 1.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 1.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 1.0)
(s721 0.0)
(s722 0.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 0.0)
(s730 0.0)
(s731 1.0)
(s732 0.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 0.0)
(s744 timeout
0.0)
(s745 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1090 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2609 unsolved
SMT process timed out in 33246ms, After SMT, problems are : Problem set: 0 solved, 2609 unsolved
Search for dead transitions found 0 dead transitions in 33273ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47944 ms. Remains : 1092/1092 places, 2671/2671 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 889 edges and 1092 vertex of which 16 / 1092 are part of one of the 1 SCC in 3 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 259 transitions
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 643 transitions.
Graph (complete) has 3365 edges and 1077 vertex of which 1069 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Ensure Unique test removed 15 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 1053 transition count 1945
Reduce places removed 81 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 1 with 228 rules applied. Total rules applied 313 place count 972 transition count 1798
Reduce places removed 72 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 65 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 2 with 186 rules applied. Total rules applied 499 place count 900 transition count 1684
Reduce places removed 49 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 132 rules applied. Total rules applied 631 place count 851 transition count 1601
Reduce places removed 40 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 4 with 97 rules applied. Total rules applied 728 place count 811 transition count 1544
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 5 with 56 rules applied. Total rules applied 784 place count 787 transition count 1512
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 6 with 30 rules applied. Total rules applied 814 place count 772 transition count 1497
Reduce places removed 6 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 7 with 21 rules applied. Total rules applied 835 place count 766 transition count 1482
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 853 place count 751 transition count 1479
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 24 Pre rules applied. Total rules applied 853 place count 751 transition count 1455
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 9 with 48 rules applied. Total rules applied 901 place count 727 transition count 1455
Discarding 173 places :
Symmetric choice reduction at 9 with 173 rule applications. Total rules 1074 place count 554 transition count 1279
Iterating global reduction 9 with 173 rules applied. Total rules applied 1247 place count 554 transition count 1279
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 9 with 89 rules applied. Total rules applied 1336 place count 554 transition count 1190
Performed 247 Post agglomeration using F-continuation condition.Transition count delta: 247
Deduced a syphon composed of 247 places in 1 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 10 with 494 rules applied. Total rules applied 1830 place count 307 transition count 943
Drop transitions (Empty/Sink Transition effects.) removed 218 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 232 transitions.
Iterating post reduction 10 with 232 rules applied. Total rules applied 2062 place count 307 transition count 711
Discarding 40 places :
Symmetric choice reduction at 11 with 40 rule applications. Total rules 2102 place count 267 transition count 631
Iterating global reduction 11 with 40 rules applied. Total rules applied 2142 place count 267 transition count 631
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 15 rules applied. Total rules applied 2157 place count 267 transition count 616
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 12 with 18 rules applied. Total rules applied 2175 place count 258 transition count 682
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 12 with 37 rules applied. Total rules applied 2212 place count 258 transition count 645
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 1 rules applied. Total rules applied 2213 place count 258 transition count 644
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 2 rules applied. Total rules applied 2215 place count 257 transition count 643
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 2216 place count 256 transition count 643
Discarding 15 places :
Symmetric choice reduction at 15 with 15 rule applications. Total rules 2231 place count 241 transition count 588
Iterating global reduction 15 with 15 rules applied. Total rules applied 2246 place count 241 transition count 588
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 15 with 15 rules applied. Total rules applied 2261 place count 241 transition count 573
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2263 place count 240 transition count 592
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 2264 place count 240 transition count 591
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 2265 place count 239 transition count 591
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 17 with 13 rules applied. Total rules applied 2278 place count 239 transition count 578
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 17 with 13 rules applied. Total rules applied 2291 place count 226 transition count 578
Partial Free-agglomeration rule applied 36 times.
Drop transitions (Partial Free agglomeration) removed 36 transitions
Iterating global reduction 18 with 36 rules applied. Total rules applied 2327 place count 226 transition count 578
Partial Post-agglomeration rule applied 63 times.
Drop transitions (Partial Post agglomeration) removed 63 transitions
Iterating global reduction 18 with 63 rules applied. Total rules applied 2390 place count 226 transition count 578
Discarding 5 places :
Symmetric choice reduction at 18 with 5 rule applications. Total rules 2395 place count 221 transition count 573
Iterating global reduction 18 with 5 rules applied. Total rules applied 2400 place count 221 transition count 573
Applied a total of 2400 rules in 613 ms. Remains 221 /1092 variables (removed 871) and now considering 573/2671 (removed 2098) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 573 rows 221 cols
[2024-05-24 17:48:17] [INFO ] Computed 37 invariants in 3 ms
[2024-05-24 17:48:17] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-24 17:48:17] [INFO ] [Real]Absence check using 12 positive and 25 generalized place invariants in 3 ms returned sat
[2024-05-24 17:48:17] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 17:48:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-24 17:48:17] [INFO ] [Nat]Absence check using 12 positive and 25 generalized place invariants in 3 ms returned sat
[2024-05-24 17:48:17] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-24 17:48:17] [INFO ] After 436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-24 17:48:18] [INFO ] After 699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-24 17:48:18] [INFO ] Flatten gal took : 21 ms
[2024-05-24 17:48:18] [INFO ] Flatten gal took : 20 ms
[2024-05-24 17:48:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality776452698565939297.gal : 5 ms
[2024-05-24 17:48:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16789248889860683121.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/ReachabilityCardinality776452698565939297.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16789248889860683121.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/ReachabilityCardinality16789248889860683121.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 76
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :76 after 78
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :78 after 86
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :86 after 94
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :94 after 134
Invariant property MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-12 does not hold.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :134 after 212
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :212 after 223
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :223 after 243
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :243 after 284
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :284 after 1315
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1315 after 1492
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1492 after 4248
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4248 after 8606
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :8606 after 20463
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :20463 after 74304
Detected timeout of ITS tools.
[2024-05-24 17:48:33] [INFO ] Flatten gal took : 20 ms
[2024-05-24 17:48:33] [INFO ] Applying decomposition
[2024-05-24 17:48:33] [INFO ] Flatten gal took : 20 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/graph12342079403354914133.txt' '-o' '/tmp/graph12342079403354914133.bin' '-w' '/tmp/graph12342079403354914133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12342079403354914133.bin' '-l' '-1' '-v' '-w' '/tmp/graph12342079403354914133.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:48:33] [INFO ] Decomposing Gal with order
[2024-05-24 17:48:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:48:33] [INFO ] Removed a total of 404 redundant transitions.
[2024-05-24 17:48:33] [INFO ] Flatten gal took : 100 ms
[2024-05-24 17:48:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 12 ms.
[2024-05-24 17:48:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9957924564619916489.gal : 8 ms
[2024-05-24 17:48:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16600796211484630855.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/ReachabilityCardinality9957924564619916489.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16600796211484630855.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/ReachabilityCardinality16600796211484630855.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 92
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :92 after 110
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :110 after 166
Invariant property MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2023-07 does not hold.
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :166 after 260
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :260 after 270
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :270 after 270
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :270 after 270
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :270 after 270
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :270 after 868
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :868 after 1114
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1114 after 1620
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1620 after 4254
Invariant property MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-09 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,11597,4.14784,135200,1252,8381,18457,311936,913,83461,607,1.28263e+06,0
Total reachable state count : 11597

Verifying 2 reachability properties.
Invariant property MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2023-07 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2023-07,288,4.18027,135200,167,1329,18457,311936,979,83461,616,1.28263e+06,0
Invariant property MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-09 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-09,4,4.18324,135200,61,120,18457,311936,1000,83461,618,1.28263e+06,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 21158 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 17:48:38] [INFO ] Flatten gal took : 218 ms
[2024-05-24 17:48:38] [INFO ] Applying decomposition
[2024-05-24 17:48:38] [INFO ] Flatten gal took : 268 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/graph15210866270843942272.txt' '-o' '/tmp/graph15210866270843942272.bin' '-w' '/tmp/graph15210866270843942272.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15210866270843942272.bin' '-l' '-1' '-v' '-w' '/tmp/graph15210866270843942272.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:48:38] [INFO ] Decomposing Gal with order
[2024-05-24 17:48:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:48:40] [INFO ] Removed a total of 4589 redundant transitions.
[2024-05-24 17:48:40] [INFO ] Flatten gal took : 687 ms
[2024-05-24 17:48:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 339 labels/synchronizations in 106 ms.
[2024-05-24 17:48:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16676059296701068986.gal : 60 ms
[2024-05-24 17:48:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17773830108583095099.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/ReachabilityCardinality16676059296701068986.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17773830108583095099.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/ReachabilityCardinality17773830108583095099.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 131072
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 262144
SDD size :1 after 324
SDD proceeding with computation,3 properties remain. new max is 524288
SDD size :324 after 341
SDD proceeding with computation,3 properties remain. new max is 1048576
SDD size :341 after 341
SDD proceeding with computation,3 properties remain. new max is 2097152
SDD size :341 after 372
SDD proceeding with computation,3 properties remain. new max is 4194304
SDD size :372 after 403
SDD proceeding with computation,3 properties remain. new max is 8388608
SDD size :403 after 403
ITS-tools command line returned an error code 137
[2024-05-24 18:03:09] [INFO ] Flatten gal took : 66 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10102337081532737279
[2024-05-24 18:03:09] [INFO ] Too many transitions (2671) to apply POR reductions. Disabling POR matrices.
[2024-05-24 18:03:09] [INFO ] Applying decomposition
[2024-05-24 18:03:09] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10102337081532737279
Running compilation step : cd /tmp/ltsmin10102337081532737279;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' '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-24 18:03:09] [INFO ] Flatten gal took : 82 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/graph1915502532734928484.txt' '-o' '/tmp/graph1915502532734928484.bin' '-w' '/tmp/graph1915502532734928484.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1915502532734928484.bin' '-l' '-1' '-v' '-w' '/tmp/graph1915502532734928484.weights' '-q' '0' '-e' '0.001'
[2024-05-24 18:03:09] [INFO ] Decomposing Gal with order
[2024-05-24 18:03:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 18:03:09] [INFO ] Removed a total of 2752 redundant transitions.
[2024-05-24 18:03:09] [INFO ] Flatten gal took : 267 ms
[2024-05-24 18:03:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 1678 labels/synchronizations in 134 ms.
[2024-05-24 18:03:09] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16201123690582945849.gal : 24 ms
[2024-05-24 18:03:09] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9830353225931819635.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/ReachabilityFireability16201123690582945849.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9830353225931819635.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/ReachabilityFireability9830353225931819635.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 46
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :46 after 47
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :47 after 49
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :49 after 50
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :50 after 58
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :58 after 70
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :70 after 84
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :84 after 221
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :221 after 522
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :522 after 626
Compilation finished in 7382 ms.
Running link step : cd /tmp/ltsmin10102337081532737279;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin10102337081532737279;'/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' 'MultiCrashLeafsetExtensionPTS16C06ReachabilityFireability202307==true'
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :626 after 1312
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1312 after 2755
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :2755 after 4372
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :4372 after 9002
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :9002 after 16215
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin10102337081532737279;'/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' 'MultiCrashLeafsetExtensionPTS16C06ReachabilityFireability202307==true'
Running LTSmin : cd /tmp/ltsmin10102337081532737279;'/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' 'MultiCrashLeafsetExtensionPTS16C06ReachabilityFireability202409==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin10102337081532737279;'/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' 'MultiCrashLeafsetExtensionPTS16C06ReachabilityFireability202409==true'
Running LTSmin : cd /tmp/ltsmin10102337081532737279;'/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' 'MultiCrashLeafsetExtensionPTS16C06ReachabilityFireability202412==true'
SDD proceeding with computation,3 properties remain. new max is 131072
SDD size :16215 after 38877
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin10102337081532737279;'/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' 'MultiCrashLeafsetExtensionPTS16C06ReachabilityFireability202412==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin10102337081532737279;'/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' 'MultiCrashLeafsetExtensionPTS16C06ReachabilityFireability202307==true'
Detected timeout of ITS tools.
[2024-05-24 18:29:13] [INFO ] Applying decomposition
[2024-05-24 18:29:14] [INFO ] Flatten gal took : 136 ms
[2024-05-24 18:29:14] [INFO ] Decomposing Gal with order
[2024-05-24 18:29:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 18:29:14] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to Node0IsTheNodeMaster in partition [ThereIsAMasterInTheLeafSet, Node0HasDetectedCrashOfNode3, RequestOfNode0IsSentToLx0, RequestOfNode0IsSentToRx0, RequestOfNode0IsSentToLx1, RequestOfNode0IsSentToRx1, RequestOfNode0IsSentToLx2, RequestOfNode0IsSentToRx2, RequestOfNode0IsSentToLx3, RequestOfNode0IsSentToRx3, RequestOfNode0IsSentToRx4, RequestOfNode0IsSentToLx5, RequestOfNode0IsSentToRx5, Node1WantsToManageTheCrashOfNode3, Node1HasDetectedCrashOfNode13, Node2ManageTheCrashOfNode7, Node3NotifyThatHeIsActive, Node3ManageTheCrashOfNode10, Node3HasDetectedCrashOfNode10, NoNodeManageTheCrashOfNode3, Node4ManageTheCrashOfNode5, Node4ManageTheCrashOfNode6, Node4HasDetectedCrashOfNode6, Node4HasDetectedCrashOfNode14, RequestOfNode4IsSentToLx4, Node5HasDetectedCrashOfNode3, Node5ManageTheCrashOfNode13, Node6HasAskedItsLeafSetToRx2ToReplaceNode9, Node6HasDetectedCrashOfNode11, Node6ManageTheCrashOfNode13, Node7HasAskedItsLeafSetToLx1ToReplaceNode0, Node7HasDetectedCrashOfNode3, Node7HasDetectedCrashOfNode6, Node9ManageTheCrashOfNode1, Node10ManageTheCrashOfNode8, Node11HasAskedItsLeafSetToLx5ToReplaceNode0, Node11HasDetectedCrashOfNode3, Node11HasDetectedCrashOfNode7, Node11ManageTheCrashOfNode13, Node12HasDetectedCrashOfNode3, Node12HasAskedItsLeafSetToRx0ToReplaceNode8, Node12HasDetectedCrashOfNode9, Node12ManageTheCrashOfNode15, Node12HasDetectedCrashOfNode15, Node13HasAskedItsLeafSetToLx1ToReplaceNode0, Node13HasDetectedCrashOfNode3, Node13HasDetectedCrashOfNode4, Node14HasDetectedCrashOfNode0, Node14HasDetectedCrashOfNode3, Node15HasDetectedCrashOfNode0, Node16HasDetectedCrashOfNode6, Lx4HasReceivedTheRequestOfNode0],[CrashReservoir, NoCrashIsHappening, Node0IsActive, Node0AsksIsThereANodeMaster, Node0HasDetectedCrashOfNode1, Node0HasDetectedCrashOfNode9, Node1NotifyThatHeIsActive, Node1HasDetectedCrashOfNode9, Node1HasAskedItsLeafSetToRx3ToReplaceNode9, Node2NotifyThatHeIsActive, NodesCanDetectThatNode2HasCrashed, Node2DontAnswerToAnyNode, Node3DontAnswerToAnyNode, Node4HasDetectedCrashOfNode0, Node4HasDetectedCrashOfNode5, Node4HasDetectedCrashOfNode9, Node5NotifyThatHeIsActive, Node5HasDetectedCrashOfNode13, Node6NotifyThatHeIsActive, NodesCanDetectThatNode6HasCrashed, Node6HasDetectedCrashOfNode9, Node6HasDetectedCrashOfNode13, Node7NotifyThatHeIsActive, Node7HasDetectedCrashOfNode0, Node8IsActive, Node8HasDetectedCrashOfNode9, Node9NotifyThatHeIsActive, Node9HasDetectedCrashOfNode1, Node10NotifyThatHeIsActive, NodesCanDetectThatNode10HasCrashed, Node10HasDetectedCrashOfNode8, Node10DontAnswerToAnyNode, Node11NotifyThatHeIsActive, Node11HasDetectedCrashOfNode0, Node11HasDetectedCrashOfNode8, Node11HasDetectedCrashOfNode13, Node12NotifyThatHeIsActive, Node12HasDetectedCrashOfNode0, Node12HasDetectedCrashOfNode8, Node13NotifyThatHeIsActive, Node13HasDetectedCrashOfNode0, Node14NotifyThatHeIsActive, NodesCanDetectThatNode14HasCrashed, Node14AsksIsThereANodeMaster, Node15NotifyThatHeIsActive, NodesCanDetectThatNode15HasCrashed, Node15HasDetectedCrashOfNode1, Node16IsActive, Node16HasDetectedCrashOfNode8, Lx4IsActiveAndNotInTheLeafSet, Lx5IsActiveAndNotInTheLeafSet, Lx5IsAtTheLeftExtremityOfTheLeafSet, Rx5IsActiveAndNotInTheLeafSet],[Node4IsActive, Node4NotifyThatHeIsActive, NodesCanDetectThatNode4HasCrashed],[Node0ManageTheCrashOfNode9, Node0HasDetectedCrashOfNode10, Node0ThinksNode14ShouldBeNodeMasterToReplaceNode10],[Node1HasDetectedCrashOfNode3, Node1ThinksNode14ShouldBeNodeMasterToReplaceNode3],[Node2HasDetectedCrashOfNode7, Node2ThinksNode10ShouldBeNodeMasterToReplaceNode7],[Node2HasDetectedCrashOfNode9, Node2ThinksNode4ShouldBeNodeMasterToReplaceNode9],[Node3HasDetectedCrashOfNode9, Node3ThinksNode4ShouldBeNodeMasterToReplaceNode9],[Node4IsTheNodeMaster, Node16IsTheNodeMaster, Node16ThinksNode4ShouldBeNodeMasterToReplaceNode6],[Node14HasDetectedCrashOfNode9, Node14ThinksNode12ShouldBeNodeMasterToReplaceNode9],[Node15HasAskedItsLeafSetToLx3ToReplaceNode1, Node15HasDetectedCrashOfNode3, Node15ThinksNode2ShouldBeNodeMasterToReplaceNode3],[Node15HasDetectedCrashOfNode9, Node15ThinksNode7ShouldBeNodeMasterToReplaceNode9],[Node15HasDetectedCrashOfNode10, Node15ThinksNode6ShouldBeNodeMasterToReplaceNode10],[Node15HasDetectedCrashOfNode12, Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12],[Node15HasDetectedCrashOfNode13, Node15ThinksNode3ShouldBeNodeMasterToReplaceNode13],[Node16HasDetectedCrashOfNode12, Node16ThinksNode15ShouldBeNodeMasterToReplaceNode12],[Node8ManageTheCrashOfNode14, Node8HasDetectedCrashOfNode14],[RequestOfNode8IsSentToRx5, LeafSetOfRx5IsSentToNode8],[Node8HasAskedItsLeafSetToRx5ToReplaceNode9, Node8HasAskedItsLeafSetToRx5ToReplaceNode14, ANodeFromTheLeafSetOfRx5IsACtiveInTheLeafSet],[Rx4IsActiveAndNotInTheLeafSet, Rx5IsAtTheRightExtremityOfTheLeafSet],[Node1HasAskedItsLeafSetToRx3ToReplaceNode13, Node1HasTheLeafSetOfRx3ToReplaceNode13, RequestOfNode1IsSentToRx3, ANodeFromTheLeafSetOfRx3IsACtiveInTheLeafSet],[Node4HasAskedItsLeafSetToRx0ToReplaceNode9, Rx0IsAtTheRightExtremityOfTheLeafSet, Rx1IsAtTheRightExtremityOfTheLeafSet],[Rx1IsActiveAndNotInTheLeafSet, Rx2IsActiveAndNotInTheLeafSet, Rx2IsAtTheRightExtremityOfTheLeafSet, Rx3IsAtTheRightExtremityOfTheLeafSet],[Rx3IsActiveAndNotInTheLeafSet, Rx4IsAtTheRightExtremityOfTheLeafSet],[Node6HasAskedItsLeafSetToRx2ToReplaceNode11, Node6HasTheLeafSetOfRx2ToReplaceNode11, RequestOfNode6IsSentToRx2, ANodeFromTheLeafSetOfRx2IsACtiveInTheLeafSet],[Node16ManageTheCrashOfNode14, Node16HasDetectedCrashOfNode14],[RequestOfNode16IsSentToRx4, LeafSetOfRx4IsSentToNode16],[Node16HasAskedItsLeafSetToRx4ToReplaceNode8, Node16HasAskedItsLeafSetToRx4ToReplaceNode14, ANodeFromTheLeafSetOfRx4IsACtiveInTheLeafSet],[Node11HasAskedItsLeafSetToLx5ToReplaceNode7, Node11HasTheLeafSetOfLx5ToReplaceNode7, RequestOfNode11IsSentToLx5, ANodeFromTheLeafSetOfLx5IsACtiveInTheLeafSet],[Node14ManageTheCrashOfNode1, Node14HasDetectedCrashOfNode1, Node14HasAskedItsLeafSetToLx0ToReplaceNode1],[Node14HasAskedItsLeafSetToLx0ToReplaceNode0, RequestOfNode14IsSentToLx0, LeafSetOfLx0IsSentToNode14, ANodeFromTheLeafSetOfLx0IsACtiveInTheLeafSet],[Node4ManageTheCrashOfNode0, Node4HasDetectedCrashOfNode3],[Lx0IsAtTheLeftExtremityOfTheLeafSet, Lx1IsAtTheLeftExtremityOfTheLeafSet],[Lx1IsActiveAndNotInTheLeafSet, Lx2IsAtTheLeftExtremityOfTheLeafSet],[Lx2IsActiveAndNotInTheLeafSet, Lx3IsActiveAndNotInTheLeafSet, Lx3IsAtTheLeftExtremityOfTheLeafSet, Lx4IsAtTheLeftExtremityOfTheLeafSet],[Node15HasAskedItsLeafSetToLx3ToReplaceNode0, Node15HasTheLeafSetOfLx3ToReplaceNode0, RequestOfNode15IsSentToLx3, ANodeFromTheLeafSetOfLx3IsACtiveInTheLeafSet],[Node12ManageTheCrashOfNode5, Node12HasDetectedCrashOfNode5, Node12HasAskedItsLeafSetToLx1ToReplaceNode5],[RequestOfNode12IsSentToLx1, LeafSetOfLx1IsSentToNode12],[Node7HasAskedItsLeafSetToLx1ToReplaceNode6, Node7HasTheLeafSetOfLx1ToReplaceNode6, RequestOfNode7IsSentToLx1, Node12HasAskedItsLeafSetToLx1ToReplaceNode0, Node13HasAskedItsLeafSetToLx1ToReplaceNode4, Node13HasTheLeafSetOfLx1ToReplaceNode4, RequestOfNode13IsSentToLx1, ANodeFromTheLeafSetOfLx1IsACtiveInTheLeafSet],[Node11ManageTheCrashOfNode15, Node11HasDetectedCrashOfNode15, Node11HasAskedItsLeafSetToRx0ToReplaceNode15],[RequestOfNode11IsSentToRx0, LeafSetOfRx0IsSentToNode11],[Node4HasAskedItsLeafSetToRx0ToReplaceNode14, Node4HasTheLeafSetOfRx0ToReplaceNode14, RequestOfNode4IsSentToRx0, Node11HasAskedItsLeafSetToRx0ToReplaceNode8, Node12HasAskedItsLeafSetToRx0ToReplaceNode9, Node12HasTheLeafSetOfRx0ToReplaceNode9, RequestOfNode12IsSentToRx0, ANodeFromTheLeafSetOfRx0IsACtiveInTheLeafSet],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1234)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 18:29:14] [INFO ] Flatten gal took : 137 ms
[2024-05-24 18:29:14] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14502065128609267045.gal : 28 ms
[2024-05-24 18:29:14] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16077633602462295181.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/ReachabilityFireability14502065128609267045.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16077633602462295181.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityFireability16077633602462295181.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :8 after 18
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :18 after 31
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :31 after 50
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :50 after 97
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :97 after 114
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :114 after 196
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :196 after 415
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :415 after 609
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :609 after 715
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :715 after 944
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :944 after 1060
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1060 after 5200
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :5200 after 8509
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :8509 after 10287
LTSmin run took 1298296 ms.
Invariant validated
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2023-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin10102337081532737279;'/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' 'MultiCrashLeafsetExtensionPTS16C06ReachabilityFireability202409==true'

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="MultiCrashLeafsetExtension-PT-S16C06"
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 MultiCrashLeafsetExtension-PT-S16C06, 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 r246-tall-171654350700039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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