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.r158-smll-171636266300167.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 EisenbergMcGuire-PT-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266300167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 460K May 18 16:42 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 EisenbergMcGuire-PT-05-ReachabilityFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-12
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-13
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-14
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716517056042

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-24 02:17:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 02:17:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 02:17:39] [INFO ] Load time of PNML (sax parser for PT used): 284 ms
[2024-05-24 02:17:39] [INFO ] Transformed 295 places.
[2024-05-24 02:17:39] [INFO ] Transformed 800 transitions.
[2024-05-24 02:17:39] [INFO ] Found NUPN structural information;
[2024-05-24 02:17:39] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 540 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3614 ms. (11 steps per ms) remains 15/16 properties
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 233 ms. (17 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 14/15 properties
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 14/14 properties
[2024-05-24 02:17:40] [INFO ] Flatten gal took : 521 ms
BEST_FIRST walk for 4004 steps (8 resets) in 358 ms. (11 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 281 ms. (14 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 14/14 properties
[2024-05-24 02:17:41] [INFO ] Flatten gal took : 186 ms
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 196 ms. (20 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 14/14 properties
[2024-05-24 02:17:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15029866244417903764.gal : 72 ms
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
[2024-05-24 02:17:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16996765142519353049.prop : 8 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/ReachabilityCardinality15029866244417903764.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16996765142519353049.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 14/14 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
[2024-05-24 02:17:41] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
// Phase 1: matrix 465 rows 295 cols
Loading property file /tmp/ReachabilityCardinality16996765142519353049.prop.
[2024-05-24 02:17:41] [INFO ] Computed 16 invariants in 25 ms
[2024-05-24 02:17:41] [INFO ] State equation strengthened by 196 read => feed constraints.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :10 after 15
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :15 after 16
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :16 after 74
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :74 after 144
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :144 after 560
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :560 after 1143
All remaining problems are real, not stopping.
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :1143 after 3144
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-00 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-02 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 1/140 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 12 unsolved
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-06 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 156/295 variables, 10/150 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 156/306 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 5/311 constraints. Problems are: Problem set: 3 solved, 11 unsolved
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :3144 after 4344
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 465/760 variables, 295/606 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 196/802 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 0/802 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/760 variables, 0/802 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 760/760 variables, and 802 constraints, problems are : Problem set: 3 solved, 11 unsolved in 1872 ms.
Refiners :[Domain max(s): 295/295 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 295/295 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :4344 after 32551
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-05 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/111 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/111 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-09 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 185/295 variables, 10/121 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 185/306 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 5/311 constraints. Problems are: Problem set: 5 solved, 9 unsolved
[2024-05-24 02:17:44] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 43 ms to minimize.
[2024-05-24 02:17:44] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-05-24 02:17:44] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2024-05-24 02:17:44] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 3 ms to minimize.
[2024-05-24 02:17:45] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 3 ms to minimize.
[2024-05-24 02:17:45] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 3 ms to minimize.
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-10 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-24 02:17:45] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-05-24 02:17:45] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:17:45] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 3 ms to minimize.
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :32551 after 56997
[2024-05-24 02:17:45] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 4 ms to minimize.
[2024-05-24 02:17:46] [INFO ] Deduced a trap composed of 71 places in 189 ms of which 3 ms to minimize.
[2024-05-24 02:17:46] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 2 ms to minimize.
[2024-05-24 02:17:46] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 13/324 constraints. Problems are: Problem set: 6 solved, 8 unsolved
[2024-05-24 02:17:46] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 2 ms to minimize.
[2024-05-24 02:17:47] [INFO ] Deduced a trap composed of 26 places in 552 ms of which 1 ms to minimize.
[2024-05-24 02:17:47] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 3 ms to minimize.
[2024-05-24 02:17:47] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 3 ms to minimize.
[2024-05-24 02:17:47] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 3 ms to minimize.
[2024-05-24 02:17:47] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-05-24 02:17:47] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-05-24 02:17:48] [INFO ] Deduced a trap composed of 75 places in 145 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 8/332 constraints. Problems are: Problem set: 6 solved, 8 unsolved
[2024-05-24 02:17:48] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 1/333 constraints. Problems are: Problem set: 6 solved, 8 unsolved
[2024-05-24 02:17:48] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/760 variables, and 334 constraints, problems are : Problem set: 6 solved, 8 unsolved in 5016 ms.
Refiners :[Domain max(s): 295/295 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/295 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 23/23 constraints]
After SMT, in 7293ms problems are : Problem set: 6 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 295 transition count 798
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 293 transition count 798
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 4 place count 293 transition count 737
Deduced a syphon composed of 61 places in 10 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 126 place count 232 transition count 737
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 140 place count 218 transition count 667
Iterating global reduction 2 with 14 rules applied. Total rules applied 154 place count 218 transition count 667
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 186 place count 202 transition count 651
Applied a total of 186 rules in 219 ms. Remains 202 /295 variables (removed 93) and now considering 651/800 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 202/295 places, 651/800 transitions.
RANDOM walk for 40000 steps (8 resets) in 621 ms. (64 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 525 ms. (76 steps per ms) remains 7/8 properties
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
[2024-05-24 02:17:49] [INFO ] Flow matrix only has 316 transitions (discarded 335 similar events)
// Phase 1: matrix 316 rows 202 cols
[2024-05-24 02:17:49] [INFO ] Computed 16 invariants in 5 ms
[2024-05-24 02:17:49] [INFO ] State equation strengthened by 140 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 160/199 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 3/202 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 316/518 variables, 202/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 140/358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/518 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 358 constraints, problems are : Problem set: 0 solved, 7 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 202/202 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,14 properties remain. new max is 32768
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD size :56997 after 473404
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 160/199 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 02:17:50] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-05-24 02:17:50] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-24 02:17:50] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-05-24 02:17:50] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:17:51] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-05-24 02:17:51] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 2 ms to minimize.
[2024-05-24 02:17:51] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 3/202 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 02:17:51] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:17:51] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-24 02:17:51] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:17:51] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-24 02:17:51] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 02:17:52] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 3 ms to minimize.
[2024-05-24 02:17:52] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 02:17:52] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 02:17:52] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 02:17:52] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 5 ms to minimize.
[2024-05-24 02:17:53] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 316/518 variables, 202/236 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 140/376 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 7/383 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/518 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/518 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 518/518 variables, and 383 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3426 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 202/202 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 18/18 constraints]
After SMT, in 4183ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 3495 ms.
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 651/651 transitions.
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 21 Pre rules applied. Total rules applied 0 place count 202 transition count 630
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 181 transition count 630
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 175 transition count 600
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 175 transition count 600
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 171 transition count 596
Applied a total of 62 rules in 75 ms. Remains 171 /202 variables (removed 31) and now considering 596/651 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 171/202 places, 596/651 transitions.
RANDOM walk for 40000 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
SDD proceeding with computation,14 properties remain. new max is 65536
SDD size :473404 after 1.47396e+06
Interrupted probabilistic random walk after 749082 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :1 out of 2
Probabilistic random walk after 749082 steps, saw 144748 distinct states, run finished after 3007 ms. (steps per millisecond=249 ) properties seen :1
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-24 02:18:00] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 02:18:00] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 02:18:00] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:18:00] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/72 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:18:00] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 129/201 variables, 72/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 24/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 48/249 variables, 21/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 12/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 72/321 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/327 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 105/432 variables, 78/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/432 variables, 80/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/432 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/72 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 129/201 variables, 72/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 24/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 48/249 variables, 21/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 12/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 72/321 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/327 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:18:01] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-24 02:18:01] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2024-05-24 02:18:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:18:01] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/327 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/327 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 105/432 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/432 variables, 80/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/432 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 927ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 38 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 170/171 places, 595/596 transitions.
RANDOM walk for 40000 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 745368 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :0 out of 1
Probabilistic random walk after 745368 steps, saw 144188 distinct states, run finished after 3001 ms. (steps per millisecond=248 ) properties seen :0
[2024-05-24 02:18:04] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-24 02:18:04] [INFO ] Computed 16 invariants in 11 ms
[2024-05-24 02:18:04] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:18:04] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/71 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/319 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/325 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 105/430 variables, 78/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 80/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/430 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/430 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/71 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:18:05] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 128/199 variables, 71/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 24/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 48/247 variables, 21/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 72/319 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/319 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/325 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:18:05] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/325 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/325 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 105/430 variables, 78/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 80/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/430 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/430 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 835ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 26 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 24 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-24 02:18:05] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:18:05] [INFO ] Invariant cache hit.
[2024-05-24 02:18:05] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-24 02:18:05] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:18:05] [INFO ] Invariant cache hit.
[2024-05-24 02:18:06] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:18:06] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
[2024-05-24 02:18:06] [INFO ] Redundant transitions in 51 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-24 02:18:06] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-24 02:18:06] [INFO ] Invariant cache hit.
[2024-05-24 02:18:06] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:18:10] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 3 ms to minimize.
[2024-05-24 02:18:10] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-24 02:18:10] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2024-05-24 02:18:10] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-05-24 02:18:11] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
[2024-05-24 02:18:11] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-24 02:18:11] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 13 ms to minimize.
[2024-05-24 02:18:11] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-24 02:18:11] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:18:12] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 3 ms to minimize.
[2024-05-24 02:18:12] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-05-24 02:18:12] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-24 02:18:12] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:18:12] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
[2024-05-24 02:18:13] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-05-24 02:18:13] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-24 02:18:13] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:18:13] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:18:13] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 2 ms to minimize.
[2024-05-24 02:18:14] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:18:14] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-05-24 02:18:15] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 3 ms to minimize.
[2024-05-24 02:18:15] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:18:15] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 2 ms to minimize.
[2024-05-24 02:18:16] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 3 ms to minimize.
[2024-05-24 02:18:16] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:18:16] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-24 02:18:16] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-24 02:18:16] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2024-05-24 02:18:16] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-24 02:18:17] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
Reachability property EisenbergMcGuire-PT-05-ReachabilityFireability-2024-14 is true.
[2024-05-24 02:18:17] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 3 ms to minimize.
[2024-05-24 02:18:17] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-24 02:18:17] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 3 ms to minimize.
[2024-05-24 02:18:17] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 3 ms to minimize.
[2024-05-24 02:18:17] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 1 ms to minimize.
[2024-05-24 02:18:18] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-24 02:18:18] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 2 ms to minimize.
[2024-05-24 02:18:18] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-05-24 02:18:18] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
SDD proceeding with computation,13 properties remain. new max is 65536
SDD size :1.47396e+06 after 4.41252e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:18:22] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 3 ms to minimize.
[2024-05-24 02:18:23] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 3 ms to minimize.
[2024-05-24 02:18:23] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 2 ms to minimize.
[2024-05-24 02:18:23] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-05-24 02:18:23] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-24 02:18:23] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 02:18:23] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
[2024-05-24 02:18:24] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 3 ms to minimize.
[2024-05-24 02:18:24] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 3 ms to minimize.
[2024-05-24 02:18:24] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 3 ms to minimize.
[2024-05-24 02:18:24] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 2 ms to minimize.
[2024-05-24 02:18:24] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 2 ms to minimize.
[2024-05-24 02:18:24] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 3 ms to minimize.
[2024-05-24 02:18:25] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 3 ms to minimize.
[2024-05-24 02:18:25] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 2 ms to minimize.
[2024-05-24 02:18:26] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 1 ms to minimize.
[2024-05-24 02:18:26] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2024-05-24 02:18:26] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:18:28] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 3 ms to minimize.
[2024-05-24 02:18:28] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 3 ms to minimize.
[2024-05-24 02:18:28] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 3 ms to minimize.
[2024-05-24 02:18:28] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 3 ms to minimize.
[2024-05-24 02:18:29] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 3 ms to minimize.
[2024-05-24 02:18:29] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2024-05-24 02:18:29] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 3 ms to minimize.
[2024-05-24 02:18:29] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-24 02:18:30] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 2 ms to minimize.
[2024-05-24 02:18:30] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 3 ms to minimize.
[2024-05-24 02:18:30] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-05-24 02:18:30] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 3 ms to minimize.
[2024-05-24 02:18:30] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 3 ms to minimize.
[2024-05-24 02:18:31] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-05-24 02:18:31] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 3 ms to minimize.
[2024-05-24 02:18:32] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 3 ms to minimize.
[2024-05-24 02:18:32] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-24 02:18:32] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 18/92 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:18:35] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 93 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 77/93 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:18:41] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 2 ms to minimize.
[2024-05-24 02:18:42] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 2 ms to minimize.
[2024-05-24 02:18:42] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-24 02:18:43] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:18:43] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:18:44] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2024-05-24 02:18:44] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-05-24 02:18:46] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:18:47] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 1 ms to minimize.
[2024-05-24 02:18:47] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-05-24 02:18:47] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-24 02:18:47] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 2 ms to minimize.
[2024-05-24 02:18:47] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:18:51] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2024-05-24 02:18:52] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 3 ms to minimize.
[2024-05-24 02:18:52] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:18:52] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:18:56] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:18:56] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-05-24 02:18:56] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2024-05-24 02:18:57] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-24 02:18:58] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-24 02:18:58] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-24 02:19:02] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 17 ms to minimize.
[2024-05-24 02:19:02] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 2 ms to minimize.
[2024-05-24 02:19:02] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:19:02] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:19:02] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-05-24 02:19:03] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-05-24 02:19:03] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:19:03] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:19:03] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2024-05-24 02:19:03] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 2 ms to minimize.
[2024-05-24 02:19:03] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 2 ms to minimize.
[2024-05-24 02:19:04] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2024-05-24 02:19:04] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 13/129 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/430 variables, and 129 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 113/113 constraints]
After SMT, in 60510ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60527ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61676 ms. Remains : 170/170 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 6 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 174 place count 61 transition count 116
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 193 place count 61 transition count 97
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 211 place count 52 transition count 172
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 215 place count 52 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 220 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 221 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 222 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 247 place count 51 transition count 162
Applied a total of 247 rules in 75 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-05-24 02:19:07] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 02:19:07] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-24 02:19:07] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 02:19:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-24 02:19:07] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 02:19:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 02:19:07] [INFO ] After 14ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 02:19:07] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 02:19:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
TRAPS : Iteration 1
[2024-05-24 02:19:07] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 02:19:07] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-24 02:19:07] [INFO ] Flatten gal took : 28 ms
[2024-05-24 02:19:07] [INFO ] Flatten gal took : 26 ms
[2024-05-24 02:19:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17869162505933603590.gal : 8 ms
[2024-05-24 02:19:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13771762617639280243.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/ReachabilityCardinality17869162505933603590.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13771762617639280243.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13771762617639280243.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 29
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :29 after 35
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :35 after 128
Reachability property EisenbergMcGuire-PT-05-ReachabilityFireability-2024-08 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,812,0.060367,5208,2,216,10,1596,6,0,369,856,0
Total reachable state count : 812

Verifying 1 reachability properties.
Reachability property EisenbergMcGuire-PT-05-ReachabilityFireability-2024-08 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-05-ReachabilityFireability-2024-08,8,0.061824,5580,2,68,10,1596,7,0,378,856,0
Over-approximation ignoring read arcs solved 0 properties in 587 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 02:19:07] [INFO ] Flatten gal took : 74 ms
[2024-05-24 02:19:07] [INFO ] Applying decomposition
[2024-05-24 02:19:08] [INFO ] Flatten gal took : 71 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/graph9043786866606776939.txt' '-o' '/tmp/graph9043786866606776939.bin' '-w' '/tmp/graph9043786866606776939.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9043786866606776939.bin' '-l' '-1' '-v' '-w' '/tmp/graph9043786866606776939.weights' '-q' '0' '-e' '0.001'
[2024-05-24 02:19:08] [INFO ] Decomposing Gal with order
[2024-05-24 02:19:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 02:19:08] [INFO ] Removed a total of 1298 redundant transitions.
[2024-05-24 02:19:08] [INFO ] Flatten gal took : 332 ms
[2024-05-24 02:19:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 187 labels/synchronizations in 63 ms.
[2024-05-24 02:19:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1452316285523558481.gal : 22 ms
[2024-05-24 02:19:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11566417991464616075.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/ReachabilityCardinality1452316285523558481.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11566417991464616075.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/ReachabilityCardinality11566417991464616075.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7 after 2198
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2198 after 2413
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2413 after 14632
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :14632 after 81872
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :81872 after 850720
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :850720 after 9.15118e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9.15118e+06 after 2.72106e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.72106e+07 after 4.36064e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8.78227e+07 after 8.7827e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.14106e+08,1327.71,5940504,104973,15479,4.13772e+06,183801,1651,4.74199e+07,264,6.55708e+06,0
Total reachable state count : 114106399

Verifying 1 reachability properties.
Reachability property EisenbergMcGuire-PT-05-ReachabilityFireability-2024-08 is true.
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-05-ReachabilityFireability-2024-08,1,1329.99,5940504,100,60,4.13772e+06,183801,1654,4.74199e+07,268,6.55708e+06,449
All properties solved without resorting to model-checking.
Total runtime 1421254 ms.

BK_STOP 1716518479817

--------------------
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="EisenbergMcGuire-PT-05"
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 EisenbergMcGuire-PT-05, 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 r158-smll-171636266300167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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