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-171654350700015.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-S16C03, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654350700015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 07:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 07:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 12 07:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 07:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:52 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 3.5M 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-S16C03-ReachabilityFireability-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716565533244

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-S16C03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-24 15:45:34] [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 15:45:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:45:34] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2024-05-24 15:45:34] [INFO ] Transformed 3606 places.
[2024-05-24 15:45:34] [INFO ] Transformed 5141 transitions.
[2024-05-24 15:45:34] [INFO ] Parsed PT model containing 3606 places and 5141 transitions and 20838 arcs in 423 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1265 resets) in 2605 ms. (15 steps per ms) remains 12/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (320 resets) in 651 ms. (61 steps per ms) remains 12/12 properties
[2024-05-24 15:45:36] [INFO ] Flatten gal took : 579 ms
BEST_FIRST walk for 40003 steps (320 resets) in 1286 ms. (31 steps per ms) remains 11/12 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-24 15:45:36] [INFO ] Flatten gal took : 255 ms
BEST_FIRST walk for 40003 steps (319 resets) in 391 ms. (102 steps per ms) remains 11/11 properties
[2024-05-24 15:45:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8122006277667499409.gal : 173 ms
[2024-05-24 15:45:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8018835124622428335.prop : 3 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/ReachabilityCardinality8122006277667499409.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8018835124622428335.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (320 resets) in 368 ms. (108 steps per ms) remains 11/11 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40003 steps (320 resets) in 1297 ms. (30 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (320 resets) in 448 ms. (89 steps per ms) remains 10/11 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (320 resets) in 398 ms. (100 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality8018835124622428335.prop.
BEST_FIRST walk for 40003 steps (320 resets) in 321 ms. (124 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (320 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (320 resets) in 249 ms. (160 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (320 resets) in 338 ms. (118 steps per ms) remains 10/10 properties
[2024-05-24 15:45:37] [INFO ] Flow matrix only has 4869 transitions (discarded 272 similar events)
// Phase 1: matrix 4869 rows 3606 cols
[2024-05-24 15:45:38] [INFO ] Computed 459 invariants in 557 ms
[2024-05-24 15:45:38] [INFO ] State equation strengthened by 1362 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 647/930 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/930 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/930 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 10/940 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-14 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 1933/2873 variables, 196/251 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2873 variables, 0/251 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 733/3606 variables, 208/459 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3606 variables, 0/459 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 4869/8475 variables, 3606/4065 constraints. Problems are: Problem set: 5 solved, 5 unsolved
SMT process timed out in 5989ms, After SMT, problems are : Problem set: 5 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 183 out of 3606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3606/3606 places, 5141/5141 transitions.
Graph (complete) has 12103 edges and 3606 vertex of which 3580 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.17 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 672 transitions
Trivial Post-agglo rules discarded 672 transitions
Performed 672 trivial Post agglomeration. Transition count delta: 672
Iterating post reduction 0 with 672 rules applied. Total rules applied 673 place count 3580 transition count 4469
Reduce places removed 672 places and 0 transitions.
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Iterating post reduction 1 with 799 rules applied. Total rules applied 1472 place count 2908 transition count 4342
Reduce places removed 127 places and 0 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 1599 place count 2781 transition count 4342
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 1599 place count 2781 transition count 4256
Deduced a syphon composed of 86 places in 3 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 1771 place count 2695 transition count 4256
Discarding 680 places :
Symmetric choice reduction at 3 with 680 rule applications. Total rules 2451 place count 2015 transition count 3576
Iterating global reduction 3 with 680 rules applied. Total rules applied 3131 place count 2015 transition count 3576
Discarding 190 places :
Symmetric choice reduction at 3 with 190 rule applications. Total rules 3321 place count 1825 transition count 3006
Iterating global reduction 3 with 190 rules applied. Total rules applied 3511 place count 1825 transition count 3006
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 3531 place count 1815 transition count 2996
Free-agglomeration rule (complex) applied 76 times.
Iterating global reduction 3 with 76 rules applied. Total rules applied 3607 place count 1815 transition count 2920
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 3 with 76 rules applied. Total rules applied 3683 place count 1739 transition count 2920
Partial Free-agglomeration rule applied 86 times.
Drop transitions (Partial Free agglomeration) removed 86 transitions
Iterating global reduction 4 with 86 rules applied. Total rules applied 3769 place count 1739 transition count 2920
Applied a total of 3769 rules in 1466 ms. Remains 1739 /3606 variables (removed 1867) and now considering 2920/5141 (removed 2221) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1476 ms. Remains : 1739/3606 places, 2920/5141 transitions.
RANDOM walk for 40000 steps (1733 resets) in 718 ms. (55 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (344 resets) in 468 ms. (85 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (344 resets) in 194 ms. (205 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (344 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (336 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (344 resets) in 135 ms. (294 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 58640 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 5
Probabilistic random walk after 58640 steps, saw 26795 distinct states, run finished after 3004 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-24 15:45:48] [INFO ] Flow matrix only has 2572 transitions (discarded 348 similar events)
// Phase 1: matrix 2572 rows 1739 cols
[2024-05-24 15:45:48] [INFO ] Computed 433 invariants in 30 ms
[2024-05-24 15:45:48] [INFO ] State equation strengthened by 982 read => feed constraints.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 3
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :3 after 6
At refinement iteration 3 (OVERLAPS) 1014/1197 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1197 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1197 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/1198 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :6 after 9
At refinement iteration 7 (INCLUDED_ONLY) 0/1198 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 450/1648 variables, 302/342 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1648 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/1652 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1652 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 87/1739 variables, 87/433 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1739 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :9 after 25
At refinement iteration 14 (OVERLAPS) 2572/4311 variables, 1739/2172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4311 variables, 982/3154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :25 after 39
At refinement iteration 16 (INCLUDED_ONLY) 0/4311 variables, 0/3154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/4311 variables, 0/3154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4311/4311 variables, and 3154 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4273 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 400/400 constraints, State Equation: 1739/1739 constraints, ReadFeed: 982/982 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1014/1197 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1197 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:45:54] [INFO ] Deduced a trap composed of 301 places in 597 ms of which 83 ms to minimize.
[2024-05-24 15:45:54] [INFO ] Deduced a trap composed of 327 places in 513 ms of which 7 ms to minimize.
[2024-05-24 15:45:55] [INFO ] Deduced a trap composed of 219 places in 458 ms of which 6 ms to minimize.
[2024-05-24 15:45:55] [INFO ] Deduced a trap composed of 350 places in 438 ms of which 7 ms to minimize.
[2024-05-24 15:45:56] [INFO ] Deduced a trap composed of 185 places in 486 ms of which 6 ms to minimize.
[2024-05-24 15:45:56] [INFO ] Deduced a trap composed of 302 places in 465 ms of which 6 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :39 after 124
[2024-05-24 15:45:57] [INFO ] Deduced a trap composed of 360 places in 446 ms of which 6 ms to minimize.
[2024-05-24 15:45:57] [INFO ] Deduced a trap composed of 247 places in 445 ms of which 6 ms to minimize.
[2024-05-24 15:45:58] [INFO ] Deduced a trap composed of 272 places in 514 ms of which 6 ms to minimize.
[2024-05-24 15:45:58] [INFO ] Deduced a trap composed of 294 places in 473 ms of which 6 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :124 after 155
[2024-05-24 15:45:59] [INFO ] Deduced a trap composed of 252 places in 444 ms of which 7 ms to minimize.
[2024-05-24 15:45:59] [INFO ] Deduced a trap composed of 391 places in 455 ms of which 7 ms to minimize.
[2024-05-24 15:46:00] [INFO ] Deduced a trap composed of 214 places in 465 ms of which 6 ms to minimize.
[2024-05-24 15:46:00] [INFO ] Deduced a trap composed of 343 places in 468 ms of which 7 ms to minimize.
[2024-05-24 15:46:01] [INFO ] Deduced a trap composed of 211 places in 449 ms of which 5 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :155 after 178
[2024-05-24 15:46:01] [INFO ] Deduced a trap composed of 330 places in 458 ms of which 6 ms to minimize.
[2024-05-24 15:46:01] [INFO ] Deduced a trap composed of 236 places in 427 ms of which 6 ms to minimize.
[2024-05-24 15:46:02] [INFO ] Deduced a trap composed of 335 places in 441 ms of which 6 ms to minimize.
[2024-05-24 15:46:02] [INFO ] Deduced a trap composed of 345 places in 429 ms of which 6 ms to minimize.
[2024-05-24 15:46:03] [INFO ] Deduced a trap composed of 276 places in 452 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1197 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :178 after 358
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :358 after 366
[2024-05-24 15:46:03] [INFO ] Deduced a trap composed of 328 places in 446 ms of which 6 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :366 after 382
[2024-05-24 15:46:04] [INFO ] Deduced a trap composed of 380 places in 448 ms of which 7 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :382 after 406
[2024-05-24 15:46:04] [INFO ] Deduced a trap composed of 318 places in 453 ms of which 6 ms to minimize.
[2024-05-24 15:46:05] [INFO ] Deduced a trap composed of 392 places in 429 ms of which 5 ms to minimize.
[2024-05-24 15:46:05] [INFO ] Deduced a trap composed of 344 places in 438 ms of which 8 ms to minimize.
[2024-05-24 15:46:06] [INFO ] Deduced a trap composed of 395 places in 425 ms of which 6 ms to minimize.
[2024-05-24 15:46:06] [INFO ] Deduced a trap composed of 321 places in 426 ms of which 6 ms to minimize.
[2024-05-24 15:46:07] [INFO ] Deduced a trap composed of 326 places in 426 ms of which 5 ms to minimize.
[2024-05-24 15:46:07] [INFO ] Deduced a trap composed of 295 places in 425 ms of which 6 ms to minimize.
[2024-05-24 15:46:07] [INFO ] Deduced a trap composed of 403 places in 424 ms of which 5 ms to minimize.
[2024-05-24 15:46:08] [INFO ] Deduced a trap composed of 312 places in 449 ms of which 6 ms to minimize.
[2024-05-24 15:46:08] [INFO ] Deduced a trap composed of 359 places in 447 ms of which 5 ms to minimize.
[2024-05-24 15:46:09] [INFO ] Deduced a trap composed of 347 places in 439 ms of which 6 ms to minimize.
[2024-05-24 15:46:09] [INFO ] Deduced a trap composed of 305 places in 454 ms of which 7 ms to minimize.
[2024-05-24 15:46:10] [INFO ] Deduced a trap composed of 340 places in 456 ms of which 11 ms to minimize.
[2024-05-24 15:46:10] [INFO ] Deduced a trap composed of 350 places in 446 ms of which 6 ms to minimize.
[2024-05-24 15:46:11] [INFO ] Deduced a trap composed of 312 places in 457 ms of which 6 ms to minimize.
[2024-05-24 15:46:11] [INFO ] Deduced a trap composed of 311 places in 455 ms of which 6 ms to minimize.
[2024-05-24 15:46:12] [INFO ] Deduced a trap composed of 354 places in 450 ms of which 6 ms to minimize.
[2024-05-24 15:46:12] [INFO ] Deduced a trap composed of 363 places in 447 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1197 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:46:13] [INFO ] Deduced a trap composed of 334 places in 434 ms of which 5 ms to minimize.
[2024-05-24 15:46:13] [INFO ] Deduced a trap composed of 344 places in 421 ms of which 6 ms to minimize.
[2024-05-24 15:46:14] [INFO ] Deduced a trap composed of 405 places in 420 ms of which 5 ms to minimize.
[2024-05-24 15:46:14] [INFO ] Deduced a trap composed of 368 places in 418 ms of which 6 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 16384
[2024-05-24 15:46:15] [INFO ] Deduced a trap composed of 385 places in 427 ms of which 5 ms to minimize.
SDD size :406 after 599
[2024-05-24 15:46:15] [INFO ] Deduced a trap composed of 393 places in 432 ms of which 6 ms to minimize.
[2024-05-24 15:46:16] [INFO ] Deduced a trap composed of 399 places in 428 ms of which 6 ms to minimize.
[2024-05-24 15:46:16] [INFO ] Deduced a trap composed of 341 places in 448 ms of which 6 ms to minimize.
[2024-05-24 15:46:16] [INFO ] Deduced a trap composed of 328 places in 446 ms of which 5 ms to minimize.
[2024-05-24 15:46:17] [INFO ] Deduced a trap composed of 341 places in 450 ms of which 5 ms to minimize.
[2024-05-24 15:46:17] [INFO ] Deduced a trap composed of 388 places in 450 ms of which 6 ms to minimize.
[2024-05-24 15:46:18] [INFO ] Deduced a trap composed of 335 places in 462 ms of which 6 ms to minimize.
[2024-05-24 15:46:18] [INFO ] Deduced a trap composed of 385 places in 458 ms of which 6 ms to minimize.
[2024-05-24 15:46:19] [INFO ] Deduced a trap composed of 330 places in 429 ms of which 5 ms to minimize.
[2024-05-24 15:46:19] [INFO ] Deduced a trap composed of 368 places in 479 ms of which 6 ms to minimize.
[2024-05-24 15:46:20] [INFO ] Deduced a trap composed of 370 places in 501 ms of which 13 ms to minimize.
[2024-05-24 15:46:20] [INFO ] Deduced a trap composed of 419 places in 447 ms of which 6 ms to minimize.
[2024-05-24 15:46:21] [INFO ] Deduced a trap composed of 384 places in 407 ms of which 6 ms to minimize.
[2024-05-24 15:46:21] [INFO ] Deduced a trap composed of 390 places in 420 ms of which 6 ms to minimize.
[2024-05-24 15:46:22] [INFO ] Deduced a trap composed of 393 places in 433 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1197 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:46:22] [INFO ] Deduced a trap composed of 250 places in 420 ms of which 5 ms to minimize.
[2024-05-24 15:46:23] [INFO ] Deduced a trap composed of 343 places in 431 ms of which 6 ms to minimize.
[2024-05-24 15:46:23] [INFO ] Deduced a trap composed of 388 places in 447 ms of which 6 ms to minimize.
[2024-05-24 15:46:24] [INFO ] Deduced a trap composed of 350 places in 454 ms of which 6 ms to minimize.
[2024-05-24 15:46:24] [INFO ] Deduced a trap composed of 411 places in 437 ms of which 6 ms to minimize.
[2024-05-24 15:46:25] [INFO ] Deduced a trap composed of 434 places in 443 ms of which 6 ms to minimize.
[2024-05-24 15:46:25] [INFO ] Deduced a trap composed of 367 places in 431 ms of which 6 ms to minimize.
[2024-05-24 15:46:26] [INFO ] Deduced a trap composed of 359 places in 425 ms of which 5 ms to minimize.
[2024-05-24 15:46:26] [INFO ] Deduced a trap composed of 414 places in 368 ms of which 6 ms to minimize.
[2024-05-24 15:46:26] [INFO ] Deduced a trap composed of 420 places in 381 ms of which 6 ms to minimize.
[2024-05-24 15:46:27] [INFO ] Deduced a trap composed of 297 places in 454 ms of which 6 ms to minimize.
[2024-05-24 15:46:27] [INFO ] Deduced a trap composed of 319 places in 424 ms of which 6 ms to minimize.
[2024-05-24 15:46:28] [INFO ] Deduced a trap composed of 344 places in 432 ms of which 6 ms to minimize.
[2024-05-24 15:46:28] [INFO ] Deduced a trap composed of 350 places in 426 ms of which 6 ms to minimize.
[2024-05-24 15:46:29] [INFO ] Deduced a trap composed of 331 places in 437 ms of which 6 ms to minimize.
[2024-05-24 15:46:29] [INFO ] Deduced a trap composed of 347 places in 433 ms of which 6 ms to minimize.
[2024-05-24 15:46:30] [INFO ] Deduced a trap composed of 338 places in 433 ms of which 5 ms to minimize.
[2024-05-24 15:46:30] [INFO ] Deduced a trap composed of 333 places in 441 ms of which 6 ms to minimize.
[2024-05-24 15:46:31] [INFO ] Deduced a trap composed of 323 places in 433 ms of which 6 ms to minimize.
[2024-05-24 15:46:31] [INFO ] Deduced a trap composed of 238 places in 440 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1197 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:46:32] [INFO ] Deduced a trap composed of 383 places in 470 ms of which 6 ms to minimize.
[2024-05-24 15:46:32] [INFO ] Deduced a trap composed of 328 places in 456 ms of which 7 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :599 after 898
[2024-05-24 15:46:33] [INFO ] Deduced a trap composed of 377 places in 455 ms of which 6 ms to minimize.
[2024-05-24 15:46:33] [INFO ] Deduced a trap composed of 348 places in 478 ms of which 7 ms to minimize.
[2024-05-24 15:46:34] [INFO ] Deduced a trap composed of 380 places in 462 ms of which 6 ms to minimize.
[2024-05-24 15:46:34] [INFO ] Deduced a trap composed of 386 places in 454 ms of which 6 ms to minimize.
[2024-05-24 15:46:35] [INFO ] Deduced a trap composed of 345 places in 451 ms of which 6 ms to minimize.
[2024-05-24 15:46:35] [INFO ] Deduced a trap composed of 394 places in 450 ms of which 6 ms to minimize.
[2024-05-24 15:46:36] [INFO ] Deduced a trap composed of 419 places in 403 ms of which 6 ms to minimize.
[2024-05-24 15:46:36] [INFO ] Deduced a trap composed of 390 places in 416 ms of which 6 ms to minimize.
[2024-05-24 15:46:36] [INFO ] Deduced a trap composed of 280 places in 424 ms of which 6 ms to minimize.
[2024-05-24 15:46:37] [INFO ] Deduced a trap composed of 467 places in 427 ms of which 6 ms to minimize.
[2024-05-24 15:46:37] [INFO ] Deduced a trap composed of 322 places in 457 ms of which 6 ms to minimize.
[2024-05-24 15:46:38] [INFO ] Deduced a trap composed of 323 places in 473 ms of which 6 ms to minimize.
SMT process timed out in 49661ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 183 out of 1739 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1739/1739 places, 2920/2920 transitions.
Applied a total of 0 rules in 76 ms. Remains 1739 /1739 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 1739/1739 places, 2920/2920 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1739/1739 places, 2920/2920 transitions.
Applied a total of 0 rules in 132 ms. Remains 1739 /1739 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
[2024-05-24 15:46:38] [INFO ] Flow matrix only has 2572 transitions (discarded 348 similar events)
[2024-05-24 15:46:38] [INFO ] Invariant cache hit.
SDD proceeding with computation,11 properties remain. new max is 65536
SDD size :898 after 1189
[2024-05-24 15:46:40] [INFO ] Implicit Places using invariants in 1412 ms returned [4, 8, 11, 12, 14, 20, 26, 37, 48, 61, 75, 90, 105, 107, 108, 120, 131, 143, 150, 154, 156, 173, 176, 177, 178, 179, 181, 185, 192, 201, 212, 224, 237, 250, 252, 253, 272, 279, 283, 290, 299, 305, 309, 311, 313, 318, 325, 335, 344, 354, 365, 376, 377, 378, 379, 388, 395, 400, 402, 406, 417, 423, 426, 429, 431, 437, 440, 445, 452, 460, 469, 480, 481, 488, 493, 499, 501, 503, 505, 517, 524, 527, 530, 532, 534, 536, 542, 547, 555, 562, 569, 571, 572, 576, 579, 581, 583, 588, 590, 600, 607, 610, 611, 612, 613, 615, 617, 619, 621, 630, 635, 642, 643, 650, 652, 655, 657, 659, 663, 673, 680, 683, 684, 685, 686, 688, 690, 692, 694, 699, 702, 705, 706, 707, 708, 710, 712, 714, 716, 718, 720, 735, 739, 740, 741, 743, 747, 749, 751, 753, 755, 757, 761, 763, 765, 767, 770, 772, 774, 778, 794, 797, 800, 801, 803, 807, 810, 812, 814, 818, 820, 823, 824, 825, 826, 828, 830, 832, 834, 836, 838, 848, 854, 857, 858, 861, 865, 868, 870, 872, 874, 877, 879, 882, 884, 885, 889, 892, 894, 896, 898, 901, 911, 917, 922, 923, 924, 928, 930, 932, 934, 936, 938, 940, 944, 946, 947, 949, 953, 955, 957, 959, 971, 978, 981, 982, 984, 986, 988, 990, 992, 994, 1000, 1004, 1010, 1011, 1013, 1019, 1021, 1023, 1026, 1028, 1030, 1048, 1051, 1052, 1054, 1056, 1061, 1063, 1065, 1068, 1073, 1079, 1087, 1088, 1090, 1096, 1100, 1103, 1105, 1107, 1109, 1127, 1131, 1132, 1133, 1137, 1139, 1141, 1144, 1149, 1156, 1164, 1174, 1175, 1177, 1187, 1193, 1198, 1201, 1203, 1205, 1216, 1222, 1225, 1226, 1227, 1228, 1231, 1233, 1235, 1240, 1247, 1256, 1266, 1278, 1280, 1281, 1291, 1302, 1309, 1314, 1316, 1319, 1328, 1337, 1339, 1340, 1342, 1344, 1348, 1358, 1367, 1378, 1390, 1405, 1406, 1407, 1422, 1432, 1441, 1448, 1452, 1454, 1465, 1469, 1472, 1473, 1474, 1475, 1477, 1481, 1487, 1496, 1507, 1520, 1534, 1550, 1551, 1552, 1553, 1567, 1579, 1590, 1599, 1605, 1609, 1618]
[2024-05-24 15:46:40] [INFO ] Actually due to overlaps returned [299, 417, 517, 600, 673, 848, 911, 971, 1216, 1328, 1618, 4, 11, 12, 48, 61, 105, 107, 120, 131, 154, 173, 176, 177, 178, 201, 212, 250, 252, 272, 305, 309, 335, 344, 376, 377, 378, 388, 395, 423, 426, 445, 452, 480, 488, 493, 503, 524, 527, 542, 547, 569, 571, 576, 579, 588, 607, 610, 611, 612, 621, 642, 650, 652, 659, 680, 683, 684, 685, 705, 706, 707, 710, 712, 718, 735, 739, 740, 753, 761, 765, 767, 774, 794, 797, 800, 801, 818, 823, 824, 825, 828, 830, 836, 854, 857, 858, 874, 877, 882, 884, 889, 892, 898, 917, 922, 923, 936, 938, 944, 946, 949, 957, 978, 981, 982, 994, 1000, 1010, 1011, 1021, 1028, 1048, 1051, 1052, 1068, 1073, 1087, 1088, 1100, 1107, 1127, 1131, 1132, 1149, 1156, 1174, 1175, 1193, 1198, 1203, 1222, 1225, 1226, 1227, 1247, 1256, 1278, 1280, 1302, 1309, 1316, 1337, 1339, 1367, 1378, 1405, 1406, 1432, 1441, 1465, 1469, 1472, 1473, 1474, 1507, 1520, 1550, 1551, 1552, 1579, 1590, 1609]
Discarding 173 places :
Implicit Place search using SMT only with invariants took 1423 ms to find 173 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1566/1739 places, 2920/2920 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 1501 transition count 2855
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 1501 transition count 2855
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 195 place count 1436 transition count 2790
Iterating global reduction 0 with 65 rules applied. Total rules applied 260 place count 1436 transition count 2790
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 267 place count 1429 transition count 2769
Iterating global reduction 0 with 7 rules applied. Total rules applied 274 place count 1429 transition count 2769
Applied a total of 274 rules in 167 ms. Remains 1429 /1566 variables (removed 137) and now considering 2769/2920 (removed 151) transitions.
[2024-05-24 15:46:40] [INFO ] Flow matrix only has 2421 transitions (discarded 348 similar events)
// Phase 1: matrix 2421 rows 1429 cols
[2024-05-24 15:46:40] [INFO ] Computed 260 invariants in 31 ms
[2024-05-24 15:46:41] [INFO ] Implicit Places using invariants in 986 ms returned [7, 11, 17, 23, 34, 70, 85, 101, 134, 141, 146, 165, 167, 171, 178, 208, 221, 235, 260, 264, 271, 285, 287, 292, 299, 326, 337, 348, 367, 369, 373, 390, 392, 398, 401, 419, 428, 439, 455, 457, 460, 480, 482, 484, 486, 503, 510, 518, 525, 527, 533, 547, 549, 551, 553, 563, 568, 575, 585, 587, 592, 605, 607, 609, 611, 613, 618, 621, 623, 627, 629, 632, 644, 646, 650, 652, 654, 657, 659, 664, 669, 671, 676, 694, 698, 701, 703, 705, 710, 712, 716, 718, 721, 735, 739, 742, 744, 746, 751, 755, 762, 764, 768, 783, 787, 789, 791, 793, 797, 802, 807, 809, 812, 829, 831, 833, 835, 837, 847, 854, 860, 863, 866, 869, 886, 888, 893, 895, 897, 909, 918, 924, 930, 932, 935, 952, 956, 958, 960, 963, 981, 992, 1002, 1014, 1017, 1031, 1033, 1035, 1037, 1042, 1066, 1079, 1089, 1110, 1114, 1127, 1129, 1131, 1135, 1145, 1175, 1190, 1205, 1229, 1233, 1235, 1246, 1248, 1252, 1258, 1267, 1303, 1318, 1332, 1362, 1368]
Discarding 176 places :
Implicit Place search using SMT only with invariants took 990 ms to find 176 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1253/1739 places, 2769/2920 transitions.
Applied a total of 0 rules in 61 ms. Remains 1253 /1253 variables (removed 0) and now considering 2769/2769 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2775 ms. Remains : 1253/1739 places, 2769/2920 transitions.
RANDOM walk for 40000 steps (1735 resets) in 519 ms. (76 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (344 resets) in 349 ms. (114 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (344 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (344 resets) in 272 ms. (146 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (336 resets) in 263 ms. (151 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (344 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 65571 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 5
Probabilistic random walk after 65571 steps, saw 29085 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-24 15:46:44] [INFO ] Flow matrix only has 2421 transitions (discarded 348 similar events)
// Phase 1: matrix 2421 rows 1253 cols
[2024-05-24 15:46:44] [INFO ] Computed 84 invariants in 28 ms
[2024-05-24 15:46:44] [INFO ] State equation strengthened by 968 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 749/932 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/932 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/932 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/933 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/933 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 316/1249 variables, 49/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1249 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/1253 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1253 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2421/3674 variables, 1253/1337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3674 variables, 968/2305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3674 variables, 0/2305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/3674 variables, 0/2305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3674/3674 variables, and 2305 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2904 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 1253/1253 constraints, ReadFeed: 968/968 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 749/932 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/932 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:46:48] [INFO ] Deduced a trap composed of 184 places in 154 ms of which 2 ms to minimize.
[2024-05-24 15:46:48] [INFO ] Deduced a trap composed of 182 places in 195 ms of which 3 ms to minimize.
[2024-05-24 15:46:48] [INFO ] Deduced a trap composed of 236 places in 191 ms of which 4 ms to minimize.
[2024-05-24 15:46:48] [INFO ] Deduced a trap composed of 261 places in 215 ms of which 3 ms to minimize.
[2024-05-24 15:46:49] [INFO ] Deduced a trap composed of 269 places in 200 ms of which 3 ms to minimize.
[2024-05-24 15:46:49] [INFO ] Deduced a trap composed of 146 places in 163 ms of which 3 ms to minimize.
[2024-05-24 15:46:49] [INFO ] Deduced a trap composed of 173 places in 159 ms of which 2 ms to minimize.
[2024-05-24 15:46:49] [INFO ] Deduced a trap composed of 184 places in 165 ms of which 2 ms to minimize.
[2024-05-24 15:46:49] [INFO ] Deduced a trap composed of 219 places in 169 ms of which 2 ms to minimize.
[2024-05-24 15:46:50] [INFO ] Deduced a trap composed of 183 places in 170 ms of which 2 ms to minimize.
[2024-05-24 15:46:50] [INFO ] Deduced a trap composed of 223 places in 161 ms of which 2 ms to minimize.
[2024-05-24 15:46:50] [INFO ] Deduced a trap composed of 223 places in 163 ms of which 2 ms to minimize.
[2024-05-24 15:46:50] [INFO ] Deduced a trap composed of 146 places in 159 ms of which 2 ms to minimize.
[2024-05-24 15:46:50] [INFO ] Deduced a trap composed of 223 places in 159 ms of which 2 ms to minimize.
[2024-05-24 15:46:50] [INFO ] Deduced a trap composed of 186 places in 154 ms of which 3 ms to minimize.
[2024-05-24 15:46:51] [INFO ] Deduced a trap composed of 182 places in 157 ms of which 2 ms to minimize.
[2024-05-24 15:46:51] [INFO ] Deduced a trap composed of 209 places in 150 ms of which 2 ms to minimize.
[2024-05-24 15:46:51] [INFO ] Deduced a trap composed of 196 places in 156 ms of which 2 ms to minimize.
[2024-05-24 15:46:51] [INFO ] Deduced a trap composed of 224 places in 172 ms of which 2 ms to minimize.
[2024-05-24 15:46:51] [INFO ] Deduced a trap composed of 186 places in 159 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/932 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:46:52] [INFO ] Deduced a trap composed of 187 places in 158 ms of which 2 ms to minimize.
[2024-05-24 15:46:52] [INFO ] Deduced a trap composed of 198 places in 158 ms of which 2 ms to minimize.
[2024-05-24 15:46:52] [INFO ] Deduced a trap composed of 226 places in 164 ms of which 2 ms to minimize.
[2024-05-24 15:46:52] [INFO ] Deduced a trap composed of 225 places in 157 ms of which 2 ms to minimize.
[2024-05-24 15:46:52] [INFO ] Deduced a trap composed of 200 places in 155 ms of which 2 ms to minimize.
[2024-05-24 15:46:53] [INFO ] Deduced a trap composed of 227 places in 155 ms of which 2 ms to minimize.
[2024-05-24 15:46:53] [INFO ] Deduced a trap composed of 226 places in 154 ms of which 2 ms to minimize.
[2024-05-24 15:46:53] [INFO ] Deduced a trap composed of 227 places in 154 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/932 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:46:53] [INFO ] Deduced a trap composed of 186 places in 389 ms of which 5 ms to minimize.
[2024-05-24 15:46:54] [INFO ] Deduced a trap composed of 186 places in 384 ms of which 6 ms to minimize.
[2024-05-24 15:46:54] [INFO ] Deduced a trap composed of 200 places in 403 ms of which 6 ms to minimize.
[2024-05-24 15:46:55] [INFO ] Deduced a trap composed of 213 places in 399 ms of which 5 ms to minimize.
[2024-05-24 15:46:55] [INFO ] Deduced a trap composed of 184 places in 402 ms of which 6 ms to minimize.
[2024-05-24 15:46:55] [INFO ] Deduced a trap composed of 207 places in 246 ms of which 4 ms to minimize.
[2024-05-24 15:46:56] [INFO ] Deduced a trap composed of 221 places in 383 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/932 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/932 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/933 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:46:56] [INFO ] Deduced a trap composed of 196 places in 161 ms of which 3 ms to minimize.
[2024-05-24 15:46:56] [INFO ] Deduced a trap composed of 197 places in 158 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/933 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:46:57] [INFO ] Deduced a trap composed of 224 places in 150 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:46:57] [INFO ] Deduced a trap composed of 225 places in 156 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 316/1249 variables, 49/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:46:58] [INFO ] Deduced a trap composed of 7 places in 625 ms of which 8 ms to minimize.
[2024-05-24 15:46:59] [INFO ] Deduced a trap composed of 257 places in 626 ms of which 7 ms to minimize.
[2024-05-24 15:46:59] [INFO ] Deduced a trap composed of 189 places in 607 ms of which 7 ms to minimize.
[2024-05-24 15:47:00] [INFO ] Deduced a trap composed of 246 places in 610 ms of which 7 ms to minimize.
[2024-05-24 15:47:01] [INFO ] Deduced a trap composed of 242 places in 605 ms of which 8 ms to minimize.
[2024-05-24 15:47:01] [INFO ] Deduced a trap composed of 230 places in 613 ms of which 8 ms to minimize.
[2024-05-24 15:47:02] [INFO ] Deduced a trap composed of 244 places in 611 ms of which 8 ms to minimize.
[2024-05-24 15:47:03] [INFO ] Deduced a trap composed of 229 places in 604 ms of which 8 ms to minimize.
[2024-05-24 15:47:03] [INFO ] Deduced a trap composed of 224 places in 559 ms of which 8 ms to minimize.
[2024-05-24 15:47:04] [INFO ] Deduced a trap composed of 243 places in 563 ms of which 8 ms to minimize.
[2024-05-24 15:47:04] [INFO ] Deduced a trap composed of 217 places in 564 ms of which 7 ms to minimize.
[2024-05-24 15:47:05] [INFO ] Deduced a trap composed of 236 places in 572 ms of which 7 ms to minimize.
[2024-05-24 15:47:06] [INFO ] Deduced a trap composed of 303 places in 572 ms of which 7 ms to minimize.
[2024-05-24 15:47:06] [INFO ] Deduced a trap composed of 221 places in 550 ms of which 8 ms to minimize.
[2024-05-24 15:47:07] [INFO ] Deduced a trap composed of 231 places in 613 ms of which 8 ms to minimize.
[2024-05-24 15:47:07] [INFO ] Deduced a trap composed of 204 places in 608 ms of which 8 ms to minimize.
[2024-05-24 15:47:08] [INFO ] Deduced a trap composed of 314 places in 558 ms of which 7 ms to minimize.
[2024-05-24 15:47:09] [INFO ] Deduced a trap composed of 244 places in 570 ms of which 8 ms to minimize.
[2024-05-24 15:47:09] [INFO ] Deduced a trap composed of 297 places in 573 ms of which 8 ms to minimize.
[2024-05-24 15:47:10] [INFO ] Deduced a trap composed of 254 places in 584 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1249 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:47:10] [INFO ] Deduced a trap composed of 354 places in 604 ms of which 8 ms to minimize.
[2024-05-24 15:47:11] [INFO ] Deduced a trap composed of 240 places in 589 ms of which 7 ms to minimize.
[2024-05-24 15:47:12] [INFO ] Deduced a trap composed of 221 places in 572 ms of which 9 ms to minimize.
[2024-05-24 15:47:12] [INFO ] Deduced a trap composed of 375 places in 576 ms of which 7 ms to minimize.
[2024-05-24 15:47:13] [INFO ] Deduced a trap composed of 237 places in 570 ms of which 7 ms to minimize.
[2024-05-24 15:47:13] [INFO ] Deduced a trap composed of 341 places in 574 ms of which 7 ms to minimize.
[2024-05-24 15:47:14] [INFO ] Deduced a trap composed of 374 places in 546 ms of which 8 ms to minimize.
[2024-05-24 15:47:15] [INFO ] Deduced a trap composed of 360 places in 566 ms of which 7 ms to minimize.
[2024-05-24 15:47:15] [INFO ] Deduced a trap composed of 356 places in 549 ms of which 8 ms to minimize.
[2024-05-24 15:47:16] [INFO ] Deduced a trap composed of 317 places in 576 ms of which 8 ms to minimize.
[2024-05-24 15:47:16] [INFO ] Deduced a trap composed of 241 places in 579 ms of which 7 ms to minimize.
[2024-05-24 15:47:17] [INFO ] Deduced a trap composed of 296 places in 572 ms of which 7 ms to minimize.
[2024-05-24 15:47:18] [INFO ] Deduced a trap composed of 257 places in 572 ms of which 7 ms to minimize.
[2024-05-24 15:47:18] [INFO ] Deduced a trap composed of 262 places in 588 ms of which 7 ms to minimize.
[2024-05-24 15:47:19] [INFO ] Deduced a trap composed of 263 places in 562 ms of which 7 ms to minimize.
[2024-05-24 15:47:19] [INFO ] Deduced a trap composed of 250 places in 567 ms of which 7 ms to minimize.
[2024-05-24 15:47:20] [INFO ] Deduced a trap composed of 230 places in 561 ms of which 7 ms to minimize.
[2024-05-24 15:47:21] [INFO ] Deduced a trap composed of 264 places in 559 ms of which 8 ms to minimize.
[2024-05-24 15:47:21] [INFO ] Deduced a trap composed of 42 places in 579 ms of which 8 ms to minimize.
[2024-05-24 15:47:22] [INFO ] Deduced a trap composed of 354 places in 562 ms of which 7 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1249 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:47:23] [INFO ] Deduced a trap composed of 343 places in 576 ms of which 8 ms to minimize.
[2024-05-24 15:47:23] [INFO ] Deduced a trap composed of 225 places in 569 ms of which 8 ms to minimize.
[2024-05-24 15:47:24] [INFO ] Deduced a trap composed of 372 places in 565 ms of which 8 ms to minimize.
[2024-05-24 15:47:24] [INFO ] Deduced a trap composed of 233 places in 576 ms of which 8 ms to minimize.
[2024-05-24 15:47:25] [INFO ] Deduced a trap composed of 355 places in 585 ms of which 8 ms to minimize.
[2024-05-24 15:47:26] [INFO ] Deduced a trap composed of 380 places in 591 ms of which 8 ms to minimize.
[2024-05-24 15:47:26] [INFO ] Deduced a trap composed of 390 places in 563 ms of which 8 ms to minimize.
[2024-05-24 15:47:27] [INFO ] Deduced a trap composed of 258 places in 562 ms of which 7 ms to minimize.
[2024-05-24 15:47:27] [INFO ] Deduced a trap composed of 388 places in 563 ms of which 8 ms to minimize.
[2024-05-24 15:47:28] [INFO ] Deduced a trap composed of 327 places in 571 ms of which 7 ms to minimize.
[2024-05-24 15:47:29] [INFO ] Deduced a trap composed of 242 places in 613 ms of which 7 ms to minimize.
[2024-05-24 15:47:29] [INFO ] Deduced a trap composed of 358 places in 609 ms of which 8 ms to minimize.
[2024-05-24 15:47:30] [INFO ] Deduced a trap composed of 339 places in 620 ms of which 8 ms to minimize.
[2024-05-24 15:47:31] [INFO ] Deduced a trap composed of 286 places in 610 ms of which 8 ms to minimize.
[2024-05-24 15:47:31] [INFO ] Deduced a trap composed of 275 places in 616 ms of which 8 ms to minimize.
[2024-05-24 15:47:32] [INFO ] Deduced a trap composed of 288 places in 615 ms of which 7 ms to minimize.
[2024-05-24 15:47:33] [INFO ] Deduced a trap composed of 286 places in 611 ms of which 8 ms to minimize.
[2024-05-24 15:47:33] [INFO ] Deduced a trap composed of 287 places in 615 ms of which 8 ms to minimize.
[2024-05-24 15:47:34] [INFO ] Deduced a trap composed of 346 places in 618 ms of which 8 ms to minimize.
[2024-05-24 15:47:34] [INFO ] Deduced a trap composed of 236 places in 605 ms of which 8 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1249 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:47:35] [INFO ] Deduced a trap composed of 248 places in 561 ms of which 7 ms to minimize.
[2024-05-24 15:47:36] [INFO ] Deduced a trap composed of 242 places in 586 ms of which 8 ms to minimize.
[2024-05-24 15:47:36] [INFO ] Deduced a trap composed of 240 places in 562 ms of which 8 ms to minimize.
[2024-05-24 15:47:37] [INFO ] Deduced a trap composed of 368 places in 541 ms of which 7 ms to minimize.
[2024-05-24 15:47:38] [INFO ] Deduced a trap composed of 423 places in 578 ms of which 7 ms to minimize.
[2024-05-24 15:47:38] [INFO ] Deduced a trap composed of 250 places in 546 ms of which 7 ms to minimize.
[2024-05-24 15:47:39] [INFO ] Deduced a trap composed of 254 places in 560 ms of which 8 ms to minimize.
[2024-05-24 15:47:39] [INFO ] Deduced a trap composed of 259 places in 548 ms of which 7 ms to minimize.
[2024-05-24 15:47:40] [INFO ] Deduced a trap composed of 235 places in 596 ms of which 7 ms to minimize.
[2024-05-24 15:47:41] [INFO ] Deduced a trap composed of 388 places in 576 ms of which 8 ms to minimize.
[2024-05-24 15:47:41] [INFO ] Deduced a trap composed of 248 places in 563 ms of which 8 ms to minimize.
[2024-05-24 15:47:42] [INFO ] Deduced a trap composed of 263 places in 566 ms of which 8 ms to minimize.
[2024-05-24 15:47:42] [INFO ] Deduced a trap composed of 411 places in 557 ms of which 7 ms to minimize.
[2024-05-24 15:47:43] [INFO ] Deduced a trap composed of 403 places in 564 ms of which 7 ms to minimize.
[2024-05-24 15:47:44] [INFO ] Deduced a trap composed of 373 places in 568 ms of which 8 ms to minimize.
[2024-05-24 15:47:44] [INFO ] Deduced a trap composed of 260 places in 589 ms of which 8 ms to minimize.
[2024-05-24 15:47:45] [INFO ] Deduced a trap composed of 261 places in 585 ms of which 7 ms to minimize.
[2024-05-24 15:47:45] [INFO ] Deduced a trap composed of 394 places in 577 ms of which 7 ms to minimize.
[2024-05-24 15:47:46] [INFO ] Deduced a trap composed of 324 places in 581 ms of which 7 ms to minimize.
[2024-05-24 15:47:47] [INFO ] Deduced a trap composed of 284 places in 575 ms of which 7 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1249 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:47:47] [INFO ] Deduced a trap composed of 247 places in 557 ms of which 7 ms to minimize.
[2024-05-24 15:47:48] [INFO ] Deduced a trap composed of 268 places in 570 ms of which 8 ms to minimize.
[2024-05-24 15:47:49] [INFO ] Deduced a trap composed of 258 places in 563 ms of which 7 ms to minimize.
[2024-05-24 15:47:49] [INFO ] Deduced a trap composed of 251 places in 562 ms of which 7 ms to minimize.
[2024-05-24 15:47:50] [INFO ] Deduced a trap composed of 158 places in 565 ms of which 7 ms to minimize.
[2024-05-24 15:47:50] [INFO ] Deduced a trap composed of 462 places in 564 ms of which 7 ms to minimize.
[2024-05-24 15:47:51] [INFO ] Deduced a trap composed of 231 places in 562 ms of which 7 ms to minimize.
[2024-05-24 15:47:52] [INFO ] Deduced a trap composed of 262 places in 556 ms of which 7 ms to minimize.
[2024-05-24 15:47:52] [INFO ] Deduced a trap composed of 251 places in 560 ms of which 7 ms to minimize.
[2024-05-24 15:47:53] [INFO ] Deduced a trap composed of 293 places in 563 ms of which 8 ms to minimize.
[2024-05-24 15:47:53] [INFO ] Deduced a trap composed of 270 places in 557 ms of which 7 ms to minimize.
[2024-05-24 15:47:54] [INFO ] Deduced a trap composed of 290 places in 565 ms of which 7 ms to minimize.
[2024-05-24 15:47:54] [INFO ] Deduced a trap composed of 248 places in 560 ms of which 7 ms to minimize.
[2024-05-24 15:47:55] [INFO ] Deduced a trap composed of 239 places in 610 ms of which 8 ms to minimize.
[2024-05-24 15:47:56] [INFO ] Deduced a trap composed of 240 places in 616 ms of which 7 ms to minimize.
[2024-05-24 15:47:56] [INFO ] Deduced a trap composed of 254 places in 567 ms of which 8 ms to minimize.
[2024-05-24 15:47:57] [INFO ] Deduced a trap composed of 457 places in 571 ms of which 7 ms to minimize.
[2024-05-24 15:47:58] [INFO ] Deduced a trap composed of 273 places in 547 ms of which 7 ms to minimize.
[2024-05-24 15:47:58] [INFO ] Deduced a trap composed of 257 places in 569 ms of which 8 ms to minimize.
[2024-05-24 15:47:59] [INFO ] Deduced a trap composed of 252 places in 560 ms of which 8 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1249 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:48:00] [INFO ] Deduced a trap composed of 191 places in 588 ms of which 7 ms to minimize.
[2024-05-24 15:48:00] [INFO ] Deduced a trap composed of 209 places in 586 ms of which 7 ms to minimize.
[2024-05-24 15:48:01] [INFO ] Deduced a trap composed of 239 places in 592 ms of which 8 ms to minimize.
[2024-05-24 15:48:01] [INFO ] Deduced a trap composed of 263 places in 589 ms of which 8 ms to minimize.
[2024-05-24 15:48:02] [INFO ] Deduced a trap composed of 228 places in 579 ms of which 8 ms to minimize.
[2024-05-24 15:48:03] [INFO ] Deduced a trap composed of 332 places in 568 ms of which 7 ms to minimize.
SMT process timed out in 78340ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 183 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 2769/2769 transitions.
Applied a total of 0 rules in 64 ms. Remains 1253 /1253 variables (removed 0) and now considering 2769/2769 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1253/1253 places, 2769/2769 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 2769/2769 transitions.
Applied a total of 0 rules in 58 ms. Remains 1253 /1253 variables (removed 0) and now considering 2769/2769 (removed 0) transitions.
[2024-05-24 15:48:03] [INFO ] Flow matrix only has 2421 transitions (discarded 348 similar events)
[2024-05-24 15:48:03] [INFO ] Invariant cache hit.
[2024-05-24 15:48:04] [INFO ] Implicit Places using invariants in 827 ms returned []
[2024-05-24 15:48:04] [INFO ] Flow matrix only has 2421 transitions (discarded 348 similar events)
[2024-05-24 15:48:04] [INFO ] Invariant cache hit.
[2024-05-24 15:48:04] [INFO ] State equation strengthened by 968 read => feed constraints.
SDD proceeding with computation,11 properties remain. new max is 131072
SDD size :1189 after 4290
[2024-05-24 15:48:18] [INFO ] Implicit Places using invariants and state equation in 14194 ms returned []
Implicit Place search using SMT with State Equation took 15041 ms to find 0 implicit places.
[2024-05-24 15:48:18] [INFO ] Redundant transitions in 149 ms returned []
Running 2752 sub problems to find dead transitions.
[2024-05-24 15:48:18] [INFO ] Flow matrix only has 2421 transitions (discarded 348 similar events)
[2024-05-24 15:48:18] [INFO ] Invariant cache hit.
[2024-05-24 15:48:18] [INFO ] State equation strengthened by 968 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1251 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2752 unsolved
SMT process timed out in 33413ms, After SMT, problems are : Problem set: 0 solved, 2752 unsolved
Search for dead transitions found 0 dead transitions in 33453ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48726 ms. Remains : 1253/1253 places, 2769/2769 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 736 edges and 1253 vertex of which 10 / 1253 are part of one of the 2 SCC in 9 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Ensure Unique test removed 407 transitions
Reduce isomorphic transitions removed 508 transitions.
Graph (complete) has 3721 edges and 1245 vertex of which 1242 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 1230 transition count 2232
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 86 rules applied. Total rules applied 129 place count 1201 transition count 2175
Reduce places removed 28 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 53 rules applied. Total rules applied 182 place count 1173 transition count 2150
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 30 rules applied. Total rules applied 212 place count 1163 transition count 2130
Reduce places removed 10 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 4 with 15 rules applied. Total rules applied 227 place count 1153 transition count 2125
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 236 place count 1148 transition count 2121
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 37 Pre rules applied. Total rules applied 236 place count 1148 transition count 2084
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 310 place count 1111 transition count 2084
Discarding 90 places :
Symmetric choice reduction at 6 with 90 rule applications. Total rules 400 place count 1021 transition count 1994
Iterating global reduction 6 with 90 rules applied. Total rules applied 490 place count 1021 transition count 1994
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 513 place count 1021 transition count 1971
Performed 427 Post agglomeration using F-continuation condition.Transition count delta: 427
Deduced a syphon composed of 427 places in 1 ms
Reduce places removed 427 places and 0 transitions.
Iterating global reduction 7 with 854 rules applied. Total rules applied 1367 place count 594 transition count 1544
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 7 with 150 rules applied. Total rules applied 1517 place count 594 transition count 1394
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1519 place count 592 transition count 1390
Iterating global reduction 8 with 2 rules applied. Total rules applied 1521 place count 592 transition count 1390
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -147
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 8 with 50 rules applied. Total rules applied 1571 place count 567 transition count 1537
Drop transitions (Redundant composition of simpler transitions.) removed 332 transitions
Redundant transition composition rules discarded 332 transitions
Iterating global reduction 8 with 332 rules applied. Total rules applied 1903 place count 567 transition count 1205
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 8 with 10 rules applied. Total rules applied 1913 place count 567 transition count 1195
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1923 place count 557 transition count 1195
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1931 place count 549 transition count 1176
Iterating global reduction 10 with 8 rules applied. Total rules applied 1939 place count 549 transition count 1176
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1943 place count 549 transition count 1172
Free-agglomeration rule applied 16 times.
Iterating global reduction 11 with 16 rules applied. Total rules applied 1959 place count 549 transition count 1156
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1976 place count 533 transition count 1155
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 12 with 10 rules applied. Total rules applied 1986 place count 533 transition count 1145
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 12 with 18 rules applied. Total rules applied 2004 place count 533 transition count 1127
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 20 rules applied. Total rules applied 2024 place count 515 transition count 1125
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 13 with 8 rules applied. Total rules applied 2032 place count 515 transition count 1117
Partial Free-agglomeration rule applied 34 times.
Drop transitions (Partial Free agglomeration) removed 34 transitions
Iterating global reduction 13 with 34 rules applied. Total rules applied 2066 place count 515 transition count 1117
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 2067 place count 515 transition count 1116
Partial Post-agglomeration rule applied 161 times.
Drop transitions (Partial Post agglomeration) removed 161 transitions
Iterating global reduction 13 with 161 rules applied. Total rules applied 2228 place count 515 transition count 1116
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 2231 place count 512 transition count 1110
Iterating global reduction 13 with 3 rules applied. Total rules applied 2234 place count 512 transition count 1110
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 2235 place count 512 transition count 1109
Applied a total of 2235 rules in 794 ms. Remains 512 /1253 variables (removed 741) and now considering 1109/2769 (removed 1660) transitions.
Running SMT prover for 5 properties.
[2024-05-24 15:48:52] [INFO ] Flow matrix only has 1061 transitions (discarded 48 similar events)
// Phase 1: matrix 1061 rows 512 cols
[2024-05-24 15:48:52] [INFO ] Computed 69 invariants in 10 ms
[2024-05-24 15:48:52] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-05-24 15:48:52] [INFO ] [Real]Absence check using 20 positive and 49 generalized place invariants in 7 ms returned sat
[2024-05-24 15:48:52] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 15:48:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2024-05-24 15:48:53] [INFO ] [Nat]Absence check using 20 positive and 49 generalized place invariants in 9 ms returned sat
[2024-05-24 15:48:54] [INFO ] After 1030ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 15:48:54] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 15:48:54] [INFO ] After 821ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-24 15:48:55] [INFO ] After 1744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-24 15:48:56] [INFO ] After 3946ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2024-05-24 15:48:56] [INFO ] Flatten gal took : 40 ms
[2024-05-24 15:48:57] [INFO ] Flatten gal took : 40 ms
[2024-05-24 15:48:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16792836774502300701.gal : 10 ms
[2024-05-24 15:48:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6409981220512608897.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/ReachabilityCardinality16792836774502300701.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6409981220512608897.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
Loading property file /tmp/ReachabilityCardinality6409981220512608897.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :15 after 84
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :84 after 96
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :96 after 113
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :113 after 423
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :423 after 539
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :539 after 559
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :559 after 3587
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :3587 after 4343
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :4343 after 14303
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :14303 after 16028
SDD proceeding with computation,11 properties remain. new max is 262144
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :4290 after 5433
SDD size :16028 after 45528
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :45528 after 76221
Detected timeout of ITS tools.
[2024-05-24 15:49:12] [INFO ] Flatten gal took : 37 ms
[2024-05-24 15:49:12] [INFO ] Applying decomposition
[2024-05-24 15:49:12] [INFO ] Flatten gal took : 35 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/graph12423918756562186814.txt' '-o' '/tmp/graph12423918756562186814.bin' '-w' '/tmp/graph12423918756562186814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12423918756562186814.bin' '-l' '-1' '-v' '-w' '/tmp/graph12423918756562186814.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:49:12] [INFO ] Decomposing Gal with order
[2024-05-24 15:49:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:49:12] [INFO ] Removed a total of 939 redundant transitions.
[2024-05-24 15:49:12] [INFO ] Flatten gal took : 249 ms
[2024-05-24 15:49:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 445 labels/synchronizations in 49 ms.
[2024-05-24 15:49:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11799883994552524096.gal : 16 ms
[2024-05-24 15:49:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16443541670883906716.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/ReachabilityCardinality11799883994552524096.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16443541670883906716.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/ReachabilityCardinality16443541670883906716.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :22 after 34
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :34 after 46
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :46 after 55
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :55 after 55
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :55 after 235
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :235 after 246
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :246 after 259
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :259 after 333
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :333 after 1742
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1742 after 13198
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :13198 after 38326
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 35996 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 15:49:28] [INFO ] Flatten gal took : 146 ms
[2024-05-24 15:49:28] [INFO ] Applying decomposition
[2024-05-24 15:49:28] [INFO ] Flatten gal took : 144 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/graph11277534165520570189.txt' '-o' '/tmp/graph11277534165520570189.bin' '-w' '/tmp/graph11277534165520570189.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11277534165520570189.bin' '-l' '-1' '-v' '-w' '/tmp/graph11277534165520570189.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:49:28] [INFO ] Decomposing Gal with order
[2024-05-24 15:49:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:49:29] [INFO ] Removed a total of 3044 redundant transitions.
[2024-05-24 15:49:29] [INFO ] Flatten gal took : 489 ms
[2024-05-24 15:49:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 540 labels/synchronizations in 87 ms.
[2024-05-24 15:49:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8684806036663186210.gal : 45 ms
[2024-05-24 15:49:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4378001238346545617.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/ReachabilityCardinality8684806036663186210.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4378001238346545617.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4378001238346545617.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1 after 102
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :102 after 123
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :123 after 140
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :140 after 321
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :321 after 373
SDD proceeding with computation,5 properties remain. new max is 131072
SDD size :373 after 451
SDD proceeding with computation,5 properties remain. new max is 262144
SDD size :451 after 807
SDD proceeding with computation,5 properties remain. new max is 524288
SDD size :807 after 807
SDD proceeding with computation,5 properties remain. new max is 1048576
SDD size :807 after 844
SDD proceeding with computation,5 properties remain. new max is 2097152
SDD size :844 after 899
SDD proceeding with computation,5 properties remain. new max is 4194304
SDD size :899 after 1417
ITS-tools command line returned an error code 137
[2024-05-24 16:06:57] [INFO ] Flatten gal took : 66 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16870097640301131179
[2024-05-24 16:06:57] [INFO ] Too many transitions (2769) to apply POR reductions. Disabling POR matrices.
[2024-05-24 16:06:57] [INFO ] Applying decomposition
[2024-05-24 16:06:57] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16870097640301131179
Running compilation step : cd /tmp/ltsmin16870097640301131179;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '144' '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 16:06:57] [INFO ] Flatten gal took : 96 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/graph2970744715259904785.txt' '-o' '/tmp/graph2970744715259904785.bin' '-w' '/tmp/graph2970744715259904785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2970744715259904785.bin' '-l' '-1' '-v' '-w' '/tmp/graph2970744715259904785.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:06:58] [INFO ] Decomposing Gal with order
[2024-05-24 16:06:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:06:58] [INFO ] Removed a total of 2408 redundant transitions.
[2024-05-24 16:06:58] [INFO ] Flatten gal took : 487 ms
[2024-05-24 16:06:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 1568 labels/synchronizations in 76 ms.
[2024-05-24 16:06:58] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12026610859542760797.gal : 26 ms
[2024-05-24 16:06:58] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8918014933702040912.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/ReachabilityFireability12026610859542760797.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8918014933702040912.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/ReachabilityFireability8918014933702040912.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :9 after 11
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :11 after 15
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :15 after 21
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :21 after 29
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :29 after 36
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :36 after 68
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :68 after 70
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :70 after 106
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :106 after 290
Compilation finished in 7901 ms.
Running link step : cd /tmp/ltsmin16870097640301131179;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin16870097640301131179;'/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' 'MultiCrashLeafsetExtensionPTS16C03ReachabilityFireability202401==true'
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :290 after 334
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :334 after 561
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :561 after 1273
SDD proceeding with computation,5 properties remain. new max is 131072
SDD size :1273 after 2975
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16870097640301131179;'/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' 'MultiCrashLeafsetExtensionPTS16C03ReachabilityFireability202401==true'
Running LTSmin : cd /tmp/ltsmin16870097640301131179;'/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' 'MultiCrashLeafsetExtensionPTS16C03ReachabilityFireability202404==true'
SDD proceeding with computation,5 properties remain. new max is 262144
SDD size :2975 after 6128
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16870097640301131179;'/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' 'MultiCrashLeafsetExtensionPTS16C03ReachabilityFireability202404==true'
Running LTSmin : cd /tmp/ltsmin16870097640301131179;'/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' 'MultiCrashLeafsetExtensionPTS16C03ReachabilityFireability202408==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16870097640301131179;'/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' 'MultiCrashLeafsetExtensionPTS16C03ReachabilityFireability202408==true'
Running LTSmin : cd /tmp/ltsmin16870097640301131179;'/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' 'MultiCrashLeafsetExtensionPTS16C03ReachabilityFireability202411==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16870097640301131179;'/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' 'MultiCrashLeafsetExtensionPTS16C03ReachabilityFireability202411==true'
Running LTSmin : cd /tmp/ltsmin16870097640301131179;'/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' 'MultiCrashLeafsetExtensionPTS16C03ReachabilityFireability202413==true'
SDD proceeding with computation,5 properties remain. new max is 524288
SDD size :6128 after 8981
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16870097640301131179;'/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' 'MultiCrashLeafsetExtensionPTS16C03ReachabilityFireability202413==true'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin16870097640301131179;'/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' 'MultiCrashLeafsetExtensionPTS16C03ReachabilityFireability202401==true'
SDD proceeding with computation,5 properties remain. new max is 1048576
SDD size :8981 after 14439
Detected timeout of ITS tools.
[2024-05-24 16:34:06] [INFO ] Applying decomposition
[2024-05-24 16:34:06] [INFO ] Flatten gal took : 145 ms
[2024-05-24 16:34:07] [INFO ] Decomposing Gal with order
[2024-05-24 16:34:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:34:07] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to Node0IsNotifiedThatHeIsTheNewMaster in partition [ThereIsAMasterInTheLeafSet, Node0HasDetectedCrashOfNode1, Node0HasAskedItsLeafSetToLx2ToReplaceNode1, Node0HasDetectedCrashOfNode8, Node0HasAskedItsLeafSetToRx1ToReplaceNode9, Node0HasDetectedCrashOfNode10, Node0HasDetectedCrashOfNode11, Node0ManageTheCrashOfNode13, Node0HasDetectedCrashOfNode13, Node0HasDetectedCrashOfNode14, Node0HasDetectedCrashOfNode15, Node0ManageTheCrashOfNode16, RequestOfNode0IsSentToLx0, RequestOfNode0IsSentToRx0, RequestOfNode0IsSentToLx1, RequestOfNode0IsSentToRx1, RequestOfNode0IsSentToRx2, NoNodeManageTheCrashOfNode0, Node1ManageTheCrashOfNode0, Node1HasDetectedCrashOfNode9, Node1HasAskedItsLeafSetToRx1ToReplaceNode9, Node1WantsToManageTheCrashOfNode11, Node1HasDetectedCrashOfNode13, Node1HasDetectedCrashOfNode16, RequestOfNode1IsSentToRx1, RequestOfNode1IsSentToLx2, Node2HasAskedItsLeafSetToLx0ToReplaceNode0, Node2HasAskedItsLeafSetToLx2ToReplaceNode0, Node2HasDetectedCrashOfNode1, Node2ManageTheCrashOfNode9, Node2ManageTheCrashOfNode10, Node2ManageTheCrashOfNode16, RequestOfNode2IsSentToRx1, Node3HasAskedItsLeafSetToLx1ToReplaceNode0, Node3HasAskedItsLeafSetToLx2ToReplaceNode0, Node3HasDetectedCrashOfNode1, Node3HasDetectedCrashOfNode4, Node3HasDetectedCrashOfNode5, Node3HasDetectedCrashOfNode6, Node3HasDetectedCrashOfNode8, RequestOfNode3IsSentToLx1, RequestOfNode3IsSentToLx2, Node4HasAskedItsLeafSetToLx2ToReplaceNode0, Node4ManageTheCrashOfNode5, Node4HasDetectedCrashOfNode9, Node4HasAskedItsLeafSetToRx1ToReplaceNode9, Node4HasDetectedCrashOfNode11, Node4HasDetectedCrashOfNode13, Node4HasDetectedCrashOfNode14, Node4HasDetectedCrashOfNode15, RequestOfNode4IsSentToRx1, Node5ManageTheCrashOfNode6, NoNodeManageTheCrashOfNode6, Node7ManageTheCrashOfNode2, NoNodeManageTheCrashOfNode7, Node8HasAskedItsLeafSetToLx2ToReplaceNode1, Node8ManageTheCrashOfNode2, Node8HasDetectedCrashOfNode2, Node8HasDetectedCrashOfNode7, Node9ManageTheCrashOfNode1, Node9HasDetectedCrashOfNode1, Node9HasAskedItsLeafSetToLx2ToReplaceNode1, Node9ManageTheCrashOfNode6, Node9HasDetectedCrashOfNode7, Node9ManageTheCrashOfNode10, Node9HasDetectedCrashOfNode10, Node9HasAskedItsLeafSetToRx1ToReplaceNode10, Node9HasDetectedCrashOfNode11, Node9ManageTheCrashOfNode15, RequestOfNode9IsSentToLx2, Node10HasAskedItsLeafSetToLx0ToReplaceNode1, Node10HasDetectedCrashOfNode6, Node10HasDetectedCrashOfNode7, Node10HasAskedItsLeafSetToRx1ToReplaceNode8, Node10HasDetectedCrashOfNode11, Node10HasDetectedCrashOfNode15, RequestOfNode10IsSentToLx0, Node11HasAskedItsLeafSetToLx2ToReplaceNode0, Node11HasAskedItsLeafSetToRx2ToReplaceNode8, Node11HasDetectedCrashOfNode10, Node11ManageTheCrashOfNode13, Node11ManageTheCrashOfNode16, NoNodeManageTheCrashOfNode11, Node12HasAskedItsLeafSetToLx2ToReplaceNode0, Node12HasDetectedCrashOfNode1, Node12HasDetectedCrashOfNode2, Node12HasDetectedCrashOfNode5, Node12HasAskedItsLeafSetToRx2ToReplaceNode8, Node12HasDetectedCrashOfNode9, Node12HasDetectedCrashOfNode13, Node12HasDetectedCrashOfNode15, Node12HasDetectedCrashOfNode16, RequestOfNode12IsSentToLx2, RequestOfNode12IsSentToRx2, NoNodeManageTheCrashOfNode12, Node13HasAskedItsLeafSetToLx0ToReplaceNode1, Node13HasDetectedCrashOfNode4, Node13HasDetectedCrashOfNode5, Node13HasAskedItsLeafSetToRx2ToReplaceNode9, Node13HasDetectedCrashOfNode14, Node13HasDetectedCrashOfNode15, Node14ManageTheCrashOfNode0, Node14HasDetectedCrashOfNode8, Node14HasAskedItsLeafSetToRx1ToReplaceNode8, Node14HasDetectedCrashOfNode13, Node14ManageTheCrashOfNode15, RequestOfNode14IsSentToRx1, Node15WantsToManageTheCrashOfNode0, Node15HasDetectedCrashOfNode0, Node15HasAskedItsLeafSetToLx1ToReplaceNode0, Node15HasDetectedCrashOfNode1, Node15HasDetectedCrashOfNode4, Node15HasDetectedCrashOfNode5, Node15HasAskedItsLeafSetToRx0ToReplaceNode8, RequestOfNode15IsSentToLx1, NoNodeManageTheCrashOfNode15],[Rx1IsActiveAndNotInTheLeafSet, Rx2IsAtTheRightExtremityOfTheLeafSet],[CrashReservoir, NoCrashIsHappening, Node0AsksIsThereANodeMaster, Node0HasDetectedCrashOfNode16, Node1NotifyThatHeIsActive, NodesCanDetectThatNode1HasCrashed, Node1HasDetectedCrashOfNode2, Node1DontAnswerToAnyNode, Node2NotifyThatHeIsActive, NodesCanDetectThatNode2HasCrashed, Node2HasDetectedCrashOfNode13, Node2HasDetectedCrashOfNode16, Node3NotifyThatHeIsActive, NodesCanDetectThatNode3HasCrashed, Node4HasDetectedCrashOfNode1, Node5HasDetectedCrashOfNode6, Node5WantsToManageTheCrashOfNode7, Node5HasDetectedCrashOfNode9, Node5DontAnswerToAnyNode, Node6NotifyThatHeIsActive, Node6WantsToManageTheCrashOfNode7, Node6HasDetectedCrashOfNode11, Node6HasDetectedCrashOfNode15, Node7IsActive, NodesCanDetectThatNode7HasCrashed, Node7HasDetectedCrashOfNode1, Node7HasDetectedCrashOfNode11, Node7DontAnswerToAnyNode, Node8IsActive, Node8HasDetectedCrashOfNode1, Node8DontAnswerToAnyNode, Node9NotifyThatHeIsActive, Node9HasDetectedCrashOfNode2, Node9HasDetectedCrashOfNode6, Node9HasDetectedCrashOfNode13, Node9HasDetectedCrashOfNode15, Node10HasDetectedCrashOfNode1, Node10HasDetectedCrashOfNode9, Node11NotifyThatHeIsActive, NodesCanDetectThatNode11HasCrashed, Node11DontAnswerToAnyNode, NodesCanDetectThatNode12HasCrashed, Node13NotifyThatHeIsActive, NodesCanDetectThatNode13HasCrashed, Node13HasDetectedCrashOfNode1, Node14HasDetectedCrashOfNode15, Node15NotifyThatHeIsActive, Node15HasDetectedCrashOfNode13, Node16IsActive, Node16HasDetectedCrashOfNode9, Node16HasDetectedCrashOfNode15, Lx2IsActiveAndNotInTheLeafSet, Rx2IsActiveAndNotInTheLeafSet],[Node4IsActive, Node4NotifyThatHeIsActive, NodesCanDetectThatNode4HasCrashed],[Node5IsActive, Node5NotifyThatHeIsActive, NodesCanDetectThatNode5HasCrashed],[Node10IsActive, Node10NotifyThatHeIsActive, NodesCanDetectThatNode10HasCrashed],[Node14IsActive, Node14NotifyThatHeIsActive, NodesCanDetectThatNode14HasCrashed],[Lx0IsAtTheLeftExtremityOfTheLeafSet, Lx1IsActiveAndNotInTheLeafSet, Lx1IsAtTheLeftExtremityOfTheLeafSet, Lx2IsAtTheLeftExtremityOfTheLeafSet],[Rx0IsAtTheRightExtremityOfTheLeafSet, Rx1IsAtTheRightExtremityOfTheLeafSet],[Node0HasDetectedCrashOfNode9, Node0ThinksNode2ShouldBeNodeMasterToReplaceNode9, Node0ThinksNode14ShouldBeNodeMasterToReplaceNode9, Node0ThinksNode1ShouldBeNodeMasterToReplaceNode9],[Node1HasDetectedCrashOfNode7, Node1ThinksNode5ShouldBeNodeMasterToReplaceNode7],[Node1ThinksNode2ShouldBeNodeMasterToReplaceNode7, Node1ThinksNode14ShouldBeNodeMasterToReplaceNode7],[Node0IsActive, Node0DontAnswerToAnyNode, Node1HasDetectedCrashOfNode0, Node2HasDetectedCrashOfNode0, Node3HasDetectedCrashOfNode0, Node4HasDetectedCrashOfNode0, Node7HasDetectedCrashOfNode0, Node8HasDetectedCrashOfNode0, Node9HasDetectedCrashOfNode0, Node10HasDetectedCrashOfNode0, Node11HasDetectedCrashOfNode0, Node12HasDetectedCrashOfNode0, Node13HasDetectedCrashOfNode0, Node14HasDetectedCrashOfNode0],[Node2HasDetectedCrashOfNode3, Node2HasAskedItsLeafSetToLx0ToReplaceNode3, Node2HasTheLeafSetOfLx0ToReplaceNode3, Node2HasDetectedCrashOfNode5, Node2HasAskedItsLeafSetToLx0ToReplaceNode5, Node2HasTheLeafSetOfLx0ToReplaceNode5, RequestOfNode2IsSentToLx0, Node7HasAskedItsLeafSetToLx0ToReplaceNode0, Node7HasAskedItsLeafSetToLx0ToReplaceNode2, Node10HasAskedItsLeafSetToLx0ToReplaceNode0, Node10HasTheLeafSetOfLx0ToReplaceNode0, ANodeFromTheLeafSetOfLx0IsACtiveInTheLeafSet],[RequestOfNode7IsSentToLx0, LeafSetOfLx0IsSentToNode7],[Node13ManageTheCrashOfNode0, Node13HasAskedItsLeafSetToLx0ToReplaceNode0],[RequestOfNode13IsSentToLx0, LeafSetOfLx0IsSentToNode13],[Node0HasDetectedCrashOfNode12, Node1HasDetectedCrashOfNode12, Node2HasDetectedCrashOfNode12, Node3HasDetectedCrashOfNode12, Node4HasDetectedCrashOfNode12, Node5HasDetectedCrashOfNode12, Node6HasDetectedCrashOfNode12, Node7HasDetectedCrashOfNode12, Node9HasDetectedCrashOfNode12, Node10WantsToManageTheCrashOfNode12, Node10HasDetectedCrashOfNode12, Node11HasDetectedCrashOfNode12, Node12NotifyThatHeIsActive, Node12DontAnswerToAnyNode, Node13HasDetectedCrashOfNode12, Node14HasDetectedCrashOfNode12, Node16HasDetectedCrashOfNode12],[Node15HasDetectedCrashOfNode12, Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12],[Node7HasAskedItsLeafSetToRx2ToReplaceNode9, Node7ManageTheCrashOfNode15, Node7HasAskedItsLeafSetToRx0ToReplaceNode15],[Node7HasAskedItsLeafSetToRx0ToReplaceNode9, Node7ManageTheCrashOfNode16, Node7HasAskedItsLeafSetToRx2ToReplaceNode16],[Node7ManageTheCrashOfNode12, RequestOfNode7IsSentToRx0, LeafSetOfRx0IsSentToNode7],[RequestOfNode7IsSentToRx2, LeafSetOfRx2IsSentToNode7],[Node11ManageTheCrashOfNode9, Node11HasDetectedCrashOfNode9, Node11HasAskedItsLeafSetToRx2ToReplaceNode9],[RequestOfNode11IsSentToRx2, LeafSetOfRx2IsSentToNode11],[Node13ManageTheCrashOfNode8, Node13HasDetectedCrashOfNode8, Node13HasAskedItsLeafSetToRx2ToReplaceNode8],[Node13HasDetectedCrashOfNode9, Node13ThinksNode12ShouldBeNodeMasterToReplaceNode9],[RequestOfNode13IsSentToRx2, LeafSetOfRx2IsSentToNode13],[Node12HasAskedItsLeafSetToRx2ToReplaceNode16, Node12HasTheLeafSetOfRx2ToReplaceNode16, ANodeFromTheLeafSetOfRx2IsACtiveInTheLeafSet],[Node2DontAnswerToAnyNode, Node7HasDetectedCrashOfNode2, Node11HasDetectedCrashOfNode1],[Node6DontAnswerToAnyNode, Node7HasDetectedCrashOfNode6, Node8WantsToManageTheCrashOfNode6, Node8HasDetectedCrashOfNode6, Node11HasDetectedCrashOfNode6],[Node7AsksIsThereANodeMaster, Node7HasDetectedCrashOfNode9, Node9DontAnswerToAnyNode, Node10DontAnswerToAnyNode, Node11AsksIsThereANodeMaster, Node11HasDetectedCrashOfNode13, Node13DontAnswerToAnyNode],[Node1WantsToManageTheCrashOfNode15, Node1HasDetectedCrashOfNode15, Node2WantsToManageTheCrashOfNode15, Node2HasDetectedCrashOfNode15, Node7HasDetectedCrashOfNode15, Node11HasDetectedCrashOfNode15, Node15DontAnswerToAnyNode],[Node7HasDetectedCrashOfNode16, Node11HasDetectedCrashOfNode16, Node16DontAnswerToAnyNode],[Node14HasDetectedCrashOfNode9, Node14ThinksNode5ShouldBeNodeMasterToReplaceNode9],[Node14ThinksNode4ShouldBeNodeMasterToReplaceNode9, Node14ThinksNode13ShouldBeNodeMasterToReplaceNode9],[Node15HasDetectedCrashOfNode6, Node15ThinksNode10ShouldBeNodeMasterToReplaceNode6],[Node15ThinksNode14ShouldBeNodeMasterToReplaceNode6, Node15ThinksNode2ShouldBeNodeMasterToReplaceNode6],[Node0HasDetectedCrashOfNode6, Node0ThinksNode10ShouldBeNodeMasterToReplaceNode6, Node0ThinksNode5ShouldBeNodeMasterToReplaceNode6],[Node0ThinksNode3ShouldBeNodeMasterToReplaceNode6, Node0ThinksNode13ShouldBeNodeMasterToReplaceNode6],[Node3HasDetectedCrashOfNode7, Node3ThinksNode10ShouldBeNodeMasterToReplaceNode7],[Node3ThinksNode4ShouldBeNodeMasterToReplaceNode7, Node3ThinksNode12ShouldBeNodeMasterToReplaceNode7],[Node0HasDetectedCrashOfNode5, Node0ThinksNode11ShouldBeNodeMasterToReplaceNode5, Node0ThinksNode4ShouldBeNodeMasterToReplaceNode5],[Node0HasDetectedCrashOfNode7, Node0ThinksNode14ShouldBeNodeMasterToReplaceNode7],[Node1HasDetectedCrashOfNode5, Node1ThinksNode11ShouldBeNodeMasterToReplaceNode5],[Node1HasDetectedCrashOfNode11, Node1ThinksNode5ShouldBeNodeMasterToReplaceNode11],[Node2HasDetectedCrashOfNode6, Node2ThinksNode5ShouldBeNodeMasterToReplaceNode6, Node2ThinksNode11ShouldBeNodeMasterToReplaceNode6],[Node2HasDetectedCrashOfNode7, Node2ThinksNode10ShouldBeNodeMasterToReplaceNode7],[Node2HasDetectedCrashOfNode8, Node2ThinksNode4ShouldBeNodeMasterToReplaceNode8],[Node2HasDetectedCrashOfNode10, Node2ThinksNode3ShouldBeNodeMasterToReplaceNode10],[Node2HasDetectedCrashOfNode11, Node2ThinksNode5ShouldBeNodeMasterToReplaceNode11],[Node4HasDetectedCrashOfNode6, Node4ThinksNode10ShouldBeNodeMasterToReplaceNode6],[Node4HasDetectedCrashOfNode10, Node4ThinksNode5ShouldBeNodeMasterToReplaceNode10],[Node5HasDetectedCrashOfNode7, Node5ThinksNode9ShouldBeNodeMasterToReplaceNode7],[Node5HasDetectedCrashOfNode8, Node5ThinksNode6ShouldBeNodeMasterToReplaceNode8, Node5ThinksNode10ShouldBeNodeMasterToReplaceNode8],[Node6HasDetectedCrashOfNode7, Node6ThinksNode9ShouldBeNodeMasterToReplaceNode7],[Node10HasDetectedCrashOfNode8, Node10ThinksNode7ShouldBeNodeMasterToReplaceNode8],[Node11HasDetectedCrashOfNode7, Node11ThinksNode10ShouldBeNodeMasterToReplaceNode7],[Node11HasDetectedCrashOfNode8, Node11ThinksNode7ShouldBeNodeMasterToReplaceNode8],[Node12HasDetectedCrashOfNode8, Node12ThinksNode11ShouldBeNodeMasterToReplaceNode8],[Node12HasDetectedCrashOfNode11, Node12ThinksNode5ShouldBeNodeMasterToReplaceNode11],[Node13HasDetectedCrashOfNode7, Node13ThinksNode11ShouldBeNodeMasterToReplaceNode7],[Node13HasDetectedCrashOfNode10, Node13ThinksNode4ShouldBeNodeMasterToReplaceNode10],[Node14HasDetectedCrashOfNode10, Node14ThinksNode4ShouldBeNodeMasterToReplaceNode10],[Node14HasDetectedCrashOfNode11, Node14ThinksNode4ShouldBeNodeMasterToReplaceNode11, Node14ThinksNode13ShouldBeNodeMasterToReplaceNode11],[Node0IsTheNodeMaster, Node1HasDetectedCrashOfNode4, Node1HasDetectedCrashOfNode6, Node1HasDetectedCrashOfNode8, Node2HasDetectedCrashOfNode9, Node4IsTheNodeMaster, Node4IsNotifiedThatHeIsTheNewMaster, Node4HasDetectedCrashOfNode5, Node4HasDetectedCrashOfNode7, Node5IsTheNodeMaster, Node5IsNotifiedThatHeIsTheNewMaster, Node6IsTheNodeMaster, Node6IsNotifiedThatHeIsTheNewMaster, Node10IsTheNodeMaster, Node11IsTheNodeMaster, Node11IsNotifiedThatHeIsTheNewMaster, Node12IsTheNodeMaster, Node12IsNotifiedThatHeIsTheNewMaster, Node12HasDetectedCrashOfNode6, Node12HasDetectedCrashOfNode7, Node13HasDetectedCrashOfNode6, Node13HasDetectedCrashOfNode11, Node14HasDetectedCrashOfNode4, Node14HasDetectedCrashOfNode5, Node14HasDetectedCrashOfNode6, Node14HasDetectedCrashOfNode7, Node15IsTheNodeMaster, Node15HasDetectedCrashOfNode7, Node15HasDetectedCrashOfNode11, Node16IsTheNodeMaster, Node16HasDetectedCrashOfNode5, Node16HasDetectedCrashOfNode6, Node16HasDetectedCrashOfNode7, Node16HasDetectedCrashOfNode11],[Node15HasDetectedCrashOfNode8, Node15ThinksNode2ShouldBeNodeMasterToReplaceNode8],[Node15HasDetectedCrashOfNode9, Node15ThinksNode13ShouldBeNodeMasterToReplaceNode9],[Node15HasDetectedCrashOfNode10, Node15ThinksNode2ShouldBeNodeMasterToReplaceNode10],[Node16HasDetectedCrashOfNode4, Node16ThinksNode12ShouldBeNodeMasterToReplaceNode4],[Node16ThinksNode4ShouldBeNodeMasterToReplaceNode6, Node16ThinksNode13ShouldBeNodeMasterToReplaceNode6],[Node16ThinksNode3ShouldBeNodeMasterToReplaceNode6, Node16ThinksNode14ShouldBeNodeMasterToReplaceNode6],[Node16HasDetectedCrashOfNode8, Node16ThinksNode12ShouldBeNodeMasterToReplaceNode8],[Node16ThinksNode4ShouldBeNodeMasterToReplaceNode8, Node16ThinksNode13ShouldBeNodeMasterToReplaceNode8],[Node3ManageTheCrashOfNode2, Node3HasDetectedCrashOfNode2, Node3HasAskedItsLeafSetToLx1ToReplaceNode2, Node3HasAskedItsLeafSetToLx2ToReplaceNode2],[Node3HasTheLeafSetOfLx1ToReplaceNode2, Node4HasAskedItsLeafSetToLx1ToReplaceNode5, Node4HasTheLeafSetOfLx1ToReplaceNode5, Node15HasAskedItsLeafSetToLx1ToReplaceNode4, Node15HasTheLeafSetOfLx1ToReplaceNode4, ANodeFromTheLeafSetOfLx1IsACtiveInTheLeafSet],[Node0ManageTheCrashOfNode2, Node0HasDetectedCrashOfNode2, Node0HasAskedItsLeafSetToLx2ToReplaceNode2],[Node0ManageTheCrashOfNode4, Node0HasDetectedCrashOfNode4, Node0HasAskedItsLeafSetToLx2ToReplaceNode4],[Node2ManageTheCrashOfNode4, Node2HasDetectedCrashOfNode4, Node2HasAskedItsLeafSetToLx2ToReplaceNode4],[RequestOfNode2IsSentToLx2, LeafSetOfLx2IsSentToNode2],[Node4HasAskedItsLeafSetToLx1ToReplaceNode0, Node4ManageTheCrashOfNode7, Node4HasAskedItsLeafSetToLx2ToReplaceNode7, Node4HasDetectedCrashOfNode8, RequestOfNode4IsSentToLx1],[RequestOfNode4IsSentToLx2, LeafSetOfLx2IsSentToNode4],[Node8ManageTheCrashOfNode0, Node8HasAskedItsLeafSetToLx2ToReplaceNode0],[RequestOfNode8IsSentToLx2, LeafSetOfLx2IsSentToNode8],[RequestOfNode0IsSentToLx2, LeafSetOfLx2IsSentToNode0, LeafSetOfLx2IsSentToNode3, Node9HasAskedItsLeafSetToLx2ToReplaceNode0, Node9HasTheLeafSetOfLx2ToReplaceNode0, Node11HasAskedItsLeafSetToLx2ToReplaceNode6, Node11HasTheLeafSetOfLx2ToReplaceNode6, RequestOfNode11IsSentToLx2, Node12HasAskedItsLeafSetToLx2ToReplaceNode2, Node12HasTheLeafSetOfLx2ToReplaceNode2, ANodeFromTheLeafSetOfLx2IsACtiveInTheLeafSet],[Node3ManageTheCrashOfNode9, Node3HasDetectedCrashOfNode9, Node3HasAskedItsLeafSetToRx0ToReplaceNode9, Node3HasAskedItsLeafSetToRx1ToReplaceNode9, Node3HasDetectedCrashOfNode10, Node3HasDetectedCrashOfNode11, Node3HasDetectedCrashOfNode13, Node3HasDetectedCrashOfNode15, RequestOfNode3IsSentToRx0, RequestOfNode3IsSentToRx1, Node5HasAskedItsLeafSetToRx0ToReplaceNode9, Node5HasAskedItsLeafSetToRx1ToReplaceNode9, Node5HasDetectedCrashOfNode11, Node5ManageTheCrashOfNode12],[Node3ManageTheCrashOfNode12, Node3HasAskedItsLeafSetToRx0ToReplaceNode12, Node3HasAskedItsLeafSetToRx1ToReplaceNode12],[Node5HasDetectedCrashOfNode10, Node5HasAskedItsLeafSetToRx0ToReplaceNode10, Node5HasTheLeafSetOfRx0ToReplaceNode10, RequestOfNode5IsSentToRx0],[Node5ManageTheCrashOfNode15, Node5HasDetectedCrashOfNode15, Node5HasAskedItsLeafSetToRx1ToReplaceNode15],[Node9ManageTheCrashOfNode8, Node9HasDetectedCrashOfNode8, Node9HasAskedItsLeafSetToRx1ToReplaceNode8],[RequestOfNode9IsSentToRx1, LeafSetOfRx1IsSentToNode9],[Node10ManageTheCrashOfNode16, Node10HasDetectedCrashOfNode16, Node10HasAskedItsLeafSetToRx1ToReplaceNode16],[RequestOfNode10IsSentToRx1, LeafSetOfRx1IsSentToNode10],[LeafSetOfRx0IsSentToNode3, Node15HasAskedItsLeafSetToRx0ToReplaceNode9, Node15HasTheLeafSetOfRx0ToReplaceNode9, RequestOfNode15IsSentToRx0, ANodeFromTheLeafSetOfRx0IsACtiveInTheLeafSet],[Node0HasAskedItsLeafSetToRx1ToReplaceNode12, Node0HasTheLeafSetOfRx1ToReplaceNode12, Node1HasAskedItsLeafSetToRx1ToReplaceNode15, Node1HasTheLeafSetOfRx1ToReplaceNode15, LeafSetOfRx1IsSentToNode3, Node4HasAskedItsLeafSetToRx1ToReplaceNode14, Node4HasTheLeafSetOfRx1ToReplaceNode14, Node5HasAskedItsLeafSetToRx1ToReplaceNode10, Node5HasTheLeafSetOfRx1ToReplaceNode10, RequestOfNode5IsSentToRx1, LeafSetOfRx1IsSentToNode5, Node14HasAskedItsLeafSetToRx1ToReplaceNode10, Node14HasTheLeafSetOfRx1ToReplaceNode10, ANodeFromTheLeafSetOfRx1IsACtiveInTheLeafSet],

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 16:34:07] [INFO ] Flatten gal took : 174 ms
[2024-05-24 16:34:07] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability463942907054947539.gal : 27 ms
[2024-05-24 16:34:07] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12851008955850688341.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/ReachabilityFireability463942907054947539.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12851008955850688341.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/ReachabilityFireability12851008955850688341.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :11 after 21
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :21 after 29
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :29 after 44
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :44 after 71
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :71 after 83
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :83 after 191
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :191 after 418
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :418 after 424
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :424 after 545
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :545 after 747
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :747 after 1036
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1036 after 1428
LTSmin run took 1012111 ms.
Invariant validated
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin16870097640301131179;'/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' 'MultiCrashLeafsetExtensionPTS16C03ReachabilityFireability202404==true'
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :1428 after 5535
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :5535 after 7884
SDD proceeding with computation,5 properties remain. new max is 131072
SDD size :7884 after 11215

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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C03"
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-S16C03, 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-171654350700015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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