Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 376K 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 ShieldPPPt-PT-020B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717012732162

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-29 19:58:53] [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-29 19:58:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:58:53] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2024-05-29 19:58:53] [INFO ] Transformed 1563 places.
[2024-05-29 19:58:53] [INFO ] Transformed 1423 transitions.
[2024-05-29 19:58:53] [INFO ] Found NUPN structural information;
[2024-05-29 19:58:53] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2197 ms. (18 steps per ms) remains 8/16 properties
[2024-05-29 19:58:54] [INFO ] Flatten gal took : 245 ms
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 399 ms. (100 steps per ms) remains 8/8 properties
[2024-05-29 19:58:54] [INFO ] Flatten gal took : 165 ms
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 8/8 properties
[2024-05-29 19:58:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12508622895210872409.gal : 72 ms
[2024-05-29 19:58:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9605113466305423329.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12508622895210872409.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9605113466305423329.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

BEST_FIRST walk for 40004 steps (8 resets) in 714 ms. (55 steps per ms) remains 8/8 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 541 ms. (73 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality9605113466305423329.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
// Phase 1: matrix 1423 rows 1563 cols
[2024-05-29 19:58:55] [INFO ] Computed 221 invariants in 41 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1376/1551 variables, 220/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1551 variables, 1376/1771 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
At refinement iteration 4 (INCLUDED_ONLY) 0/1551 variables, 0/1771 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :19 after 28
At refinement iteration 5 (OVERLAPS) 12/1563 variables, 1/1772 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :28 after 44
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :44 after 853
At refinement iteration 6 (INCLUDED_ONLY) 0/1563 variables, 12/1784 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :853 after 534613
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :534613 after 1.15741e+09
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :1.15741e+09 after 2.52579e+17
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :2.52579e+17 after 1.34158e+32
At refinement iteration 7 (INCLUDED_ONLY) 0/1563 variables, 0/1784 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Reachability property ShieldPPPt-PT-020B-ReachabilityFireability-2024-13 is true.
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 8 (OVERLAPS) 1423/2986 variables, 1563/3347 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2986 variables, 0/3347 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/2986 variables, 0/3347 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2986/2986 variables, and 3347 constraints, problems are : Problem set: 1 solved, 7 unsolved in 2908 ms.
Refiners :[Domain max(s): 1563/1563 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 1563/1563 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 175/175 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1376/1551 variables, 220/395 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1551 variables, 1376/1771 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-29 19:59:00] [INFO ] Deduced a trap composed of 22 places in 554 ms of which 60 ms to minimize.
[2024-05-29 19:59:01] [INFO ] Deduced a trap composed of 21 places in 545 ms of which 36 ms to minimize.
[2024-05-29 19:59:01] [INFO ] Deduced a trap composed of 28 places in 388 ms of which 10 ms to minimize.
[2024-05-29 19:59:02] [INFO ] Deduced a trap composed of 33 places in 490 ms of which 5 ms to minimize.
[2024-05-29 19:59:03] [INFO ] Deduced a trap composed of 28 places in 600 ms of which 3 ms to minimize.
[2024-05-29 19:59:04] [INFO ] Deduced a trap composed of 21 places in 1822 ms of which 3 ms to minimize.
SMT process timed out in 9695ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 175 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 1563 transition count 1172
Reduce places removed 251 places and 0 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 1 with 301 rules applied. Total rules applied 552 place count 1312 transition count 1122
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 2 with 50 rules applied. Total rules applied 602 place count 1262 transition count 1122
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 602 place count 1262 transition count 1038
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 770 place count 1178 transition count 1038
Discarding 114 places :
Symmetric choice reduction at 3 with 114 rule applications. Total rules 884 place count 1064 transition count 924
Iterating global reduction 3 with 114 rules applied. Total rules applied 998 place count 1064 transition count 924
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 999 place count 1064 transition count 923
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 31 Pre rules applied. Total rules applied 999 place count 1064 transition count 892
Deduced a syphon composed of 31 places in 6 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 1061 place count 1033 transition count 892
Performed 265 Post agglomeration using F-continuation condition.Transition count delta: 265
Deduced a syphon composed of 265 places in 7 ms
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 4 with 530 rules applied. Total rules applied 1591 place count 768 transition count 627
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 6 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 1653 place count 737 transition count 627
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1654 place count 737 transition count 626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1655 place count 736 transition count 626
Partial Free-agglomeration rule applied 50 times.
Drop transitions (Partial Free agglomeration) removed 50 transitions
Iterating global reduction 5 with 50 rules applied. Total rules applied 1705 place count 736 transition count 626
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1706 place count 735 transition count 625
Applied a total of 1706 rules in 595 ms. Remains 735 /1563 variables (removed 828) and now considering 625/1423 (removed 798) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 604 ms. Remains : 735/1563 places, 625/1423 transitions.
RANDOM walk for 40000 steps (8 resets) in 927 ms. (43 steps per ms) remains 5/7 properties
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 337 ms. (118 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 323 ms. (123 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 199 ms. (200 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 5/5 properties
// Phase 1: matrix 625 rows 735 cols
[2024-05-29 19:59:06] [INFO ] Computed 221 invariants in 13 ms
[2024-05-29 19:59:06] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 586/726 variables, 217/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/726 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 9/735 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/735 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 625/1360 variables, 735/956 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1360 variables, 56/1012 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1360 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1360 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1360/1360 variables, and 1012 constraints, problems are : Problem set: 0 solved, 5 unsolved in 820 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 735/735 constraints, ReadFeed: 56/56 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/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 586/726 variables, 217/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:59:07] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 16 ms to minimize.
[2024-05-29 19:59:07] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-29 19:59:07] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:59:07] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-29 19:59:07] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:59:07] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-29 19:59:08] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 3 ms to minimize.
[2024-05-29 19:59:08] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-29 19:59:08] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-29 19:59:08] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-29 19:59:08] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-29 19:59:08] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 2 ms to minimize.
[2024-05-29 19:59:08] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-29 19:59:08] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-05-29 19:59:08] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-05-29 19:59:08] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-29 19:59:09] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-29 19:59:09] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-29 19:59:09] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-29 19:59:09] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/726 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:59:09] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-29 19:59:09] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-29 19:59:09] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-05-29 19:59:09] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-29 19:59:09] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-29 19:59:09] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 3 ms to minimize.
[2024-05-29 19:59:09] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-29 19:59:10] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-29 19:59:10] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-29 19:59:10] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-29 19:59:10] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-29 19:59:10] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:59:10] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-29 19:59:10] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-05-29 19:59:10] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-05-29 19:59:10] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/726 variables, 16/253 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:59:10] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-29 19:59:11] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:59:11] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-29 19:59:11] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/726 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:59:11] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 9/735 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/735 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 625/1360 variables, 735/997 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1360 variables, 56/1053 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1360 variables, 5/1058 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:59:13] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 3 ms to minimize.
[2024-05-29 19:59:13] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 3 ms to minimize.
[2024-05-29 19:59:13] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-05-29 19:59:13] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 3 ms to minimize.
[2024-05-29 19:59:13] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 3 ms to minimize.
[2024-05-29 19:59:13] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 3 ms to minimize.
[2024-05-29 19:59:14] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-29 19:59:14] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 3 ms to minimize.
[2024-05-29 19:59:14] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 9 ms to minimize.
[2024-05-29 19:59:14] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-29 19:59:14] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-29 19:59:14] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-29 19:59:14] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-29 19:59:15] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-29 19:59:15] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-29 19:59:15] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 19:59:15] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1360 variables, 17/1075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1360 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1360 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1360/1360 variables, and 1075 constraints, problems are : Problem set: 0 solved, 5 unsolved in 10088 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 735/735 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 58/58 constraints]
After SMT, in 10989ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4620 ms.
Support contains 140 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 625/625 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 735 transition count 619
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 729 transition count 619
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 729 transition count 615
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 725 transition count 615
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 723 transition count 612
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 723 transition count 612
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 723 transition count 611
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 722 transition count 611
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 5 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 64 place count 703 transition count 592
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 701 transition count 592
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 701 transition count 590
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 699 transition count 590
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 77 place count 699 transition count 590
Applied a total of 77 rules in 211 ms. Remains 699 /735 variables (removed 36) and now considering 590/625 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 699/735 places, 590/625 transitions.
RANDOM walk for 40000 steps (8 resets) in 371 ms. (107 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 202 ms. (197 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 310 ms. (128 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 189021 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 5
Probabilistic random walk after 189021 steps, saw 116564 distinct states, run finished after 3004 ms. (steps per millisecond=62 ) properties seen :0
// Phase 1: matrix 590 rows 699 cols
[2024-05-29 19:59:25] [INFO ] Computed 221 invariants in 3 ms
[2024-05-29 19:59:25] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 550/690 variables, 217/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/690 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 9/699 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 590/1289 variables, 699/920 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1289 variables, 64/984 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1289 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1289 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1289/1289 variables, and 984 constraints, problems are : Problem set: 0 solved, 5 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 699/699 constraints, ReadFeed: 64/64 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/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 550/690 variables, 217/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:59:26] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-29 19:59:26] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-29 19:59:26] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-29 19:59:27] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-29 19:59:27] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-29 19:59:27] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-05-29 19:59:27] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-29 19:59:27] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-29 19:59:27] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-29 19:59:27] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:59:27] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:59:27] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:59:27] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:59:27] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-29 19:59:27] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:59:28] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:59:28] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:59:28] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:59:28] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-05-29 19:59:28] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/690 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:59:28] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:59:28] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-29 19:59:28] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2024-05-29 19:59:28] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-29 19:59:28] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-29 19:59:28] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:59:28] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-29 19:59:28] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
[2024-05-29 19:59:29] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-29 19:59:29] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-29 19:59:29] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:59:29] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-05-29 19:59:29] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-29 19:59:29] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:59:29] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:59:29] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-29 19:59:29] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-29 19:59:29] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:59:29] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/690 variables, 19/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:59:29] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:59:29] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:59:30] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/690 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:59:30] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:59:30] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:59:30] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/690 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 9/699 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/699 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 590/1289 variables, 699/965 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1289 variables, 64/1029 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1289 variables, 5/1034 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:59:31] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-05-29 19:59:31] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-29 19:59:31] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:59:31] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-05-29 19:59:32] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:59:32] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1289 variables, 6/1040 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1289 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1289 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1289/1289 variables, and 1040 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7644 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 699/699 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 51/51 constraints]
After SMT, in 8481ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 5582 ms.
Support contains 140 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 590/590 transitions.
Applied a total of 0 rules in 30 ms. Remains 699 /699 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 699/699 places, 590/590 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 590/590 transitions.
Applied a total of 0 rules in 14 ms. Remains 699 /699 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2024-05-29 19:59:39] [INFO ] Invariant cache hit.
[2024-05-29 19:59:40] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-29 19:59:40] [INFO ] Invariant cache hit.
[2024-05-29 19:59:40] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-29 19:59:41] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
[2024-05-29 19:59:41] [INFO ] Redundant transitions in 34 ms returned []
Running 588 sub problems to find dead transitions.
[2024-05-29 19:59:41] [INFO ] Invariant cache hit.
[2024-05-29 19:59:41] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (OVERLAPS) 2/699 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-29 19:59:52] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:59:52] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:59:52] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:59:52] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:59:52] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:59:52] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:59:52] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:59:53] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 4 ms to minimize.
[2024-05-29 19:59:53] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:59:53] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:59:53] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:59:53] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:59:53] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:59:53] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:59:53] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:59:53] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:59:53] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:59:53] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:59:53] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:59:53] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/699 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-29 19:59:54] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
[2024-05-29 19:59:54] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:59:54] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:59:54] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:59:54] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-29 20:00:02] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:00:02] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:00:02] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:00:03] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:00:03] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:00:03] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:00:03] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 20:00:04] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:00:04] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:00:04] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:00:04] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-29 20:00:04] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 20:00:04] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:00:04] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:00:04] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 20:00:04] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:00:05] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:00:05] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:00:05] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:00:05] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-05-29 20:00:09] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:00:09] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:00:09] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:00:09] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 20:00:09] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:00:09] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:00:10] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:00:11] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-05-29 20:00:11] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2024-05-29 20:00:11] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:00:11] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-05-29 20:00:11] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
SMT process timed out in 30151ms, After SMT, problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 30177ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31549 ms. Remains : 699/699 places, 590/590 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 59 times.
Drop transitions (Partial Free agglomeration) removed 59 transitions
Iterating global reduction 0 with 59 rules applied. Total rules applied 59 place count 699 transition count 590
Applied a total of 59 rules in 36 ms. Remains 699 /699 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 590 rows 699 cols
[2024-05-29 20:00:11] [INFO ] Computed 221 invariants in 3 ms
[2024-05-29 20:00:11] [INFO ] [Real]Absence check using 221 positive place invariants in 31 ms returned sat
[2024-05-29 20:00:11] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 20:00:11] [INFO ] [Nat]Absence check using 221 positive place invariants in 32 ms returned sat
[2024-05-29 20:00:12] [INFO ] After 535ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 20:00:12] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 20:00:12] [INFO ] After 440ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-29 20:00:12] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 3 ms to minimize.
[2024-05-29 20:00:13] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 3 ms to minimize.
[2024-05-29 20:00:13] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-05-29 20:00:13] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 3 ms to minimize.
[2024-05-29 20:00:13] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-29 20:00:13] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-05-29 20:00:13] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-05-29 20:00:13] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-29 20:00:13] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-05-29 20:00:14] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-29 20:00:14] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-29 20:00:14] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-29 20:00:14] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-29 20:00:14] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-05-29 20:00:14] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-29 20:00:14] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 3 ms to minimize.
[2024-05-29 20:00:14] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-29 20:00:14] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2211 ms
[2024-05-29 20:00:15] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-29 20:00:15] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-29 20:00:15] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-29 20:00:15] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-29 20:00:15] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-05-29 20:00:15] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-29 20:00:15] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2024-05-29 20:00:15] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-29 20:00:16] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:00:16] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:00:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1122 ms
[2024-05-29 20:00:16] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-29 20:00:16] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-29 20:00:16] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-05-29 20:00:16] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-29 20:00:17] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:00:17] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-05-29 20:00:17] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-29 20:00:17] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-29 20:00:17] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:00:17] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-29 20:00:17] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:00:17] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-29 20:00:17] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1525 ms
[2024-05-29 20:00:18] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-29 20:00:18] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-29 20:00:18] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-29 20:00:18] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-29 20:00:18] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-29 20:00:18] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 3 ms to minimize.
[2024-05-29 20:00:18] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-29 20:00:18] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-29 20:00:18] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-29 20:00:19] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-29 20:00:19] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-29 20:00:19] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-29 20:00:19] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-05-29 20:00:19] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1458 ms
[2024-05-29 20:00:19] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-29 20:00:19] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-29 20:00:19] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-29 20:00:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 376 ms
TRAPS : Iteration 1
[2024-05-29 20:00:20] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-05-29 20:00:20] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-29 20:00:20] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-29 20:00:20] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-29 20:00:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 485 ms
[2024-05-29 20:00:20] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2024-05-29 20:00:20] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-29 20:00:20] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 3 ms to minimize.
[2024-05-29 20:00:21] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 3 ms to minimize.
[2024-05-29 20:00:21] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-29 20:00:21] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-29 20:00:21] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-29 20:00:21] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 3 ms to minimize.
[2024-05-29 20:00:21] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-29 20:00:21] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 4 ms to minimize.
[2024-05-29 20:00:21] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-29 20:00:22] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-29 20:00:22] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:00:22] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-29 20:00:22] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1724 ms
[2024-05-29 20:00:22] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:00:22] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:00:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2024-05-29 20:00:22] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-29 20:00:22] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-29 20:00:23] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-29 20:00:23] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-29 20:00:23] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-29 20:00:23] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-29 20:00:23] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-29 20:00:23] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:00:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 933 ms
TRAPS : Iteration 2
[2024-05-29 20:00:23] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-29 20:00:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-29 20:00:24] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 3 ms to minimize.
[2024-05-29 20:00:24] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-05-29 20:00:24] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 3 ms to minimize.
[2024-05-29 20:00:24] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2024-05-29 20:00:24] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-05-29 20:00:24] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-05-29 20:00:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 955 ms
[2024-05-29 20:00:25] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-29 20:00:25] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:00:25] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-29 20:00:25] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-29 20:00:25] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-29 20:00:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 644 ms
[2024-05-29 20:00:26] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-29 20:00:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2024-05-29 20:00:26] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-29 20:00:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
TRAPS : Iteration 3
[2024-05-29 20:00:26] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-29 20:00:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2024-05-29 20:00:26] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:00:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-05-29 20:00:27] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-29 20:00:27] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:00:27] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-29 20:00:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 329 ms
[2024-05-29 20:00:27] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:00:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
TRAPS : Iteration 4
[2024-05-29 20:00:28] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-29 20:00:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2024-05-29 20:00:28] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:00:28] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:00:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2024-05-29 20:00:28] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:00:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
TRAPS : Iteration 5
[2024-05-29 20:00:29] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2024-05-29 20:00:29] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-29 20:00:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 300 ms
[2024-05-29 20:00:30] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-29 20:00:30] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-05-29 20:00:30] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2024-05-29 20:00:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 437 ms
[2024-05-29 20:00:30] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:00:30] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-05-29 20:00:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
TRAPS : Iteration 6
[2024-05-29 20:00:31] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-29 20:00:31] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-29 20:00:31] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 3 ms to minimize.
[2024-05-29 20:00:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 406 ms
[2024-05-29 20:00:31] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-05-29 20:00:31] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-05-29 20:00:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2024-05-29 20:00:32] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:00:32] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-29 20:00:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2024-05-29 20:00:32] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-05-29 20:00:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
TRAPS : Iteration 7
[2024-05-29 20:00:33] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-29 20:00:33] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-29 20:00:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 313 ms
[2024-05-29 20:00:33] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-05-29 20:00:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-05-29 20:00:34] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:00:34] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-29 20:00:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
TRAPS : Iteration 8
[2024-05-29 20:00:34] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-29 20:00:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2024-05-29 20:00:35] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:00:35] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:00:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 262 ms
[2024-05-29 20:00:35] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-29 20:00:35] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:00:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
TRAPS : Iteration 9
[2024-05-29 20:00:36] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-29 20:00:36] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 3 ms to minimize.
[2024-05-29 20:00:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2024-05-29 20:00:36] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-29 20:00:36] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-29 20:00:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
TRAPS : Iteration 10
[2024-05-29 20:00:37] [INFO ] After 25543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-29 20:00:38] [INFO ] After 27126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2024-05-29 20:00:38] [INFO ] Flatten gal took : 30 ms
[2024-05-29 20:00:38] [INFO ] Flatten gal took : 28 ms
[2024-05-29 20:00:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality538977261280830097.gal : 5 ms
[2024-05-29 20:00:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16899331507391808133.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality538977261280830097.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16899331507391808133.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/ReachabilityCardinality16899331507391808133.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 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 14
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :14 after 50
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :50 after 298
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :298 after 374
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :374 after 8105
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :8105 after 3.00056e+09
Detected timeout of ITS tools.
[2024-05-29 20:00:53] [INFO ] Flatten gal took : 28 ms
[2024-05-29 20:00:53] [INFO ] Applying decomposition
[2024-05-29 20:00:53] [INFO ] Flatten gal took : 26 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/graph10725881840696419744.txt' '-o' '/tmp/graph10725881840696419744.bin' '-w' '/tmp/graph10725881840696419744.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10725881840696419744.bin' '-l' '-1' '-v' '-w' '/tmp/graph10725881840696419744.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:00:54] [INFO ] Decomposing Gal with order
[2024-05-29 20:00:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:00:54] [INFO ] Removed a total of 160 redundant transitions.
[2024-05-29 20:00:54] [INFO ] Flatten gal took : 196 ms
[2024-05-29 20:00:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 31 ms.
[2024-05-29 20:00:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2351620358752699457.gal : 21 ms
[2024-05-29 20:00:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1248335167146535804.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/ReachabilityCardinality2351620358752699457.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1248335167146535804.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/ReachabilityCardinality1248335167146535804.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 46
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :46 after 2266
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :26136 after 2.52105e+09
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :2.52105e+09 after 4.57527e+17
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 58392 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 20:01:09] [INFO ] Flatten gal took : 36 ms
[2024-05-29 20:01:09] [INFO ] Applying decomposition
[2024-05-29 20:01:09] [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/graph16789109910566475910.txt' '-o' '/tmp/graph16789109910566475910.bin' '-w' '/tmp/graph16789109910566475910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16789109910566475910.bin' '-l' '-1' '-v' '-w' '/tmp/graph16789109910566475910.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:01:09] [INFO ] Decomposing Gal with order
[2024-05-29 20:01:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:01:10] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-29 20:01:10] [INFO ] Flatten gal took : 75 ms
[2024-05-29 20:01:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-29 20:01:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9445044317164943691.gal : 15 ms
[2024-05-29 20:01:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16047936837131956459.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/ReachabilityCardinality9445044317164943691.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16047936837131956459.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/ReachabilityCardinality16047936837131956459.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 12066
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :12066 after 8.06656e+21
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :8.06656e+21 after 2.19538e+61
ITS-tools command line returned an error code 137
[2024-05-29 20:09:11] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7956078590731752623
[2024-05-29 20:09:11] [INFO ] Computing symmetric may disable matrix : 590 transitions.
[2024-05-29 20:09:11] [INFO ] Applying decomposition
[2024-05-29 20:09:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:09:11] [INFO ] Computing symmetric may enable matrix : 590 transitions.
[2024-05-29 20:09:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:09:11] [INFO ] Flatten gal took : 25 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/graph12529222318647276612.txt' '-o' '/tmp/graph12529222318647276612.bin' '-w' '/tmp/graph12529222318647276612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12529222318647276612.bin' '-l' '-1' '-v' '-w' '/tmp/graph12529222318647276612.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:09:11] [INFO ] Decomposing Gal with order
[2024-05-29 20:09:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:09:11] [INFO ] Removed a total of 210 redundant transitions.
[2024-05-29 20:09:11] [INFO ] Flatten gal took : 32 ms
[2024-05-29 20:09:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 64 ms.
[2024-05-29 20:09:11] [INFO ] Computing Do-Not-Accords matrix : 590 transitions.
[2024-05-29 20:09:11] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13859771602269557416.gal : 18 ms
[2024-05-29 20:09:11] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16076145977584632090.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/ReachabilityFireability13859771602269557416.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16076145977584632090.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
[2024-05-29 20:09:11] [INFO ] Computation of Completed DNA matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:09:11] [INFO ] Built C files in 350ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7956078590731752623
Running compilation step : cd /tmp/ltsmin7956078590731752623;'/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'
Loading property file /tmp/ReachabilityFireability16076145977584632090.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 78
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :17492 after 104952
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :104952 after 1.33893e+11
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1.38068e+17 after 9.26509e+19
Compilation finished in 2065 ms.
Running link step : cd /tmp/ltsmin7956078590731752623;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin7956078590731752623;'/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' 'ShieldPPPtPT020BReachabilityFireability202407==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin7956078590731752623;'/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' 'ShieldPPPtPT020BReachabilityFireability202407==true'
Running LTSmin : cd /tmp/ltsmin7956078590731752623;'/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' 'ShieldPPPtPT020BReachabilityFireability202410==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin7956078590731752623;'/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' 'ShieldPPPtPT020BReachabilityFireability202410==true'
Running LTSmin : cd /tmp/ltsmin7956078590731752623;'/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' 'ShieldPPPtPT020BReachabilityFireability202411==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin7956078590731752623;'/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' 'ShieldPPPtPT020BReachabilityFireability202411==true'
Running LTSmin : cd /tmp/ltsmin7956078590731752623;'/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' 'ShieldPPPtPT020BReachabilityFireability202412==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin7956078590731752623;'/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' 'ShieldPPPtPT020BReachabilityFireability202412==true'
Running LTSmin : cd /tmp/ltsmin7956078590731752623;'/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' 'ShieldPPPtPT020BReachabilityFireability202414==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin7956078590731752623;'/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' 'ShieldPPPtPT020BReachabilityFireability202414==true'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin7956078590731752623;'/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' 'ShieldPPPtPT020BReachabilityFireability202407==true'
Detected timeout of ITS tools.
[2024-05-29 20:32:37] [INFO ] Applying decomposition
[2024-05-29 20:32:37] [INFO ] Flatten gal took : 57 ms
[2024-05-29 20:32:37] [INFO ] Decomposing Gal with order
[2024-05-29 20:32:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:32:37] [INFO ] Removed a total of 200 redundant transitions.
[2024-05-29 20:32:37] [INFO ] Flatten gal took : 79 ms
[2024-05-29 20:32:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 51 ms.
[2024-05-29 20:32:38] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11494917973115070670.gal : 24 ms
[2024-05-29 20:32:38] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5077218040158195887.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/ReachabilityFireability11494917973115070670.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5077218040158195887.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/ReachabilityFireability5077218040158195887.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 46
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :46 after 6442
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :17492 after 4.25248e+08
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1.38068e+17 after 9.88338e+18
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.280: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.290: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.290: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.315: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.332: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.332: Initializing POR dependencies: labels 595, guards 590
pins2lts-mc-linux64( 5/ 8), 0.369: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.373: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.381: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 7.427: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 7/ 8), 7.452: "ShieldPPPtPT020BReachabilityFireability202407==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 7.454: "ShieldPPPtPT020BReachabilityFireability202407==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 7.455: "ShieldPPPtPT020BReachabilityFireability202407==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 7.455: "ShieldPPPtPT020BReachabilityFireability202407==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 7.456: "ShieldPPPtPT020BReachabilityFireability202407==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 7.454: "ShieldPPPtPT020BReachabilityFireability202407==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 7.454: "ShieldPPPtPT020BReachabilityFireability202407==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 7.456: There are 595 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 7.456: State length is 699, there are 590 groups
pins2lts-mc-linux64( 0/ 8), 7.456: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 7.456: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 7.456: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 7.456: Visible groups: 0 / 590, labels: 1 / 595
pins2lts-mc-linux64( 0/ 8), 7.456: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 7.456: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 7.454: "ShieldPPPtPT020BReachabilityFireability202407==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 7.530: ~85 levels ~960 states ~1280 transitions
pins2lts-mc-linux64( 0/ 8), 7.582: ~88 levels ~1920 states ~3528 transitions
pins2lts-mc-linux64( 5/ 8), 7.683: ~14 levels ~3840 states ~8296 transitions
pins2lts-mc-linux64( 0/ 8), 7.888: ~91 levels ~7680 states ~19640 transitions
pins2lts-mc-linux64( 5/ 8), 8.256: ~17 levels ~15360 states ~38544 transitions
pins2lts-mc-linux64( 0/ 8), 9.011: ~94 levels ~30720 states ~91952 transitions
pins2lts-mc-linux64( 4/ 8), 10.332: ~13 levels ~61440 states ~189528 transitions
pins2lts-mc-linux64( 3/ 8), 12.868: ~14 levels ~122880 states ~386112 transitions
pins2lts-mc-linux64( 3/ 8), 17.765: ~15 levels ~245760 states ~822816 transitions
pins2lts-mc-linux64( 3/ 8), 27.571: ~17 levels ~491520 states ~1739896 transitions
pins2lts-mc-linux64( 3/ 8), 47.458: ~18 levels ~983040 states ~3764368 transitions
pins2lts-mc-linux64( 3/ 8), 90.070: ~19 levels ~1966080 states ~8302368 transitions
pins2lts-mc-linux64( 3/ 8), 182.248: ~21 levels ~3932160 states ~18515880 transitions
pins2lts-mc-linux64( 3/ 8), 374.887: ~22 levels ~7864320 states ~40497624 transitions
pins2lts-mc-linux64( 3/ 8), 791.897: ~23 levels ~15728640 states ~89758400 transitions
pins2lts-mc-linux64( 6/ 8), 834.510: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 834.699:
pins2lts-mc-linux64( 0/ 8), 834.699: mean standard work distribution: 5.6% (states) 3.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 834.699:
pins2lts-mc-linux64( 0/ 8), 834.699: Explored 14985265 states 98526756 transitions, fanout: 6.575
pins2lts-mc-linux64( 0/ 8), 834.699: Total exploration time 827.240 sec (827.060 sec minimum, 827.114 sec on average)
pins2lts-mc-linux64( 0/ 8), 834.699: States per second: 18115, Transitions per second: 119103
pins2lts-mc-linux64( 0/ 8), 834.699: Ignoring proviso: 9729404
pins2lts-mc-linux64( 0/ 8), 834.699:
pins2lts-mc-linux64( 0/ 8), 834.699: Queue width: 8B, total height: 12481952, memory: 95.23MB
pins2lts-mc-linux64( 0/ 8), 834.699: Tree memory: 465.5MB, 17.8 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 834.700: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 834.700: Stored 597 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 834.700: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 834.700: Est. total memory use: 560.8MB (~1119.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7956078590731752623;'/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' 'ShieldPPPtPT020BReachabilityFireability202407==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7956078590731752623;'/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' 'ShieldPPPtPT020BReachabilityFireability202407==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:840)
Reachability property ShieldPPPt-PT-020B-ReachabilityFireability-2024-12 is true.
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Detected timeout of ITS tools.
[2024-05-29 20:56:03] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:56:03] [INFO ] Input system was already deterministic with 590 transitions.
[2024-05-29 20:56:03] [INFO ] Transformed 699 places.
[2024-05-29 20:56:03] [INFO ] Transformed 590 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 20:56:03] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12186094116069278861.gal : 4 ms
[2024-05-29 20:56:03] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16044140771093287823.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability12186094116069278861.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16044140771093287823.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...375
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability16044140771093287823.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 24
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :24 after 168
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :168 after 1954
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1954 after 21816
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :21816 after 1.37826e+06
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.37826e+06 after 3.99898e+07
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :3.99898e+07 after 1.27392e+10
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.27392e+10 after 1.86555e+12
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.86555e+12 after 2.69293e+14
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :2.69293e+14 after 7.08243e+17
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :7.08243e+17 after 3.64495e+21
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :3.64495e+21 after 1.54271e+26
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :1.54271e+26 after 3.85431e+30
SDD proceeding with computation,4 properties remain. new max is 262144
SDD size :3.85431e+30 after 2.24491e+35
SDD proceeding with computation,4 properties remain. new max is 524288
SDD size :2.24491e+35 after 5.35005e+39

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="ShieldPPPt-PT-020B"
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 ShieldPPPt-PT-020B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683761500639"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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